Probabilistic Data Structures
Probabilistic Data Structures is a class of data organization methods that trade exactness for efficiency by employing randomized algorithms to approximate query responses, enabling sublinear space and time complexity in large-scale data processing.
157
Publications
9.8K
Citations
387
Authors
189
Institutions
Publications per year
2017–2026
48
Variants
Probabilistic Data Structure
Parents
157
Efficient query evaluation on probabilistic databases
Nilesh Dalvi, Dan Suciu · The VLDB Journal · 2006 · 979 citations
ABySS 2.0: resource-efficient assembly of large genomes using a Bloom filter
Shaun D. Jackman, Benjamin P. Vandervalk, Hamid Mohamadi et al. · Genome Research · 2017 · 740 citations · Full text
Five Balltree Construction Algorithms
Stephen M. Omohundro · 2009 · 416 citations
Management of probabilistic data
Nilesh Dalvi, Dan Suciu · 2007 · 293 citations
1–5 of 157
387
9
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 387
189

Peking University
Beijing, China
10 h-index
36 publications
1.5K citations
University of Washington
Seattle, United States
9 h-index
18 publications
3.9K citations
University of Maryland, College Park
College Park, United States
6 h-index
12 publications
958 citations
University of Florida
Gainesville, United States
5 h-index
8 publications
335 citations

Thapar Institute of Engineering & Technology
Patiāla, India
4 h-index
13 publications
803 citations
University of Kentucky
Lexington, United States
4 h-index
8 publications
158 citations
North Carolina State University
Raleigh, United States
4 h-index
4 publications
179 citations

Xidian University
Xi'an, China
4 h-index
10 publications
246 citations
1–8 of 189
PVLDB · 7 publications · 477 citations
7
h-index
Repository · 6 publications · 247 citations
6
h-index
6 publications · 1.3K citations
6
h-index
TKDE · 4 publications · 185 citations
4
h-index
TON · 3 publications · 91 citations
3
h-index
1–5