Skip to main content
SpringerLink
Log in

Stream Similarity Mining

  • Living reference work entry
  • First Online:
Book cover Encyclopedia of Database Systems

  • 44 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Alon N, Gibbons P, Matias Y, Szegedy M. Tracking join and self-join sizes in limited storage. In: Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems. 1999. p. 10–20.

    Google Scholar 

  2. Alon N, Matias Y, Szegedy M. The space complexity of approximating the frequency moments. In: Proceedings of the 28th ACM symposium on theory of computing. 1996. p. 20–9.

    Google Scholar 

  3. Broder A, Charikar M, Frieze A, Mitzenmacher M. Min-wise independent permutations. In: Proceedings of the 30th ACM symposium on theory of computing. 1998. p. 327–36.

    Google Scholar 

  4. Chambers JM, Mallows CL, Stuck BW. A method for simulating stable random variables. J Am Stat Assoc. 1976;71:340–4.

    Article  MATH  MathSciNet  Google Scholar 

  5. Cohen E. Size-estimation framework with applications to transitive closure and reachability. J Comput Syst Sci. 1997;55:441–53.

    Article  MATH  MathSciNet  Google Scholar 

  6. Cohen E, Datar M, Fujiwara S, Gionis A, Indyk P, Motwani R, Ullman J. Finding interesting associations without support pruning. In: Proceedings of the 16th international conference on data engineering. 2000.

    Google Scholar 

  7. Cormode G, Datar M, Indyk P, Muthukrishnan S. Comparing data streams using hamming norms. In: Proceedings of the 28th international conference on very large data bases. 2002. p. 335–45.

    Google Scholar 

  8. Datar M, Gionis A, Indyk P, Motwani R. Maintaining stream statistics over sliding windows. In: Proceedings of the 13th annual ACM-SIAM symposium on discrete algorithms. 2002. p. 635–44.

    Google Scholar 

  9. Datar M, Muthukrishnan S. Estimating rarity and similarity on data stream windows. In: Proceedings of the 10th European symposium on algorithms. 2002.

    Google Scholar 

  10. Feigenbaum J, Kannan S, Strauss M, Viswanathan M. An approximate l 1-difference algorithm for massive data streams. In: Proceedings of the 40th annual symposium on foundations of computer science. 1999.

    Google Scholar 

  11. Flajolet P, Martin G. Probabilistic counting. In: Proceedings of the 24th annual symposium on foundations of computer science. 1983. p. 76–82.

    Google Scholar 

  12. Indyk P. Stable distributions, pseudorandom generators, embeddings and data stream computation. In: Proceedings of the 41st annual symposium on foundations of computer science. 2000. p. 189–97.

    Google Scholar 

  13. Indyk P. A small approximately min-wise independent family of hash functions. J Algorithm. 2001;38:84–90.

    Article  MATH  MathSciNet  Google Scholar 

  14. On the distributional complexity of disjointness. J Comput Sci Syst. 1984;2.

    Google Scholar 

  15. Saks M, Sun X. The space complexity of approximating the frequency moments. In: Proceedings of the 34th ACM symposium on theory of computing. 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Yahoo! Research, Silicon Valley, CA, USA

    Erik Vee

Authors
  1. Erik Vee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Erik Vee .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, Georgia, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, Ontario, Canada

    M. Tamer Özsu

Section Editor information

  1. AT&T Labs - Research, AT&T, 1 AT&T Way, 07921, Bedminster, NJ, USA

    Divesh Srivastava

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media LLC

About this entry

Cite this entry

Vee, E. (2016). Stream Similarity Mining. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_373-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_373-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation