Imagen de Portada

How to Train Your Filter: Should You Learn, Stack or Adapt?

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sabale, Diandre Miguel, Gatterbauer, Wolfgang, Pandey, Prashant
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Time To Replace Your Filter: How Maplets Simplify System Design
por: Bender, Michael A., et al.
Publicado: (2025)

The Importance of Parameters in Ranking Functions
por: Standke, Christoph, et al.
Publicado: (2026)

Adaptive Quotient Filters
por: Wen, Richard, et al.
Publicado: (2024)

zSort: Stable Distribution Sort using Z-Score Partitioning
por: Jain, Hriday, et al.
Publicado: (2026)

Database Research needs an Abstract Relational Query Language
por: Gatterbauer, Wolfgang, et al.
Publicado: (2025)

HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property
por: Chen, Zixuan, et al.
Publicado: (2023)

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers
por: Wheatman, Brian, et al.
Publicado: (2024)

On Minimizing Wiggle in Stacked Area Charts
por: Dobler, Alexander, et al.
Publicado: (2025)

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

Fingerprint Filters Are Optimal
por: Kuszmaul, William, et al.
Publicado: (2025)

Sparse Graph Reconstruction and Seriation for Large-Scale Image Stacks
por: Yang, Fuming, et al.
Publicado: (2025)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
por: McCoy, Hunter, et al.
Publicado: (2025)

A Little Clairvoyance Is All You Need
por: Gupta, Anupam, et al.
Publicado: (2025)

A Tour of Locality Sensitive Filtering on the Sphere
por: Becchetti, Luca, et al.
Publicado: (2026)

Optimizing Quotient Filters using Graveyard Hashing
por: Quaye, Isabelle, et al.
Publicado: (2025)

A Predictive Framework for Base-n Radix Sort Optimization
por: Pandey, Atharv, et al.
Publicado: (2025)

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

Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
por: Karathanasis, Konstantinos, et al.
Publicado: (2025)

You (Almost) Can't Beat Brute Force for 3-Matroid Intersection
por: Doron-Arad, Ilan, et al.
Publicado: (2024)

Adversary Resilient Learned Bloom Filters
por: Almashaqbeh, Ghada, et al.
Publicado: (2024)

Technical Report: Modeling Average False Positive Rates of Recycling Bloom Filters
por: Dozier, Kahlil, et al.
Publicado: (2024)

Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
por: Lange, Jane, et al.
Publicado: (2023)

ε-Cost Sharding: Scaling Hypergraph-Based Static Functions and Filters to Trillions of Keys
por: Vigna, Sebastiano
Publicado: (2025)

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

Iterative Chow Filtering for Learning with Distribution Shift
por: Chandrasekaran, Gautam, et al.
Publicado: (2026)

Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
por: Biedl, Therese, et al.
Publicado: (2026)

Finding maximum matchings in RDV graphs efficiently
por: Biedl, Therese, 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)

Learned LSM-trees: Two Approaches Using Learned Bloom Filters
por: Fidalgo, Nicholas, et al.
Publicado: (2025)

The Power of Iterative Filtering for Supervised Learning with (Heavy) Contamination
por: Klivans, Adam R., et al.
Publicado: (2025)

The Parameterized Complexity of Extending Stack Layouts
por: Depian, Thomas, et al.
Publicado: (2024)

On Wagner's k-Tree Algorithm Over Integers
por: Lin, Haoxing, et al.
Publicado: (2024)

Hitting Meets Packing: How Hard Can it Be?
por: Focke, Jacob, et al.
Publicado: (2024)

The connectivity carcass of a vertex subset in a graph: both odd and even case
por: Baswana, Surender, et al.
Publicado: (2025)

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

Efficient Leverage Score Sampling for Tensor Train Decomposition
por: Bharadwaj, Vivek, et al.
Publicado: (2024)

A New Method for Inserting Train Paths into a Timetable
por: Dekker, David, et al.
Publicado: (2024)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
por: Depian, Thomas, et al.
Publicado: (2025)

How to Find Long Maximal Exact Matches and Ignore Short Ones
por: Gagie, Travis
Publicado: (2024)