Range counting over multidimensional data streams

Discrete and Computational Geometry

Volumn 36, Issue 4, 2006, Pages 633-655

  Suri, Subhash ^a   Toth, Csaba D ^b   Zhou, Yunhong ^c  

^a University of California   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750347768     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1269-4     Document Type: Conference Paper

References (30)

1. P.K. Agarwal. Range searching. In Handbook of Discrete and Computational Geometry (J. E. Goodman and J. O'Rourke, eds.), pp. 575-598. CRC Press, Boca Raton, FL, 1997.
2. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In Proc. Conf. on Principles of Database Systems, pp. 1-16. ACM Press, New York, 2002.
3. A. Bagchi, A. Chaudhary, D. Eppstein, and M.T. Goodrich. Deterministic sampling and range counting in geometric data streams. In Proc. 20th ACM Sympos. on Computational Geometry, 2004, pp. 144-151.
4. R. C. Baker. On irregularities of distribution, II. J. London Math. Soc. (2) 59 (1999), 50-64.
5. J. Beck. Irregularities of distribution, I. Acta Math. 159(1-2) (1987), 1-49.
6. J. Beck. Irregularities of distribution, II. Proc. London Math. Soc. (3) 56 (1988), 1-50.
7. J. Beck and W. Chen. Irregularities of Distributions. Cambridge University Press, Cambridge, 1987.
8. J. Beck and T. Fiala. Integer-making theorems. Discrete Appl. Math. 3 (1981), 1-8.
9. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17(3) (1988), 427-462.
10. B. Chazelle. The Discrepancy Method. Cambridge University Press, Cambridge, 2000.
11. B. Chazelle and J. Matoušek. On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21 (1996), 579-597.
12. B. Chazelle and E. Welzl. Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4(5) (1989), 467-189.
13. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. ACM SIGMOD Record 30(2) (2001), 58-66.
14. T. Hagerup and C. Rub. A guided tour of Chernoff bounds. Inform. Process. Lett. 33 (1990), 305-308.
15. M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. Technical Note 1998-011, Digital Systems Research Center, Palo Alto, CA, May 1998.
16. J. Hershberger, N. Shrivastava, S. Suri, and Cs. D. Toth. Adaptive spatial partitioning for multidimensional data streams. Algorithmica 46(1) (2006), 97-117.
17. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984), 373-395.
18. G.S. Manku, S. Rajagopalan, and B.G. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. ACM SIGMOD Record 28(2) (1999), 251-262.
19. J. Matoušek. Efficient partition trees. Discrete Comput. Geom. 8 (1992), 315-334.
20. J. Matoušek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom. 10 (1993), 157-182.
21. J. Matoušek. Geometric range searching. ACM Comput. Surveys 26(4) (1994), 422-461.
22. J. Matoušek. Tight upper bounds for the discrepancy of half-spaces. Discrete Comput. Geom. 13 (1995), 593-601.
23. J. Matoušek. Geometric Discrepancy: An Illustrated Guide. Springer-Verlag, Berlin, 1999.
24. J. Matoušek. Lectures on Discrete Geometry. Springer-Verlag, Berlin, 2002.
25. J. Matoušek, E. Welzl, and L. Wernisch. Discrepancy and approximations for bounded VC-dimension. Combinatorica 13 (1993), 455-466.
26. J.I. Munro and M.S. Paterson. Selection and sorting with limited storage. Theoret. Comput. Sci. 12 (1980), 315-323.
27. S. Muthukrishnan. Data streams: algorithms and applications. Preprint, 2003.
28. V.N. Vapnik and A.Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16 (1971), 264-280.
29. J.S. Vitter. Faster methods for random sampling. Comm. ACM 27 (1984), 703-718.
30. J.S. Vitter. Random sampling with a reservoir. ACM Trans. Math. Software 11 (1985), 37-57.