Knowing when you're wrong: Building fast and reliable approximate query processing systems

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2014, Pages 481-492

  Agarwal, Sameer ^a   Milner, Henry ^a   Kleiner, Ariel ^a   Talwalkar, Ameet ^a   Jordan, Michael ^a   Madden, Samuel ^b   Mozafari, Barzan ^c   Stoica, Ion ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Approximate query processing; Diagnostics; Error estimation

Indexed keywords

DATABASE SYSTEMS; ERROR ANALYSIS; PLASMA DIAGNOSTICS;

APPROXIMATE QUERY PROCESSING; DATA ANALYTICS; MEMORY BANDWIDTHS; NEAR-REAL TIME; PRODUCTION WORKLOADS; QUERY APPROXIMATIONS; SAMPLING-BASED; STATISTICAL TECHNIQUES;

QUERY PROCESSING;

EID: 84904345100     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2588555.2593667     Document Type: Conference Paper

References (40)

1. AMPLab Big Data Benchmark. https://amplab.cs.berkeley.edu/benchmark/.
2. BlinkDB alpha 0.1.1. http://blinkdb.org.
3. Common Crawl Document Corpus. http://commoncrawl.org/.
4. Conviva Networks. http://www.conviva.com/.
5. Facebook Presto. http://prestodb.io/.
6. Intel Hadoop Benchmark. https://github.com/intel-hadoop/HiBench.
7. S. Acharya, P. B. Gibbons, and V. Poosala. Aqua: A fast decision support system using approximate query answers. In VLDB, 1999.
8. S. Agarwal, B. Mozafari, A. Panda, H. Milner, S. Madden, and I. Stoica. BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large Data. In EuroSys, 2013.
9. S. Agarwal, A. Panda, B. Mozafari, A. P. Iyer, S. Madden, and I. Stoica. Blink and It's Done: Interactive Queries on Very Large Data. PVLDB, 5(12), 2012.
10. P. Agrawal, D. Kifer, and C. Olston. Scheduling shared scans of large data files. PVLDB, 2008.
11. N. Bruno, S. Agarwal, S. Kandula, B. Shi, M.-C. Wu, and J. Zhou. Recurring job optimization in scope. In SIGMOD, 2012.
12. A. J. Canty, A. C. Davison, D. V. Hinkley, and V. Ventura. Bootstrap diagnostics and remedies. Canadian Journal of Statistics, 34(1), 2006.
13. S. Chaudhuri, G. Das, and V. Narasayya. Optimized stratified sampling for approximate query processing. TODS, 2007.
14. T. Condie, N. Conway, P. Alvaro, J. M. Hellerstein, K. Elmeleegy, and R. Sears. Mapreduce online. In NSDI, 2010.
15. A. Dobra, C. Jermaine, F. Rusu, and F. Xu. Turbo-charging estimate convergence in dbo. PVLDB, 2(1), 2009.
16. B. Efron. Bootstrap methods: another look at the jackknife. The annals of Statistics, 1979.
17. B. Efron and R. Tibshirani. An introduction to the bootstrap, volume 57. CRC press, 1993.
18. G. Giannikis, G. Alonso, and D. Kossmann. Shareddb: Killing one thousand queries with one stone. PVLDB, 2012.
19. P. J. Haas and P. J. Haas. Hoeffding inequalities for join-selectivity estimation and online aggregation. In IBM Research Report RJ 10040, IBM Almaden Research, 1996.
20. P. Hall. On symmetric bootstrap confidence intervals. Journal of the Royal Statistical Society. Series B (Methodological), 50(1), 1988.
21. J. M. Hellerstein, P. J. Haas, and H. J. Wang. Online aggregation. In SIGMOD, 1997.
22. A. Kleiner, A. Talwalkar, S. Agarwal, I. Stoica, and M. I. Jordan. A general bootstrap performance diagnostic. In KDD, 2013.
23. N. Laptev, K. Zeng, and C. Zaniolo. Early Accurate Results for Advanced Analytics on MapReduce. PVLDB, 5(10), 2012.
24. C. McDiarmid. Concentration. In Probabilistic methods for algorithmic discrete mathematics. Springer, 1998.
25. R. B. Miller. Response time in man-computer conversational transactions. In Proceedings of the December 9-11, 1968, fall joint computer conference, part I. ACM, 1968.
26. B. Mozafari and C. Zaniolo. Optimal load shedding with aggregates and mining queries. In ICDE, 2010.
27. F. Olken and D. Rotem. Simple random sampling from relational databases. In VLDB, 1986.
28. N. C. Oza. Online bagging and boosting. In International Conference on Systems, Man, and Cybernetics, Special Session on Ensemble Methods for Extreme Environments, 2005.
29. N. Pansare, V. R. Borkar, C. Jermaine, and T. Condie. Online aggregation for large mapreduce jobs. PVLDB, 4(11), 2011.
30. A. Pol and C. Jermaine. Relational confidence bounds are easy with the bootstrap. In In SIGMOD, 2005.
31. C. Qin and F. Rusu. PF-OLA: a high-performance framework for parallel online aggregation. Distributed and Parallel Databases, 2013.
32. J. Rice. Mathematical Statistics and Data Analysis. Brooks/Cole Pub. Co., 1988.
33. A. Thusoo et al. Hive: a warehousing solution over a map-reduce framework. PVLDB, 2(2), 2009.
34. A. van der Vaart. Asymptotic statistics, volume 3. Cambridge university press, 2000.
35. A. van der Vaart and J. Wellner. Weak Convergence and Empirical Processes: With Applications to Statistics. Springer Series in Statistics. Springer, 1996.
36. J. Wang et al. A Sample-and-Clean Framework for Fast and Accurate Query Processing on Dirty Data. In SIGMOD, 2014.
37. X. Wang, C. Olston, A. D. Sarma, and R. C. Burns. Coscan: cooperative scan sharing in the cloud. In SoCC, 2011.
38. R. S. Xin, J. Rosen, M. Zaharia, M. J. Franklin, S. Shenker, and I. Stoica. Shark: SQL and rich analytics at scale. In SIGMOD Conference, 2013.
39. M. Zaharia et al. Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing. In NSDI, 2012.
40. K. Zeng et al. The Analytical Bootstrap: a New Method for Fast Error Estimation in Approximate Query Processing. In SIGMOD, 2014.