research-article

Open access

Data sketching

Author:

Graham CormodeAuthors Info & Claims

Communications of the ACM, Volume 60, Issue 9

Pages 48 - 55

https://doi.org/10.1145/3080008

Published: 23 August 2017 Publication History

All formats PDF

Abstract

The approximate approach is often faster and more efficient.

References

[1]

Ahn, K.J., Guha, S., McGregor, A. Analyzing graph structure via linear measurements. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, (2012).

Digital Library

Google Scholar

[2]

Bhagat, S., Burke, M., Diuk, C., Filiz, I.O., Edunov, S. Three-and-a-half degrees of separation. Facebook Research, 2016; https://research.fb.com/three-and-a-half-degrees-of-separation/.

Google Scholar

[3]

Bloom, B. Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 7 (July 1970), 422--426.

Digital Library

Google Scholar

[4]

Broder, M., Mitzenmacher, A. Network applications of Bloom filters: a survey. Internet Mathematics 1, 4 (2005), 485--509.

Google Scholar

[5]

Clarkson, K.L., Woodruff, D.P. Low rank approximation and regression in input sparsity time. In Proceedings of the ACM Symposium on Theory of Computing, (2013), 81--90.

Digital Library

Google Scholar

[6]

Cormode, G., Korn, F., Muthukrishnan, S., Johnson, T., Spatscheck, O., Srivastava, D. 2004. Holistic UDAFs at streaming speeds. In Proceedings of the ACM SIGMOD International Conference on Management of Data, (2004), 35--46.

Digital Library

Google Scholar

[7]

Cormode, G., Muthukrishnan, S. An improved data stream summary: the Count-Min sketch and its applications. J. Algorithms 55, 1 (2005), 58--75.

Digital Library

Google Scholar

[8]

Flajolet, P., Martin, G.N. 1985. Probabilistic counting. In Proceedings of the IEEE Conference on Foundations of Computer Science, 1985, 76--82. Also in J. Computer and System Sciences 31, 182--209.

Digital Library

Google Scholar

[9]

Guha, S., Mishra, N., Motwani, R., O'Callaghan, L. Clustering data streams. In Proceedings of the IEEE Conference on Foundations of Computer Science, 2000.

Digital Library

Google Scholar

[10]

Heule, S., Nunkesser, M., Hall, A. HyperLogLog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm. In Proceedings of the International Conference on Extending Database Technology, 2013.

Digital Library

Google Scholar

[11]

Jermaine, C. Sampling techniques for massive data. Synopses for massive data: samples, histograms, wavelets and sketches. Foundations and Trends in Databases 4, 1--3 (2012). G. Cormode, M. Garofalakis, P. Haas, and C. Jermaine, Eds. NOW Publishers.

Digital Library

Google Scholar

[12]

Morris, R. Counting large numbers of events in small registers. Commun. ACM 21, 10 (Oct. 1977), 840--842.

Digital Library

Google Scholar

[13]

Pike, R., Dorward, S., Griesemer, R., Quinlan, S. Interpreting the data: Parallel analysis with Sawzall. Dynamic Grids and Worldwide Computing 13, 4 (2005), 277--298.

Digital Library

Google Scholar

[14]

Weinberger, K.Q., Dasgupta, A., Langford, J., Smola, A.J., Attenberg, J. Feature hashing for large-scale multitask learning. In Proceedings of the International Conference on Machine Learning, 2009.

Digital Library

Google Scholar

[15]

Whang, K.Y., Vander-Zanden, B.T., Taylor, H.M. A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Systems 15, 2 (1990, 208.

Digital Library

Google Scholar

[16]

Woodruff, D. Sketching as a tool for numerical linear algebra. Foundations and Trends in Theoretical Computer Science 10, 1--2 (2014), 1--157.

Digital Library

Google Scholar

Cited By

View all

Kotzer AGandelman DRottenstreich O(2024)SoK: Applications of Sketches and Rollups in Blockchain NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2024.337260421:3(3194-3208)Online publication date: Jun-2024
https://doi.org/10.1109/TNSM.2024.3372604
Faisal TDi Francesco Maesa DSastry NMangiante S(2024)JITRA: Just-In-Time Resource Allocation Through the Distributed Ledgers for 5G and BeyondIEEE/ACM Transactions on Networking10.1109/TNET.2023.331823932:2(1201-1211)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1109/TNET.2023.3318239
Voronov TRaz DRottenstreich O(2024)A Framework for Anomaly Detection in Blockchain Networks With SketchesIEEE/ACM Transactions on Networking10.1109/TNET.2023.329825332:1(686-698)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3298253
Show More Cited By

Index Terms

Data sketching
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 60, Issue 9

September 2017

94 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/3134526

Editor:
Andrew A. Chien
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 August 2017

Published in CACM Volume 60, Issue 9

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
24,568
Total Downloads

Downloads (Last 12 months)4,717
Downloads (Last 6 weeks)89

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kotzer AGandelman DRottenstreich O(2024)SoK: Applications of Sketches and Rollups in Blockchain NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2024.337260421:3(3194-3208)Online publication date: Jun-2024
https://doi.org/10.1109/TNSM.2024.3372604
Faisal TDi Francesco Maesa DSastry NMangiante S(2024)JITRA: Just-In-Time Resource Allocation Through the Distributed Ledgers for 5G and BeyondIEEE/ACM Transactions on Networking10.1109/TNET.2023.331823932:2(1201-1211)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1109/TNET.2023.3318239
Voronov TRaz DRottenstreich O(2024)A Framework for Anomaly Detection in Blockchain Networks With SketchesIEEE/ACM Transactions on Networking10.1109/TNET.2023.329825332:1(686-698)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3298253
Reviriego PSánchez-Macian ADillinger PWalzer S(2024)On the Privacy of Multi-Versioned Approximate Membership Check FiltersIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2023.329896721:4(1981-1993)Online publication date: Jul-2024
https://doi.org/10.1109/TDSC.2023.3298967
Li BWang FZhou YOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Fair allocation of indivisible choresProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3668490(54366-54385)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3668490
Fu YAn LShen SChen KBarlet-Ros P(2023)A One-Pass Clustering Based Sketch Method for Network MonitoringIEEE/ACM Transactions on Networking10.1109/TNET.2023.325198131:6(2604-2613)Online publication date: Dec-2023
https://doi.org/10.1109/TNET.2023.3251981
Galán SReviriego PWalzer SSánchez-Macian ALiu SLombardi F(2023)On the Privacy of Counting Bloom Filters Under a Black-Box AttackerIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2022.321711520:5(4434-4440)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1109/TDSC.2022.3217115
Amsterdamer YDavidson SMilo TRazmadze KSomech A(2023)Selecting Sub-tables for Data Exploration2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00192(2496-2509)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00192
Li HYi LTang BLu HJensen C(2022)Efficient and error-bounded spatiotemporal quantile monitoring in edge computing environmentsProceedings of the VLDB Endowment10.14778/3538598.353860015:9(1753-1765)Online publication date: 27-Jul-2022
https://dl.acm.org/doi/10.14778/3538598.3538600
Das ASchatz M(2022)Sketching and sampling approaches for fast and accurate long read classificationBMC Bioinformatics10.1186/s12859-022-05014-023:1Online publication date: 31-Oct-2022
https://doi.org/10.1186/s12859-022-05014-0
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Freehand Sketching: For Engineering Design

Engineering Graphics Technical Sketching and AutoCAD 2009

Engineering Graphics Technical Sketching