Technical Perspective: Diva: Dynamic Range Filter for Var-Length Keys and Queries
To accelerate data access, database systems have long relied on probabilistic filters, most notably Bloom filters, to avoid unnecessary I/O. These compact structures are highly effective for point queries: they answer ''is key x present?'' with one-sided error, i.e., with false positives but not false negatives.
Authors
- Viktor Leis (ORCID: https://orcid.org/0000-0001-5676-8017)
Institutions
- Technical University of Munich (DE)
Publication Details
- Journal
- ACM SIGMOD Record
- Published
- 2026-04-23
- DOI
- https://doi.org/10.1145/3810900.3810909
- Primary Topic
- Caching and Content Delivery
- Type
- article
- Field-Weighted Citation Impact
- 0.00