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

Proceedings of the 8th ACM European Conference on Computer Systems, EuroSys 2013

Volumn , Issue , 2013, Pages 29-42

  Agarwal, Sameer ^a   Mozafari, Barzan ^b   Panda, Aurojit ^a   Milner, Henry ^a   Madden, Samuel ^b   Stoica, Ion ^a,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Conviva Inc ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE OPTIMIZATION; APPROXIMATE QUERY; DYNAMIC SAMPLE SELECTION; INTERACTIVE QUERIES; MASSIVELY PARALLELS; TIME REQUIREMENTS; TPC-H BENCHMARKS; VIDEO DISTRIBUTION;

QUERY PROCESSING;

EID: 84877703682     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2465351.2465355     Document Type: Conference Paper

References (26)

1. Apache Hadoop Distributed File System. http://hadoop.apache.org/hdfs/.
2. Apache Hadoop Mapreduce Project. http://hadoop.apache.org/mapreduce/.
3. TPC-H Query Processing Benchmarks. http://www.tpc.org/tpch/.
4. S. Acharya, P. B. Gibbons, and V. Poosala. Congressional samples for approximate answering of group-by queries. In ACM SIGMOD, May 2000.
5. S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy. Join synopses for approximate query answering. In ACM SIGMOD, June 1999.
6. S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy. The Aqua approximate query answering system. ACM SIGMOD Record, 28(2), 1999.
7. S. Agarwal, S. Kandula, N. Bruno, M.-C. Wu, I. Stoica, and J. Zhou. Reoptimizing Data Parallel Computing. In NSDI, 2012.
8. G. Ananthanarayanan, S. Kandula, A. G. Greenberg, et al. Reining in the outliers in map-reduce clusters using mantri. In OSDI, pages 265-278, 2010.
9. B. Babcock, S. Chaudhuri, and G. Das. Dynamic sample selection for approximate query processing. In VLDB, 2003.
10. S. Chaudhuri, G. Das, and V. Narasayya. Optimized stratified sampling for approximate query processing. TODS, 2007.
11. T. Condie, N. Conway, P. Alvaro, J. M. Hellerstein, K. Elmeleegy, and R. Sears. Mapreduce online. In NSDI, 2010.
12. G. Cormode. Sketch techniques for massive data. In Synposes for Massive Data: Samples, Histograms, Wavelets and Sketches. 2011.
13. C. Engle, A. Lupher, R. Xin, M. Zaharia, et al. Shark: Fast Data Analysis Using Coarse-grained Distributed Memory. In SIGMOD, 2012.
14. M. Garofalakis and P. Gibbons. Approximate query processing: Taming the terabytes. In VLDB, 2001. Tutorial.
15. J. M. Hellerstein, P. J. Haas, and H. J. Wang. Online aggregation. In SIGMOD, 1997.
16. S. Lohr. Sampling: design and analysis. Thomson, 2009.
17. S. Melnik, A. Gubarev, J. J. Long, G. Romer, S. Shivakumar, M. Tolton, and T. Vassilakis. Dremel: interactive analysis of web-scale datasets. Commun. ACM, 54:114-123, June 2011.
18. C. Olston, E. Bortnikov, K. Elmeleegy, F. Junqueira, and B. Reed. Interactive analysis of web-scale data. In CIDR, 2009.
19. N. Pansare, V. R. Borkar, C. Jermaine, and T. Condie. Online Aggregation for Large MapReduce Jobs. PVLDB, 4(11):1135-1145, 2011.
20. C. Sapia. Promise: Predicting query behavior to enable predictive caching strategies for olap systems. DaWaK, pages 224-233. Springer-Verlag, 2000.
21. L. Sidirourgos, M. L. Kersten, and P. A. Boncz. SciBORQ: Scientific data management with Bounds On Runtime and Quality. In CIDR'11, 2011.
22. A. Thusoo, J. S. Sarma, N. Jain, et al. Hive: a warehousing solution over a map-reduce framework. PVLDB, 2(2), 2009.
23. S. Tirthapura and D. Woodruff. Optimal random sampling from distributed streams revisited. Distributed Computing, pages 283-297, 2011.
24. J. S. Vitter and M. Wang. Approximate computation of multidimensional aggregates of sparse data using wavelets. SIGMOD, 1999.
25. M. Zaharia et al. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In NSDI, 2012.
26. M. Zaharia, A. Konwinski, A. D. Joseph, et al. Improving MapReduce Performance in Heterogeneous Environments. In OSDI, 2008.