Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. BlinkDB: queries with bounded errors and bounded response times on very large data

BlinkDB: queries with bounded errors and bounded response times on very large data

Thumbnail Image
Download
Name

Madden_BlinkDB.pdf

Size

876.59 KB

Format

Adobe PDF

Checksum (MD5)

a325bb525505d60783bb5a8df45c899d

Author(s)
Agarwal, Sameer
•
Mozafari, Barzan
•
Panda, Aurojit
•
Milner, Henry
•
Stoica, Ion
•
Madden, Samuel R.
Date Issued
April 2013
Journal
Proceedings of the 8th ACM European Conference on Computer Systems (EuroSys '13)
Publisher
Association for Computing Machinery (ACM)
Citation
Sameer Agarwal, Barzan Mozafari, Aurojit Panda, Henry Milner, Samuel Madden, and Ion Stoica. 2013. BlinkDB: queries with bounded errors and bounded response times on very large data. In Proceedings of the 8th ACM European Conference on Computer Systems (EuroSys '13). ACM, New York, NY, USA, 29-42.
Version
Author's final manuscript
Abstract
In this paper, we present BlinkDB, a massively parallel, approximate query engine for running interactive SQL queries on large volumes of data. BlinkDB allows users to trade-off query accuracy for response time, enabling interactive queries over massive data by running queries on data samples and presenting results annotated with meaningful error bars. To achieve this, BlinkDB uses two key ideas: (1) an adaptive optimization framework that builds and maintains a set of multi-dimensional stratified samples from original data over time, and (2) a dynamic sample selection strategy that selects an appropriately sized sample based on a query's accuracy or response time requirements. We evaluate BlinkDB against the well-known TPC-H benchmarks and a real-world analytic workload derived from Conviva Inc., a company that manages video distribution over the Internet. Our experiments on a 100 node cluster show that BlinkDB can answer queries on up to 17 TBs of data in less than 2 seconds (over 200 x faster than Hive), within an error of 2-10%.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/100911
DOI of Published Version
https://doi.org/10.1145/2465351.2465355
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.