Computing diameter in the streaming and sliding-window models

Algorithmica (New York)

Volumn 41, Issue 1, 2004, Pages 25-41

  Feigenbaum, Joan ^a   Kannan, Sampath ^b   Zhang, Jian ^a  

^a Yale University   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Diameter; Massive data streams; Sliding window

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; DATA ACQUISITION; MATHEMATICAL MODELS; PROBLEM SOLVING;

DATA ELEMENTS; DIAMETER; MASSIVE DATA STREAMS; SLIDING WINDOW;

ALGORITHMS;

EID: 10844296640     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1105-2     Document Type: Article

References (26)

1. P. K. Agarwal and S. Har-Peled. Maintaining the approximate extent measures of moving points. In Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, pages 148-157, 2001.
2. P. K. Agarwal, J. Matoušek, and S. Suri. Farthest neighbors, maximum spanning trees and related problems in higher dimensions. Computational Geometry: Theory and Applications, 1(4): 189-201, 1992.
3. 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.
4. G. Barequet and S. Har-Peled. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, pages 82-91, 1999.
5. T. Chan. Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus. In Proc. 16th ACM Symposium on Computational Geometry, pages 300-309, 2000.
6. K. Clarkson and P. Shor. Applications of random sampling in computational geometry, II. Discrete & Computational Geometry, 4:387-421, 1989.
7. G. Cormode and S. Muthukrishnan. Radial histograms for spatial streams. DIMACS Technical Report 2003-11, 2003.
8. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM Journal on Computing, 31(6):1794-1813, 2002.
9. 1 difference algorithm for massive data streams. SIAM Journal on Computing, 32(1):131-151, 2002.
10. J. Feigenbaum, S. Kannan, and J. Zhang. Computing diameter in the streaming and sliding-window models. Yale University Technical Report, YALEU/DCS/TR-1245, Dec. 2002. Also partially presented at the November 6-9, 2001 and March 24-26, 2003 meetings of the DIMACS working group on streaming data analysis.
11. P. Flajolet and G. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31:182-209, 1985.
12. p-difference algorithm for massive data streams. Discrete Mathematics and Theoretical Computer Science, 4(2):301-322, 2001.
13. P. B. Gibbons and S. Tirthapura. Distributed streams algorithms for sliding windows. In Proc. 14th ACM Symposium on Parallel Algorithms and Architectures, pages 63-72, 2002.
14. A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Fast, small-space algorithms for approximate histogram maintenance. In Proc. 34th ACM Symposium on Theory of Computing, pages 389-398, 2002.
15. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Surfing wavelets on streams: one-pass summaries for approximate aggregate queries. In Proc. 27th International Conference on Very Large Data Bases, pages 79-88, 2001.
16. A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. How to summarize the universe: dynamic maintenance of quantiles. In Proc. 28th International Conference on Very Large Data Bases, pages 454-465, 2002.
17. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. In Proc. 33th ACM Symposium on Theory of Computing, pages 471-475, 2001.
18. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In Proc. 41st IEEE Symposium on Foundations of Computer Science, pages 359-366, 2000.
19. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Technical Report 1998-001, DEC Systems Research Center, 1998.
20. J. Hershberger and S. Suri. Convex hulls and related problems in data streams. In Proc. Workshop on Management and Processing of Data Streams, 2003. Available online at http://www.research.att.com/conf/mpds2003.
21. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In Proc. 41st IEEE Symposium on Foundations of Computer Science, pages 189-197, 2000.
22. P. Indyk. Better algorithms for high-dimensional proximity problems via asymetric embeddings. In Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, pages 539-545, 2003.
23. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics, 5:545-557, 1990.
24. F. Korn, S. Muthukrishnan, and D. Srivastava. Reverse nearest neighbor aggregates over data streams. In Proc. 28th International Conference on Very Large Data Bases, pages 814-825, 2002.
25. E. Ramos. Deterministic algorithms for 3-d diameter and some 2-d lower envelopes. In Proc. 16th ACM Symposium on Computational Geometry, pages 290-299, 2000.
26. Y. Zhu and D. Shasha. Efficient elastic burst detection in data streams. In Proc. 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 336-345, 2003.