Skip to main content

FM Synopsis

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

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. Bunge J, Fitzpatrick M. Estimating the number of species: a review. J Am Stat Assoc. 1993;88(421):364–73.

    Google Scholar 

  3. Charikar M, Chaudhuri S, Motwani R, Narasayya V. Towards estimation error guarantees for distinct values. In: Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2000. p. 268–79.

    Google Scholar 

  4. Considine J, Li F, Kollios G, Byers J. Approximate aggregation techniques for sensor databases. In: Proceedings of the 20th International Conference on Data Engineering; 2004. p. 449–60.

    Google Scholar 

  5. Durand M, Flajolet P. Loglog counting of large cardinalities. In: Proceedings of the 11th European Symposium on Algorithms; 2003. p. 604–17.

    Chapter  Google Scholar 

  6. Estan C., Varghes G., Fisk M. Bitmap algorithms for counting active flows on high speed links. In: Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement; 2003. p. 153–66.

    Google Scholar 

  7. Flajolet P, Martin GN. Probabilistic counting algorithms for data base applications. J Comput Syst Sci. 1985;31(2):182–209.

    Article  MathSciNet  MATH  Google Scholar 

  8. Gibbons PB. Distinct-values estimation over data streams. In: Garofalakis M, Gehrke J, Rastogi R, editors. Data stream management: processing high-speed data streams. Secaucus: Springer; 2009.

    Google Scholar 

  9. Nath S, Gibbons PB, Seshan S, Anderson Z. Synopsis diffusion for robust aggregation in sensor networks. ACM Trans Sensor Networks. 2008;4(2):1–40.

    Article  Google Scholar 

  10. Palmer CR, Gibbons PB, Faloutsos C. ANF: a fast and scalable tool for data mining in massive graphs. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2002. p. 81–90.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Phillip B. Gibbons .

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

Gibbons, P.B. (2018). FM Synopsis. 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_164

Download citation

Publish with us

Policies and ethics