Bottom-k sketches: Better and more efficient estimation of aggregates

Performance Evaluation Review

Volumn 35, Issue 1, 2007, Pages 353-354

  Cohen, Edith ^a   Kaplan, Haim ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximate query processing; Bottom k; Sketches

Indexed keywords

DATA STRUCTURES; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

APPROXIMATE QUERY PROCESSING; BOTTOM-K SKETCHES;

PARAMETER ESTIMATION;

EID: 36348984470     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1269899.1254926     Document Type: Conference Paper

References (16)

1. N. Alon, N. Duffield, M. Thorup, and C. Lund. Estimating arbitrary subset sums with few probes. In Proc. ACM PODS, pages 317-325, 2005.
2. K. Bharat and A. Z. Broder. Mirror, mirror on the web: A study of host pairs with replicated content. In Proc. WWW8, pages 501-512, 1999.
3. A.Z. Broder. On the resemblance and containment of documents. In Proceedings of the Compression and Complexity of Sequences, pages 21-29. ACM, 1997.
4. A. Z. Broder. Identifying and filtering near-duplicate documents. In Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, volume 1848 of LLNCS, pages 1-10. Springer, 2000.
5. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. Journal of Computer and System Sciences, 60(3):630-659, 2000.
6. E. Cohen. Size-estimation framework, with applications to transitive closure and reachability. J. Comput System Sci., 55:441-453, 1997.
7. E. Cohen, N. Duffield, H. Kaplan, C. Lund, and M. Thorup. Sketching unaggregated data streams for subpopulation-size queries. In Proc. of the ACM PODS, 2007.
8. E. Cohen and H. Kaplan. Efficient estimation algorithms for neighborhood variance and other moments. In Proc. 15th ACM-SIAM. Symposium on Discrete Algorithms. ACM-SIAM, 2004.
9. E. Cohen and H. Kaplan. Sketches and estimators for sub-population weight queries. Manuscript, 2007.
10. E. Cohen and H. Kaplan. Spatially-decaying aggregation over a network: model and algorithms. J. Comput. System Sci., 73:265-288, 2007.
11. E. Cohen and H. Kaplan. Summarizing data using bottom-k sketches. Manuscript, 2007.
12. E. Cohen, Y.-M. Wang, and G. Suri. When piecewise determinism is almost true. In Proc. Pacific Rim International Symposium on Fault-Tolerant Systems, pages 66-71, December 1995.
13. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. J. Comput. System Sci., 31:182-209, 1985.
14. H. Kaplan and M. Shark. Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. In Proc. ACM SODA, pages 484-493, 2006.
15. R. Motwani, E. Cohen, M. Datar, S. Fujiware, A. Granis, P. Indyk, J. Ullman, and C. Yang. Finding interesting associations without support pruning. IEEE Transactions on Knowledge and Data Engineering, 13:64-78, 2001.
16. N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network, traffic. In Proceedings of the ACM SIGCOMM'00 Conference. ACM, 2000.