Sketching Data Structures
Sketching Data Structures is a class of probabilistic data structures designed to summarize large data streams in sublinear space by capturing essential statistical properties, enabling approximate query responses with bounded error guarantees.
48
Publications
3K
Citations
125
Authors
64
Institutions
Publications per year
2017–2026
16
Parents
48
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 48
125
6
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 125
64

Peking University
Beijing, China
7 h-index
26 publications
1.5K citations
AT&T (United States)
Bedminster, United States
7 h-index
13 publications
1.8K citations
University of Florida
Gainesville, United States
4 h-index
5 publications
219 citations

Technical University of Crete
Chania, Greece
3 h-index
6 publications
819 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
3 publications
249 citations
University of Utah
Salt Lake City, United States
3 h-index
11 publications
225 citations
California University of Pennsylvania
California, United States
2 h-index
2 publications
271 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
2 h-index
4 publications
182 citations
1–8 of 64
PVLDB · 4 publications · 298 citations
4
h-index
TKDE · 3 publications · 102 citations
3
h-index
2 publications · 51 citations
2
h-index
TON · 2 publications · 60 citations
2
h-index
TPDS · 1 publications · 24 citations
1
h-index
1–5