Deterministic sampling and range counting in geometric data streams

ACM Transactions on Algorithms

Volumn 3, Issue 2, 2007, Pages

  Bagchi, Amitabha ^a,d   Chaudhary, Amitabh ^b   Eppstein, David ^c   Goodrich, Michael T ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

^b UNIVERSITY OF NOTRE DAME   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Data streams; Epsilon nets; Geometric data; Iceberg queries; Range counting; Robust statistics; Sampling; Streaming algorithms

Indexed keywords

DETERMINISTIC SAMPLING; EPSILON NETS; ICEBERG QUERIES; RANGE COUNTING; STREAMING ALGORITHMS;

APPROXIMATION THEORY; DATA STRUCTURES; GEOMETRY; ONLINE SYSTEMS; QUERY PROCESSING; STATISTICS;

ALGORITHMS;

EID: 34250185027     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1240233.1240239     Document Type: Article

References (46)

1. AGARWAL, P. K., HAR-PELED, S., AND VARADARAJAN, K. R. 2005. Geometric approximation via core-sets. http://valis.cs.uiuc.edu/sariel/research/papers/.
2. AGARWAL, P. K., HAR-PELED, S., AND VARDARAJAN, K. R. 2004. Maintaining the extent of a moving point set. J. Assoc. Comput. Mach. 51, 4, 606-635.
3. AMENTA, N., BERN, M. W., EPPSTEIN, D., AND TENG, S.-H. 2000. Regression depth and center points. Discrete Comput. Geornet. 23, 3, 305-323. arxiv:cs.CG/9809037.
4. BABCOCK, B., BABU, S., DATAR, M., MOTWANI, R., AND WIDOM, J. 2002. Models and issues in data stream systems. In Proceedings of the 22nd Annual ACM Symposium on Principles of Databases Systems. dbpubs.stanford.edu:8090/pub/2002-19.
5. BAGCHI, A., CHAUDHARY, A., EPPSTEIN, D., AND GOODRICH, M. T. 2004. Deterministic sampling and range counting in geometric data streams. In Proceedings of the 20th ACM Symposium on Computational Geometry. (Brooklyn, NY). 144-151.
6. BENTLEY, J. L., AND SAXE, J. B. 1980. Decomposable searching problems I: Static-to-Dynamic transformation. J. Alg. 1, 4, 301-358.
7. BERN, M. W., AND EPPSTEIN, D. 2002. Multivariate regression depth. Discrete Comput. Geom. 28, 1 (Jul.), 1-17. arxiv:cs.CG/9912013.
8. BRÖNNIMANN, H., AND CHAZELLE, B. 1998. Optimal slope selection via cuttings. Comput. Geom.: Theory Appli. 10, 23-39.
9. BRÖNNIMANN, H., CHEN, B., DASH, M., HAAS, P., QIAO, Y., AND SCHEUERMAN, P. 2003a. Efficient data-reduction methods for on-line association rule discovery. In Data Mining: Next Generation Challenges and Future Directions, Selected papers from the NSF Workshop on Next-Generation Data Mining (NGDM '02). MT Press, Cambridges, MA. 190-208.
10. BRÖNNIMANN, H., CHEN, B., DASH, M., HAAS, P., AND SCHEUERMANN, P. 2003b. Efficient data reduction with ease. In Proceedings of the 9th Annual ACM-SIGKDD International Conference on Knowledge Discovery and Data mining (KDD). 59-68.
11. CHAZELLE, B., LIU, D., AND MAGEN, A. 2003. Sublinear geometric algorithms. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. 531-540.
12. CHAZELLE, B., AND WELZL, E. 1989. Quasi-Optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4, 467-489.
13. CLARKSON, K., EPPSTEIN, D., MILLER, G. L., STURTIVANT, C., AND TENG, S.-H. 1996. Approximating center points with iterated Radon points. Int. J. Comput. Geom. Appl. 6, 3, 357-377.
14. CORMODE, G., AND MUTHUKRISHNAN, S. 2003. Radial histograms for spatial streams. Tech. Rep. 2003-11, DIMACS.
15. DATAR, M., GIONIS, A., INDYK, P., AND MOTWANI, R. 2002. Maintaining stream statistics over sliding windows. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 635-644.
16. DEMAINE, E. D., LÓPEZ-ORTIZ, A., AND MUNRO, J. I. 2002. Frequency estimation of Internet packet streams with limited space. In Proceedings of the 10th Annual European Symposium on Algorithms (ESA). 348-360.
17. DONOHO, D. L. 1982. Breakdown properties of multivariate location estimators. Ph.D. thesis, Harvard University.
18. FANG, M., SHIVAKUMAR, N., GARCIA-M OLINA, H., MOTWANI, R., AND ULLMAN, J. D. 1998. Computing iceberg queries efficiently. In Proceedings of the International Conference on Very Large Data Bases. 299-310.
19. FEIGENBAUM, J., KANNAN, S., AND ZHANG, J. 2002. Computing diameter in the streaming and sliding-window models. Tech. Rep. YALEU/DCS/TR-1245, Yale University.
20. GOODRICH, M. T., AND RAMOS, E. A. 1997. Bounded-Independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming. Discrete Comput. Geom. 18, 397-420.
21. GREENWALD, M., AND KHANNA, S. 2001. Space-Efficient online computation of quantile summaries. In Proceedings of the ACM-SIGMOD International Conference on Management of Data. 58-66.
22. GUHA, S., MISHRA, N., MOTWANI, R., AND O'CALLAGHAN, L. 2000. Clustering data streams. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science. 359-366.
23. GUPTA, A., AND ZANE, F. X. 2003. Counting inversions in lists. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. 253-254.
24. HAR-PELED, S., AND MAZUMDAR, S. 2003. Fast algorithms for computing the smallest k-enclosing disc. In Proceedings of the 11th Annual European Symposium on Algorithms. Lecture Notes in Computer Science. Springer Verlag, Berlin.
25. HERSHBERGER, J., AND SURI, S. 2003. Convex hulls and related problems in data streams. In Proceedings of the ACMIDIMACS Workshop on Management and Processing of Data Streams. http://www.research. att.com/conf/mpds2003/.
26. INDYK, P. 2003a. Better algorithms for high-dimensional proximity problems via asymmetric embeddings. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. 539-545.
27. INDYK, P. 2003b. Stream-Based geometric algorithms. In Proceedings of the ACM/DIMACS Workshop on Management and Processing of Data Streams, http://www.research.att.com/conf/mpds2003/.
28. JADHAV, S., AND MUKHOPADHYAY, A. 1993. Computing a centerpoint of a finite planar set of points in linear time. In Proceedings of the 9th Annual ACM Symposium on Computational Geometry. 83-90.
29. KARP, R. M., SHENKER, S., AND PAPADIMITRIOU, C. H. 2003. A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28, 1 (Mar.), 51-55.
30. KORN, F., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. 2002. Reverse nearest neighbour aggregates over data streams. In Proceedings of the International Conference on Very Large Data Bases. 814-825.
31. LANGERMAN, S., AND STEIGER, W. 2003. Optimization in arrangements. In Proceedings of the 20th International Symposium Theoretical Aspects of Computer Science, H. Alt and M. Habib, Eds. Lecture Notes in Computer Science, vol. 2607. Springer Verlag, Berlin. 50-61.
32. LIU, R. Y. 1990. On a notion of data depth based on random simplices. Ann. Statist. 18, 405-414.
33. MANKU, O. S., AND MOTWANI, R. 2002. Approximate frequency counts over data streams. In Proceedings of the International Conference on Very Large Data Bases. 346-357.
34. MATOUŠEK, J. 1991. Computing the center of planar point sets. In Discrete and Computational Geometry: Papers from the DIMACS Special Year, J. E. Goodman et al., eds. Number 6 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Boston, MA. 221-230.
35. MATOUŠEK, J. 1993. Epsilon-Nets and computational geometry. In New Trends in Discrete and Computational Geometry, J. Pach, ed. Algorithms and Combinatorics, vol. 10. Springer Verlag, Heidelberg. 69-89.
36. MATOUŠEK, J. 1995. Approximations and optimal geometric divide-and-conquer. J. Comput. Syst. Sci. 50, 203-208.
37. MATOUŠEK, J. 2000. Derandomization in computational geometry. In Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds. Elsevier Science, North Holland, Amsterdam. 559-595.
38. MUTHUKRISHNAN, S. 2003. Data streams: Algorithms and applications. Invited talk at (Symposium on Discrete Algorithms) (SODA) 2003. Available on request by email to muthu@research.att.com.
39. ROUSSEEUW, P. J., AND HUBERT, M. 1999. Regression depth. J. Amer. Statis. Assoc. 94, 446, 388-402.
40. ROUSSEEUW, P. J., AND LEROY, A. M. 1987. Robust Regression and Outlier Detection. John Wiley, New York.
41. ROUSSEEUW, P. J., AND STRUYF, A. 1998. Computing location depth and regression depth in higher dimensions. Statist. Comput. 8, 193-203.
42. SAUER, N. 1972. On the density of families of sets. J. Combin. Theory Ser. A13, 145-147.
43. SEN, P. K. 1968. Estimates of the regression coefficient based on Kendall's tau. J. Amer. Statist. Assoc. 63, 1379-1389.
44. SURI, S., TÓTH, C. D., AND ZHOU, Y. 2004. Range counting over multidimensional data streams. In Proceedings of the 20th ACM Symposium on Computational Geometry (Brooklyn, NY) 160-169.
45. THIEL, H. 1950. A rank-invariant method of linear and polynomial regression analysis, Part 3. Proceedings of the Koninalijke Nederlandse Akademie van Weinenschatpen A53, 1397-1412.
46. VAPNIK, V. N., AND CHERVONENKIS, A. Y. 1971. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16, 264-280.