Adaptive sampling for geometric problems over data streams

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

Volumn 23, Issue , 2004, Pages 252-262

  Hershberger, John ^a   Suri, Subhash ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE CONTROL SYSTEMS; APPROXIMATION THEORY; DATABASE SYSTEMS; INTEGER PROGRAMMING; OPTIMIZATION; QUERY LANGUAGES;

ADAPTIVE SAMPLING; DATA STREAMS; GEOMETRIC PROBLEMS;

DATA PROCESSING;

EID: 3142712948     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1055558.1055595     Document Type: Conference Paper

References (22)

1. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. J. ACM. To appear.
2. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci., 58(1):137-147, 1999.
3. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proc. ACM PODS, 2002.
4. M. d. Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
6. G. Cormode and S. Muthukrishnan. Radial histogram for spatial streams. Technical Report 2003-11, DIMACS, 2003.
7. R. M. Dudley. Metric entropy of some classes of sets with differentiable boundaries. J. Approx. Theory, 10:227-236, 1974.
8. http://www.earthscope.org.
9. 1-difference algorithm for massive data streams. In IEEE Symp. Found. Comput. Sci., pages 501-511, 1999.
10. J. Feigenbaum, S. Kannan, and J. Zhang. Computing diameter in the streaming and sliding-window models, 2002. Manuscript.
11. J. Gray, A. Szalay, A. Thakar, P. Z. Zunszt, T. Malik, J. Raddick, C. Stoughton, and J. vandenBerg. The SDSS SkyServer: Public access to the Sloan digital sky server data. Technical Report MSR-TR-2001-104, Microsoft Research, 2001.
12. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In Proc. ACM SIGMOD, 2001.
13. P. M. Gruber. Approximation of convex bodies. In P. M. Gruber and J. M. Wills, editors, Convexity and its Applications, pages 131-162. Birkhäuser, Basel, Switzerland, 1983.
14. P. Indyk. Stream-based geometric algorithms. In Proc. ACM/DIMACS Workshop on Management and Processing of Data Streams, 2003.
15. N. M. Josuttis. The C++ Standard Library: A Tutorial and Reference. Addison-Wesley, Reading, MA, 1999.
16. P. S. Kenderov. Polygonal approximation of plane convex compacts. J. Approx. Theory, 38:221-239, 1983.
17. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. In Proc. ACM SIGMOD, 1999.
18. D. E. McClure and R. A. Vitale. Polygonal approximation of plane convex bodies. J. Math. Anal. Appl., 51:326-358, 1975.
19. S. Muthukrishnan. Data streams: Algorithms and applications. Technical report, Computer Science Department, Rutgers University, 2003.
20. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
21. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-676, 1990.
22. T. J. Richardson. Approximation of planar convex sets from hyperplane probes. Discrete Comput. Geom., 18(2):151-177, 1997.