Blink and It's Done: Interactive Queries on Very Large Data
Blink and It's Done: Interactive Queries on Very Large Data
复制标题
眨眼就完成了:对超大数据的交互式查询
DOI:
10.14778/2367502.2367533
复制
发表时间:
2012
期刊:
影响因子:
--
通讯作者:
I. Stoica
中科院分区:
文献类型:
--
作者:
Sameer Agarwal;Aurojit Panda;Barzan Mozafari;A. Iyer;S. Madden;I. Stoica
In this demonstration, we present BlinkDB, a massively parallel, sampling-based approximate query processing framework for running interactive queries on large volumes of data. The key observation in BlinkDB is that one can make reasonable decisions in the absence of perfect answers. BlinkDB extends the Hive/HDFS stack and can handle the same set of SPJA (selection, projection, join and aggregate) queries as supported by these systems. BlinkDB provides real-time answers along with statistical error guarantees, and can scale to petabytes of data and thousands of machines in a fault-tolerant manner. Our experiments using the TPC-H benchmark and on an anonymized real-world video content distribution workload from Conviva Inc. show that BlinkDB can execute a wide range of queries up to 150x faster than Hive on MapReduce and 10--150x faster than Shark (Hive on Spark) over tens of terabytes of data stored across 100 machines, all with an error of 2--10%.