CRDTs for Approximate Membership Queries

Probabilistic data structures are used in applications that manage large datasets due to their time and space efficiency. These applications can accommodate approximate results from probabilistic data structures and replicated systems that use them can take advantage of the efficiency gained from weaker synchronization and consistency among replicas.

Authors

Institutions

Publication Details

Published
2025-03-30
DOI
https://doi.org/10.1145/3721473.3722146
Primary Topic
Advanced Database Systems and Queries
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CRDTs for Approximate Membership Queries

Burcu Kulahcioglu Ozkan, Berkay Gulcan, Junbo Xiong Trovato
Advanced Database Systems and Queries
article

CRDTs for Approximate Membership Queries

Burcu Kulahcioglu Ozkan, Berkay Gulcan, Junbo Xiong Trovato
article en

Abstract

Probabilistic data structures are used in applications that manage large datasets due to their time and space efficiency. These applications can accommodate approximate results from probabilistic data structures and replicated systems that use them can take advantage of the efficiency gained from weaker synchronization and consistency among replicas.

Delft University of Technology (NL)
Openalex Percentile: Top 94%
Advanced Database Systems and Queries
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

CRDTs for Approximate Membership Queries — Burcu Kulahcioglu Ozkan, Berkay Gulcan, et al. · (2025) | TGRS Research Map | TGRS