Applying sampling and predicate pushdown in an interactive data exploration system
Name
1193021484-MIT.pdf
Size
383.46 KB
Format
Adobe PDF
Checksum (MD5)
cf2916672195be4838952e1ab9e2a97c
Author(s)
Lam, Jason,M. Eng.Massachusetts Institute of Technology.
Advisor(s)
Tim Kraska.
Date Issued
2020
Publisher
Massachusetts Institute of Technology
Abstract
Interactive data exploration (IDE) systems require low latency and high performance, as users expect to see their ad-hoc queries return results quickly for a seamless experience. Predicate pushdown is a common performance optimization for systems that rely on databases, by pushing the filtering that was originally performed by the overarching system down to its underlying database systems. In this work, we implement both sampling and predicate pushdown in Northstar, a system for interactive data science. We then investigate and benchmark optimization strategies for predicate pushdown in Northstar, and find that a cache-aware "adaptive" pushdown strategy leads in the greatest performance gain in many cases.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May, 2020
Cataloged from the official PDF of thesis.
Includes bibliographical references (page 43).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
Persistent DSpace Link
