Adaptive spatial partitioning for multidimensional data streams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 522-533

  Hershberger, John ^a,b   Shrivastava, Nisheeth ^b   Suri, Subhash ^b   Tóth, Csaba D ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SEA ICE;

DATA STREAM; EFFICIENT SCHEMES; GENERALISATION; GEOMETRIC QUERIES; MULTIDIMENSIONAL DATA; SPACE EFFICIENT; SPATIAL PARTITIONING;

SEA ICE; DATA COMMUNICATION SYSTEMS;

EID: 35048886558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_46     Document Type: Article

References (27)

1. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. J. ACM 51 (2004), pp. 606-635.
2. N. Alon, Y. Matias, M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58 (1999), 137-147.
3. A. Arasu and G. Manku. Approximate counts and quantiles over sliding windows. In Proc. 23rd PODS, 2004, ACM Press, pp. 286-296.
4. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In 21st PODS, 2002, ACM Press, pp. 1-16.
5. J.L. Bentley. Multidimensional divide-and-conquer. Communications of the ACM 23 (4) (1980) 214-229.
6. M. Charikar, L. O'Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. In Proc. 35th STOC, 2003, pp. 30-39.
7. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Finding hierarchical heavy hitters in data streams. In Proc. 29th Conf. VLDB, 2003.
8. G. Cormode and S. Muthukrishnan. Radial histograms for spatial streams. Technical report DIMACS TR 2003-11, 2003.
9. G. Cormode and S. Muthukrishnan. What is hot and what is not: Tracking most frequent items dynamically. Proc. 22nd PODS, 2003, 296-306.
10. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM Journal of Computing 31 (6) (2002), 1794-1813.
11. E. D. Demaine, A. López-Ortiz, and J.I. Munro. Frequency estimation of internet packet streams with limited space. Proc. 10th ESA, LNCS 2461, 2002, pp. 348-360.
12. C. Estan, S. Savage and G. Varghese. Automatically inferring patterns of resource consumption in network traffic. In Proc. SIGCOMM, ACM Press, 2003, pp. 137-48.
13. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J.D. Ullman. Computing iceberg queries efficiently. In Proc. 24rd Conf. VLDB, 1998, pp. 299-310.
14. A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. How to summarize the Universe: Dynamic maintenance of quantiles. In Proc. 28th Conf. on VLDB, 2002.
15. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In Proc. 20th SIGMOD, 2001, pp. 58-66.
16. J. Hershberger and S. Suri. Adaptive sampling for geometric problems over data streams. In Proc. 23rd PODS, 2004, ACM Press, pp. 252-262.
17. R.M. Karp, S. Shenker, and C.H. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems 28 (1) (2003), 51-55.
18. G. Manku and R. Motwani. Approximate frequency counts over data streams. In Proc. 28th Conf. VLDB, 2002, pp. 346-357.
19. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. In Proc. 17th SIGMOD, 1998, pp. 426-435.
20. G. Manku, S. Rajagopalan, and B. G. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. Proc. 18th SIGMOD, 1999, pp. 251-262.
21. J. Misra and D. Gries. Finding repeated elements. Sci. Comput. Programming 2 (1982), 143-152.
22. J.I. Munro and M.S. Paterson. Selection and sorting with limited storage. Theoretical Computer Science 12 (1980), 315-323.
23. S. Muthukrishnan. Data streams: Algorithms and applications. Preprint, 2003.
24. S. Suri, Cs.D. Tóth, and Y. Zhou, Range counting over multi-dimensional data streams. Proc. 20th ACM Symp. Comput. Geom., ACM Press, 2004, pp. 160-169.
25. N. Thaper, S. Guha, P. Indyk, and N. Koudas. Dynamic multidimensional histograms. In Proc. SIGMOD Conf. on Management of Data, ACM Press, 2002, 428-439.
26. V.N. Vapnik and A.Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16 (1971), 264-280.
27. J.S. Vitter. Random sampling with a reservoir. ACM Trans. Math. Software 11 (1985), 37-57.