Summary data structures for massive data
From MaRDI portal
Recommendations
Cites work
- An improved data stream summary: the count-min sketch and its applications
- Database Theory - ICDT 2005
- Finding repeated elements
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 7053292 (Why is no real title available?)
- Mergeable summaries
- Numerical linear algebra in the streaming model
- On coresets for k-means and k-median clustering
- Probabilistic counting algorithms for data base applications
- Space/time trade-offs in hash coding with allowable errors
- Synopses for massive data: samples, histograms, wavelets, sketches
- Tracking join and self-join sizes in limited storage
Cited in
(12)- Graph summarization with quality guarantees
- Summarizing categorical data by clustering attributes
- An analytical approach to the inference of summary data of additive type
- CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets
- Synopses for massive data: samples, histograms, wavelets, sketches
- Mergeable summaries
- scientific article; zbMATH DE number 1305513 (Why is no real title available?)
- scientific article; zbMATH DE number 1792112 (Why is no real title available?)
- An hybrid data stream summarizing approach by sampling and clustering
- scientific article; zbMATH DE number 1424312 (Why is no real title available?)
- Summarized dimensions revisited
- Summarizing data using bottom-k sketches
This page was built for publication: Summary data structures for massive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326361)
