Data Sketches
Data Sketches is a computational abstraction that belongs to the class of data summarization techniques, distinguished by its use of compact, probabilistic data structures to enable efficient approximation of large-scale datasets under strict memory and time constraints.
56
Publications
3.7K
Citations
132
Authors
70
Institutions
Publications per year
2017–2026
21
Variants
Sketching
Parents
56
Approximate aggregation techniques for sensor databases
Jeffrey Considine, Fanrong Li, George Kollios et al. · 2004 · 564 citations
Fast, small-space algorithms for approximate histogram maintenance
Anna C. Gilbert, Sudipto Guha, Piotr Indyk et al. · 2002 · 248 citations
Summarizing data using bottom-k sketches
Edith Cohen, Haim Kaplan · 2007 · 165 citations
1–5 of 56
132
7
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 132
70
AT&T (United States)
Bedminster, United States
9 h-index
15 publications
2.1K citations
IBM Research - Almaden
San Jose, United States
6 h-index
9 publications
782 citations
Princeton University
Princeton, United States
4 h-index
14 publications
395 citations
University of Utah
Salt Lake City, United States
4 h-index
10 publications
379 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
3 h-index
8 publications
605 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
3 publications
266 citations

Peking University
Beijing, China
3 h-index
17 publications
1K citations

Masaryk University
Brno, Czechia
3 h-index
7 publications
183 citations
1–8 of 70
PVLDB · 4 publications · 422 citations
4
h-index
Repository · 3 publications · 50 citations
3
h-index
1 publications · 148 citations
1
h-index
PER · 1 publications · 11 citations
1
h-index
TKDE · 1 publications · 12 citations
1
h-index
1–5