Mergeable summaries

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2012, Pages 23-34

  Agarwal, Pankaj K ^a   Cormode, Graham ^b   Huang, Zengfeng ^c   Phillips, Jeff ^d   Wei, Zhewei ^c   Yi, Ke ^c  

^a DUKE UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^d UNIVERSITY OF UTAH   (United States)

Author keywords

streaming algorithms; summaries

Indexed keywords

DATA SETS; DATA SUMMARIES; DISTRIBUTED DATA; HEAVY-HITTER; LINEAR FUNCTIONS; STREAMING ALGORITHM; SUMMARIES;

EID: 84862594784     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213556.2213562     Document Type: Conference Paper

References (44)

1. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measure of points. Journal of the ACM, 51(4):660-635, 2004.
2. P. K. Agarwal, J. M. Phillips, and H. Yu. Stability of ε-kernels. In Proc. European Symposium on Algorithms, 2010.
3. P. K. Agarwal and H. Yu. A space-optimal data-stream algorithm for coresets in the plane. In Proc. Annual Symposium on Computational Geometry, 2007.
4. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
5. N. Bansal. Constructive algorithms for discrepancy minimization. In Proc. IEEE Symposium on Foundations of Computer Science, pages 407-414, 2010.
6. Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In RANDOM, 2002.
7. G. Barequet and S. Har-Peled. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. Journal of Algorithms, 38:91-109, 2001. (Pubitemid 33667202)
8. R. Berinde, G. Cormode, P. Indyk, and M. Strauss. Space-optimal heavy hitters with strong error bounds. ACM Transactions on Database Systems, 35(4), 2010.
9. T. Chan. Faster core-set constructions and data-stream algorithms in fixed dimensions. Computational Geometry: Theory and Applications, 35:20-35, 2006.
10. T. Chan. Dynamic coresets. In Proc. Annual Symposium on Computational Geometry, 2008.
11. M. Charikar, A. Newman, and A. Nikolov. Tight hardness results for minimizing discrepancy. In Proc. ACM-SIAM Symposium on Discrete Algorithms, 2011.
12. B. Chazelle. The Discrepancy Method. Cambridge, 2000.
13. B. Chazelle and J. Matousek. On linear-time deterministic algorithms for optimization problems in fixed dimensions. Journal of Algorithms, 21:579-597, 1996. (Pubitemid 126411479)
14. G. Cormode and M. Hadjieleftheriou. Finding frequent items in data streams. Proc. VLDB Endowment, 1(2):1530-1541, 2008.
15. G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. Journal of Algorithms, 55(1):58-75, 2005. (Pubitemid 40357145)
16. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. Graph distances in the streaming model: The value of space. In ACM-SIAM Symposium on Discrete Algorithms, 2005.
17. J. Feigenbaum, S. Kannan, M. J. Strauss, and M. Viswanathan. An approximate L1-difference algorithm for massive data streams. SIAM Journal on Computing, 32(1):131-151, 2003.
18. J. Feldman, S. Muthukrishnan, A. Sidiropoulos, C. Stein, and Z. Svitkina. On distributing symmetric streaming computations. In Proc. ACM-SIAM Symposium on Discrete Algorithms, 2008.
19. S. Ganguly and A. Majumder. CR-precis: A deterministic summary structure for update data streams. In ESCAPE, 2007.
20. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. How to summarize the universe: Dynamic maintenance of quantiles. In Proc. International Conference on Very Large Data Bases, 2002.
21. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In Proc. ACM SIGMOD International Conference on Management of Data, 2001.
22. M. Greenwald and S. Khanna. Power conserving computation of order-statistics over sensor networks. In Proc. ACM Symposium on Principles of Database Systems, 2004.
23. S. Guha. Tight results for clustering and summarizing data streams. In Proc. International Conference on Database Theory, 2009.
24. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In Proc. IEEE Conference on Foundations of Computer Science, 2000.
25. S. Har-Peled. Approximation Algorithm in Geometry (Chapter 21). http://valis.cs.uiuc.edu/~sariel/teach/notes/aprx/, 2010.
26. D. M. Kane, J. Nelson, and D. P. Woodruff. An optimal algorithm for the distinct elements problem. In Proc. ACM Symposium on Principles of Database Systems, 2010.
27. K. G. Larsen. On range searching in the group model and combinatorial discrepancy. under submission, 2011.
28. Y. Li, P. M. Long, and A. Srinivasan. Improved bounds on the sample complexity of learning. Journal of Computer and System Sciences, 62:516-527, 2001. (Pubitemid 32444150)
29. S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. TAG: a tiny aggregation service for ad-hoc sensor networks. In Proc. Symposium on Operating Systems Design and Implementation, 2002.
30. A. Manjhi, S. Nath, and P. B. Gibbons. Tributaries and deltas: efficient and robust aggregation in sensor network streams. In Proc. ACM SIGMOD International Conference on Management of Data, 2005.
31. A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (recently) frequent items in distributed data streams. In Proc. IEEE International Conference on Data Engineering, 2005.
32. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. In Proc. ACM SIGMOD International Conference on Management of Data, 1998.
33. J. Matousek. Approximations and optimal geometric divide-and-conquer. In Proc. ACM Symposium on Theory of Computing, 1991.
34. J. Matousek. Geometric Discrepancy; An Illustrated Guide. Springer, 1999.
35. A. Metwally, D. Agrawal, and A. Abbadi. An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Transactions on Database Systems, 31(3):1095-1133, 2006. (Pubitemid 44600833)
36. J. Misra and D. Gries. Finding repeated elements. Science of Computer Programming, 2:143-152, 1982.
37. J. Nelson and D. P. Woodruff. Fast manhattan sketches in data streams. In Proc. ACM Symposium on Principles of Database Systems, 2010.
38. J. M. Phillips. Algorithms for ε-approximations of terrains. In Proc. ICALP, 2008.
39. N. Shrivastava, C. Buragohain, D. Agrawal, and S. Suri. Medians and beyond: New aggregation techniques for sensor networks. In Proc. ACM SenSys, 2004.
40. S. Suri, C. Toth, and Y. Zhou. Range counting over multidimensional data streams. Discrete and Computational Geometry, 36(4):633-655, 2006. (Pubitemid 44631974)
41. M. Talagrand. Sharper bounds for Gaussian and emperical processes. Annals of Probability, 22:76, 1994.
42. V. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16:264-280, 1971.
43. H. Yu, P. K. Agarwal, R. Poreddy, and K. R. Varadarajan. Practical methods for shape fitting and kinetic data structures using coresets. In Proc. Annual Symposium on Computational Geometry, 2004.
44. H. Zarrabi-Zadeh. An almost space-optimal streaming algorithm for coresets in fixed dimensions. In Proc. European Symposium on Algorithms, 2008.