Summary Data Structures for Massive Data

DOI10.1007/978-3-642-39053-1_9zbMath1387.68082OpenAlexW1545436038MaRDI QIDQ5326361

Graham Cormode

Publication date: 5 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39053-1_9

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Tracking join and self-join sizes in limited storage
• Probabilistic counting algorithms for data base applications
• Finding repeated elements
• Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
• Mergeable summaries
• On coresets for k-means and k-median clustering
• An improved data stream summary: the count-min sketch and its applications
• Numerical linear algebra in the streaming model
• Database Theory - ICDT 2005
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: Summary Data Structures for Massive Data