Sampling in dynamic data streams and applications

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 142-149

  Frahling, Gereon ^a   Indyk, Piotr ^b   Sohler, Christian ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computational Geometry; Data Structures; Streaming Algorithms

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; SAMPLING; SET THEORY; TREES (MATHEMATICS);

GEOMETRIC SPACE; LOW-STORAGE DATA STRUCTURES; STREAMING ALGORITHMS;

DATA STRUCTURES;

EID: 33244484582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064116     Document Type: Conference Paper

References (26)

1. N. Alon, Y. Matias, and M. Szegedy. The Space Complexity of Approximating the Frequency Moments. Proc. 28th Annual ACM Symposium on Theory of Computing (STOC), 1996.
2. A. Bagchi, A. Chaudhary, D. Eppstein and M. T. Goodrich. Deterministic Sampling and Range Counting in Geometric Data Streams. Proc. 20th Annual Symposium on Computational Geometry, pp. 144-151, 2004.
3. Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, L. Trevisan. Counting Distinct Elements in a Data Stream. Proc. RANDOM, 2002.
4. T. M. Chan. Faster Core-Set Constructions and Data Stream Algorithms in Fixed Dimensions. Proc. 20th Annual Symposium on Computational Geometry, pp. 152-159, 2004.
5. T. M. Chan., B. S. Sadjad Geometric Optimization Problems over Sliding Windows Proc. 15th International Symposium on Algorithms and Computation, pp. 246-258, 2004.
6. B. Chazelle, R. Rubinfeld, and L. Trevisan. Approximating the minimum spanning tree weight in sublinear time. Proc. 28th Annual International Colloquium on Automata, Languages and Programming (ICALP), pages 190-200, 2001.
7. G. Cormode, M. Datar, P. Indyk. Comparing Data Streams using Hamming norms. Proc. International Conference on Very Large Databases (VLDB), 2002.
8. G. Cormode and S. Muthukrishnan. Radial Histograms for Spatial Streams. DIMACS Technical Report 2003-11, 2003.
9. G. Cormode, S. Muthukrishnan, and I. Rozenbaum. Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling. DIMACS Technical Report 2005-11 , 2005.
10. A. Czumaj, F. Ergün, L. Fortnow, A. Magen, I. Newman, R. Rubinfeld, and C. Sohler. Sublinear-time approximation of Euclidean minimum spanning tree. Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 813-822, 2003.
11. A. Czumaj and C. Sohler. Estimating the Weight of Metric Minimum Spanning Trees in Sublinear-Time. Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 175-183, 2004.
12. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing iceberg queries efficiently. Proc. 1998 Intl. Conf. on Very Large Data Bases, pp. 299-310, 1998.
13. J. Feigenbaum, S. Kannan, and J. Zhang. Computing Diameter in the Streaming and Sliding Window Models. Technical Report YALEU/DCS/TR-1245, Yale University, 2002.
14. G. Frahling, C. Sohler. Coresets in dynamic geometric data streams. Manuscript, 2004.
15. P. Flajolet and G. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31:182-209, 1985.
16. S. Ganguly,M. Garofalakis, R. Rastogi. Processing Set Expressions over Continuous Update Streams. Proc. SIGMOD Conference 2003, pp. 265-276, 2003.
17. T. Hagerub and C. Rüb. A Guided Tour of Chernoff Bounds. Information Processing Letters, 33:305-308, 1989/90.
18. S. Har-Peled, S. Mazumdar. On Coresets for k-Means and k-Median Clustering. Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 291-300, 2004.
19. J. Hershberger and S. Suri. Convex Hulls and Related Problems in Data Streams. Proceedings of the ACM/DIMACS Workshop on Management and Processing of Data Streams, 2003.
20. P. Indyk. Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. Proc. 41st IEEE Symposium on Foundations of Computer Science (FOCS), 2000.
21. P. Indyk. Algorithms for Dynamic Geometric Problems over Data Streams. Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 373-380, 2004.
22. P. Indyk. Better Algorithms for high-dimensional proximity problems via asymmetric embeddings. Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 539-545, 2003.
23. G. S. Manku, R. Motwani. Approximate Frequency Counts over Data Streams. Proc. 2002 Intl. Conf. on Very Large Data Bases, pp. 346-357, 2002.
24. S. Muthukrishnan. Data streams: Algorithms and applications (invited talk at SODA'03). Available at http://athos.rutgers.edu/~muthu/stream-1-1.ps, 2003.
25. N. Nisan. Pseudorandom generators for Space-Bounded Computation. Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC), 204-212, 1990.
26. S. Suri, C. D. Toth, and Y. Zhou. Range Counting over Multidimensional Data Streams. Proc. 20th Annual Symposium on Computational Geometry, pp. 160-169, 2004.