Skip to main content

One-Pass Algorithm

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

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Alon N, Matias Y, Szegedy M. The space complexity of approximating the frequency moments. J Comput Syst Sci. 1999;58(1):137–47.

    Article  MathSciNet  MATH  Google Scholar 

  2. Henzinger M, Raghavan P, Rajagopalan S. Computing on data streams. In: External memory algorithms. DIMACS series in discrete mathematics and theoretical computer science 50. Boston: American Mathematical Society; 1999. p. 107–18.

    Google Scholar 

  3. Muthukrishnan S. Data streams: algorithms and applications. Found Trends Theor Comput Sci. 2005;1(2):117–236.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicole Schweikardt .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Schweikardt, N. (2018). One-Pass Algorithm. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_253

Download citation

Publish with us

Policies and ethics