Imagen de Portada

Rateless Bloom Filters: Set Reconciliation for Divergent Replicas with Variable-Sized Elements

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gomes, Pedro Silva, Baquero, Carlos
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Databases H.0; E.4; D.4
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

ConflictSync: Bandwidth Efficient Synchronization of Divergent State
por: Gomes, Pedro Silva, et al.
Publicado: (2025)

New Entropy Measures for Tries with Applications to the XBWT
por: Carfagna, Lorenzo, et al.
Publicado: (2025)

Blocked Bloom Filters with Choices
por: Schmitz, Johanna Elena, et al.
Publicado: (2025)

Memento Filter: A Fast, Dynamic, and Robust Range Filter
por: Eslami, Navid, et al.
Publicado: (2024)

Daisy Bloom Filters
por: Bercea, Ioana O., et al.
Publicado: (2022)

Sampling Space-Saving Set Sketches
por: Lee, Homin K., et al.
Publicado: (2024)

Finding the Center and Centroid of a Graph with Multiple Sources
por: Chou, Matthew
Publicado: (2024)

A (Weakly) Polynomial Algorithm for AIVF Coding
por: Dolatabadi, Reza Hosseini, et al.
Publicado: (2024)

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
por: Liu, Junfeng, et al.
Publicado: (2025)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
por: Dolatabadi, Reza Hosseini, et al.
Publicado: (2024)

A process mining-based error correction approach to improve data quality of an IoT-sourced event log
por: Shirali, Mohsen, et al.
Publicado: (2024)

Smaller and More Flexible Cuckoo Filters
por: Schmitz, Johanna Elena, et al.
Publicado: (2025)

Aleph Filter: To Infinity in Constant Time
por: Dayan, Niv, et al.
Publicado: (2024)

The World's Fastest Matching Engine Algorithm
por: Yoon, Jake
Publicado: (2026)

Grafite: Taming Adversarial Queries with Optimal Range Filters
por: Costa, Marco, et al.
Publicado: (2023)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
por: Shlyk, Vasiliy S.
Publicado: (2026)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
por: Song, Siwoo, et al.
Publicado: (2025)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
por: Liang, Anqi, et al.
Publicado: (2024)

Clustering with Set Outliers and Applications in Relational Clustering
por: Surianarayanan, Vaishali, et al.
Publicado: (2025)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
por: Kenig, Batya, et al.
Publicado: (2024)

Mixed-Precision in High-Order Methods: the Impact of Floating-Point Precision on the ADER-DG Algorithm
por: Marot-Lassauzaie, Marc, et al.
Publicado: (2025)

Generalized compression and compressive search of large datasets
por: Prior, Morgan E., et al.
Publicado: (2024)

Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation
por: Shahbazi, Nima, et al.
Publicado: (2026)

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
por: Mukhopadhyay, Asish, et al.
Publicado: (2024)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
por: Li, Xuan, et al.
Publicado: (2024)

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
por: Ramos, David Torres, et al.
Publicado: (2026)

Sublime: Sublinear Error & Space for Unbounded Skewed Streams
por: Eslami, Navid, et al.
Publicado: (2026)

Hierarchical Robust PCA for Scalable Data Quality Monitoring in Multi-level Aggregation Pipelines
por: Ojha, Preetam Kumar
Publicado: (2025)

Unified Peripartum Database with Natural-Language-to-SQL Capabilities at Udine University Hospital: Design and Prototype
por: Armenise, Doriana, et al.
Publicado: (2025)

kendallknight: An R Package for Efficient Implementation of Kendall's Correlation Coefficient Computation
por: Sepúlveda, Mauricio Vargas
Publicado: (2024)

Weakly acyclic diagrams: A data structure for infinite-state symbolic verification
por: Blondin, Michael, et al.
Publicado: (2024)

The Energy-Throughput Trade-off in Lossless-Compressed Source Code Storage
por: Ferragina, Paolo, et al.
Publicado: (2026)

OnPair: Short Strings Compression for Fast Random Access
por: Gargiulo, Francesco, et al.
Publicado: (2025)

COPR -- Efficient, large-scale log storage and retrieval
por: Reichinger, Julian, et al.
Publicado: (2024)

Extending the Applicability of Bloom Filters by Relaxing their Parameter Constraints
por: Walther, Paul, et al.
Publicado: (2025)

Competitive Data-Structure Dynamization
por: Mathieu, Claire, et al.
Publicado: (2020)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
por: Iff, Patrick, et al.
Publicado: (2025)

The Chonkers Algorithm: Content-Defined Chunking with Provable Strict Guarantees on Size and Locality
por: Berger, Benjamin
Publicado: (2025)

Fast Construction of Partitioned Learned Bloom Filter with Theoretical Guarantees
por: Sato, Atsuki, et al.
Publicado: (2024)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
por: Carmeli, Nofar, et al.
Publicado: (2025)