Optimal splitters for database partitioning with size bounds

ACM International Conference Proceeding Series

Volumn 361, Issue , 2009, Pages 98-110

  Ross, Kenneth A ^a   Cieslewicz, John ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; DATABASE ALGORITHM; DATABASE PARTITIONING; HEAVY-HITTER; OPTIMAL SETS; SUBTASKS; TIME COMPLEXITY;

DATABASE SYSTEMS; OPTIMIZATION;

SET THEORY;

EID: 70349118210     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514907     Document Type: Conference Paper

References (27)

1. R. Agrawal and A. Swami. A one-pass space-efficient algorithm for finding quantiles. In COMAD, 1995.
2. S. Chaudhuri. An overview of query optimization in relational systems. In PODS, pages 34-43, 1998.
3. D. J. DeWitt, J. F. Naughton, and D. A. Schneider. Parallel sorting on a shared-nothing architecture using probabilistic splitting. In Conf. on Parallel and Dist. Info. Sys., pages 280-291, 1991.
4. D. J. DeWitt, J. F. Naughton, D. A. Schneider, and S. Seshadri. Practical skew handling in parallel joins. In VLDB, pages 27-40, 1992.
5. J. Doweck. Inside intel core microarchitecture. In Hot Chips, August 2006.
6. V. Gaede and O. Günther. Multidimensional access methods. ACM Comput. Surv., 30(2):170-231, 1998.
7. S. Ghandeharizadeh and D. J. DeWitt. Hybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines. In VLDB, pages 481-492, 1990.
8. J. Gray, P. Sundaresan, S. Englert, K. Baclawski, and P. J. Weinberger. Quickly generating billion-record synthetic databases. In SIGMOD, pages 243-252, 1994.
9. A. P. Gurajada and J. Srivastava. Equidepth partitioning of a data set based on finding its medians. In Applied Computing, pages 92-101, 1991.
10. P. J. Haas and A. N. Swami. Sampling-based selectivity estimation for joins using augmented frequent value statistics. In ICDE, pages 522-531, 1995.
11. K. A. Hua and C. Lee. Handling data skew in multiprocessor database computers using partition tuning. In VLDB, pages 525-535, 1991.
12. J. Huang and Y. Chow. Parallel sorting and data partitioning by sampling. In Proc, of Symposium on Parallel Algorithms and Architectures, pages 627-631, 1983.
13. Y. E. Ioannidis. The history of histograms (abridged). In VLDB, pages 19-30, 2003.
14. Y. E. Ioannidis and V. Poosala. Balancing histogram optimality and practicality for query result size estimation. In SIGMOD, pages 233-244, 1995.
15. Y. E. Ioannidis and V. Poosala. Histogram-based approximation of set-valued query-answers. In VLDB, pages 174-185, 1999.
16. B. R. Iyer et al. Percentile finding algorithm for multiple sorted runs. In VLDB, pages 135-144, 1989.
17. H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal histograms with quality guarantees. In VLDB, pages 275-286, 1998.
18. S. Khanna, S. Muthukrishnan, and S. Skiena. Efficient array partitioning. In ICALP, pages 616-626, 1997.
19. M. Kitsuregawa and Y. Ogawa. Bucket spreading parallel hash: A new, robust, parallel hash join method for data skew in the super database computer (sdc). In VLDB, pages 210-221, 1990.
20. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. In SIGMOD, pages 426-435, 1998.
21. C. Martinez and S. Roura. Optimal sampling strategies in quicksort and quickselect. SIAM J. Comput., 31(3):683-705, 2001.
22. D. R. Musser. Introspective sorting and selection algorithms. Softw., Pract. Exper., 27(8):983-993, 1997.
23. S. Muthukrishnan, V. Poosala, and T. Suel. On rectangular partitionings in two dimensions: Algorithms, complexity, and applications. In ICDT, pages 236-256, 1999.
24. V. Poosala and Y. E. Ioannidis. Estimation of query-result distribution and its application in parallel-join load balancing. In VLDB, pages 448-459, 1996.
25. V. Poosala, Y. E. Ioannidis, P. J. Haas, and E. J. Shekita. Improved histograms for selectivity estimation of range predicates. In SIGMOD, pages 294-305, 1996.
26. P. Sanders and S. Winkel. Super scalar sample sort. In European Symposium, on Algorithms, pages 784-796, 2004.
27. M. Stonebraker, D. J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. J. O'Neil, P. E. O'Neil, A. Rasin, N. Tran, and S. B. Zdonik. C-store: A column-oriented DBMS. In VLDB, pages 553-564, 2005.