Estimating rarity and similarity over data stream windows

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

Volumn 2461, Issue , 2002, Pages 323-335

  Datar, Mayur ^a   Muthukrishnan, S ^b  

^a Stanford University   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DATA STREAM; DATA STREAM MODEL; MASSIVE DATA SETS; POLYLOGARITHMIC; SIMPLE ALGORITHM; STORAGE SPACES; WINDOW SIZE;

DIGITAL STORAGE;

EID: 84938057127     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_31     Document Type: Conference Paper

References (24)

1. N. Alon, Y. Matias, M. Szegedy. The space complexity of approximating the frequency moments. In Proc. Twenty-Eighth Annual ACM Symp. on Theory of Computing, 1996. 326
2. A. Broder. Filtering Near-Duplicate Documents. In Proc. of FUN, 1998. 325, 327
3. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and Issues in Data Stream Systems. In Proc. of Principles of Database Systems, Madison, Wisconsin, June 3 - 5, 2002. 324, 326
4. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise Independent Permutations. In Proc. of STOC, 1998.
5. B. Babcock, M. Datar, and R. Motwani. Sampling from a Moving Window over Streaming Data. In Proc. of Thirteenth Annual ACM-SIAM Symp. on Discrete Algorithms, 2002. 326
6. E. Cohen. Size-Estimation Framework with Applications to Transitive Closure and Reachability. Journal of Computer and System Sciences 55 (1997): 441-453. 325, 327
7. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang. Finding Interesting Associations without Support Pruning. In Proc. of the 16th International Conference on Data Engineering, San Diego, USA, 2000. 325, 326, 328
8. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining Stream Statistics over Sliding Windows. In Proc. of Thirteenth Annual ACM-SIAM Symp. on Discrete Algorithms. 324, 326, 333
9. P. Domingos, G. Hulten, and L. Spencer. Mining time-changing data streams. In Proc. of the 7th International Conference on Knowledge Discovery and Data Mining, 2001. 326
10. T. Dasu, T. Johnson, S. Muthukrishnan and V. Shkapenyuk Mining database structure, or to How to build a data quality browser. In Proc. of the SIGMOD, 2002. 333
11. J. Feigenbaum, S. Kannan, M. Strauss, M. Viswanathan. An Approximate L1- Difference Algorithm for Massive Data Streams. In Proc. 40th IEEE Symp. on Foundations of Computer Science, 1999. 326
12. P. Flajolet, G. Martin. Probabilistic Counting. In Proc. 24th IEEE Symp. on Foundations of Computer Science, 1983. 326
13. P. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In Symp. on Parallel Algorithms and Architectures, 2001. 326
14. A. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Fast, Small-Space Algorithms for Approximate Histogram Maintenance. In ACM Symp on Theory of Computing (STOC), 2002. 326
15. A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. In Proc. of VLDB, 2001. 324, 326, 327
16. S. Guha, N. Mishra, R. Motwani, L. O'Callaghan. Clustering data streams. In Proc. 2000 Annual IEEE Symp. on Foundations ofComputer Science, pages 359-366, 2000. 326
17. M. R. Henzinger, P. Raghavan, S. Rajagopalan. Computing on data streams. Technical Report TR 1998-011, Compaq Systems Research Center, Palo Alto, California, May 1998.
18. P. Indyk. Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. In Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000. 326
19. P. Indyk A Small Approximately Min-Wise Independent Family of Hash Functions. In Journal of Algorithms 38(1): 84-90 (2001). 327, 328, 330, 332
20. S. Madden and M. J. Franklin. Fjording the stream: An architecture for queries over streaming sensor data. In Proceedings ofICDE, 2002. 324
21. K. Mulmuley An Introduction through Randomized Algorithms. Prentice Hall, 1993. 327, 328
22. R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995. 327, 331
23. NOAA. U. S. national weather service. http://www.nws.noaa.gov/. 324
24. R. Seidel, and C. Aragon. Randomized Search Trees. In Algorithmica (1996) 16. pp 464-497. 331,332