Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 1948–1949Cite as

One-Pass Algorithm

  • Reference work entry

Synonyms

One-pass algorithm; Streaming algorithm; Data stream algorithm

Definition

A one-pass algorithm receives as input a list of data items x 1, x 2, x 3,.... It can read these data items only once, from left to right, i.e., in increasing order of the indices i = 1, 2, 3,.... Critical parameters of a one-pass algorithm are (1) the size of the memory used by the algorithm, and (2) the processing time per data item x i . Typically, a one-pass algorithm is designed for answering one particular query against the input data. To this end, the algorithm stores and maintains a suitable data structure which, for each i, is updated when reading data item x i .

The two parameters processing time per data item and memory size are usually measured as functions depending on the size N of the input (different measures of the input sizeare considered in the literature, among them, e.g., the number of data items occurring in the input, as well as the total number of bits needed for storing the...

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Henzinger M., Raghavan P., and Rajagopalan S. Computing on data streams. In External Memory Algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 50. American Mathematical Society, Boston, MA, USA, 1999, pp. 107–118.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Johann Wolfgang Goethe-University, Frankfurt am Main, Frankfurt, Germany

    Nicole Schweikardt

Authors
  1. Nicole Schweikardt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computing, Georgia Institute of Technology, 266 Ferst Drive, 30332-0765, Atlanta, GA, USA

    LING LIU (Professor) (Professor)

  2. Database Research Group David R. Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, N2L 3G1, Waterloo, ON, Canada

    M. TAMER ÖZSU (Professor and Director, University Research Chair) (Professor and Director, University Research Chair)

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this entry

Cite this entry

Schweikardt, N. (2009). One-Pass Algorithm. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_253

Download citation

Publish with us

Policies and ethics

Search

Navigation