Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 848–849Cite as

Data Sketch/Synopsis

  • Reference work entry
  • First Online:

  • 18 Accesses

Synonyms

Summary

Definition

A synopsis of dataset D is an abstract of D. A sketch is also referred to an abstract of dataset D but is usually referred to an abstract in a sampling method.

Key Points

Sketch/synopsis techniques have many applications. They are mainly used for statistics estimation in query processing optimization and for supporting on-line data analysis via approximate query processing. The goal is to develop effective and efficient techniques to build a small space synopsis while achieving high precision. For instance, a key component in query processing optimization is to estimate the result sizes of queries. Many techniques [1, 2] have been developed for this purpose, including histograms, wavelets, and join synopses.

In data stream applications, the space requirements of synopses/sketches are critical to keep them in memory for on-line query processing. Streams are usually massive in size and fast at arrival rates; consequently it may be infeasible to keep a whole...

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   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

Learn about institutional subscriptions

Recommended Reading

  1. Alon N, Gibbons PB, Matias Y, Szegedy M. Tracking join and self-join sizes in limited storage. In: Proceedings of the 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems; 1999.

    Google Scholar 

  2. Gibbons PB, Matias Y. Synopsis data structures for massive data sets. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms; 1999.

    Google Scholar 

  3. Zhang Y, Lin X, Xu J, Korn F, Wang W. Space-efficient relative error order sketch over data streams. In: Proceedings of the 22nd International Conference on Data Engineering; 2006.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of New South Wales, Sydney, NSW, Australia

    Xuemin Lin

Authors
  1. Xuemin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xuemin Lin .

Editor information

Editors and Affiliations

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

    Ling Liu

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

    M. Tamer Özsu

Section Editor information

  1. School of Inf. Tech. & Elec. Eng., Univ. of Queensland, Brisbane, QLD, Australia

    Xiaofang Zhou

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

Lin, X. (2018). Data Sketch/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_549

Download citation

Publish with us

Policies and ethics

Search

Navigation