Cover Image

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ramos, David Torres, Lakshman, Vihan, Luo, Chen, Treangen, Todd, Coleman, Benjamin
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
by: Coleman, Benjamin, et al.
Published: (2023)

Space-Efficient Indexes for Uncertain Strings
by: Gabory, Esteban, et al.
Published: (2024)

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

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
by: Ghandeharizadeh, Shahram, et al.
Published: (2024)

Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025)

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

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

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

Parallel Dynamic Spatial Indexes
by: Men, Ziyang, et al.
Published: (2026)

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

Hilbert Forest in the SISAP 2025 Indexing Challenge
by: Imamura, Yasunobu, et al.
Published: (2025)

Querying in Constant Expected Time with Learned Indexes
by: Croquevielle, Luis, et al.
Published: (2024)

New Compressed Indices for Multijoins on Graph Databases
by: Arroyuelo, Diego, et al.
Published: (2024)

Targeted Least Cardinality Candidate Key for Relational Databases
by: Nakos, Vasileios, et al.
Published: (2024)

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

Text Indexing for Long Patterns using Locally Consistent Anchors
by: Ayad, Lorraine A. K., et al.
Published: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
by: Arroyuelo, Diego, et al.
Published: (2023)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
by: Yang, Huihui, et al.
Published: (2025)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
by: Li, Zheng, et al.
Published: (2025)

Learned Static Function Data Structures
by: Hermann, Stefan, et al.
Published: (2025)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
by: Zhao, Fuheng, et al.
Published: (2023)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
by: Shah, Vihan
Published: (2026)

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
by: Zhao, Fuheng, et al.
Published: (2023)

Space-efficient B-tree Implementation for Memory-Constrained Flash Embedded Devices
by: Ould-Khessal, Nadir, et al.
Published: (2026)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
by: Jang, Jihoon, et al.
Published: (2025)

Daisy Bloom Filters
by: Bercea, Ioana O., et al.
Published: (2022)

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
by: Ertl, Otmar
Published: (2024)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
by: Fan, Zhuochen, et al.
Published: (2024)

UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
by: Ertl, Otmar
Published: (2023)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
by: Im, Sungjin, et al.
Published: (2025)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
by: Im, Sungjin, et al.
Published: (2023)

Down with the Hierarchy: The 'H' in HNSW Stands for "Hubs"
by: Munyampirwa, Blaise, et al.
Published: (2024)

Compressed Index with Construction in Compressed Space
by: Kosolobov, Dmitry
Published: (2026)

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

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

B+ANN: A Fast Billion-Scale Disk-based Nearest-Neighbor Index
by: Tekin, Selim Furkan, et al.
Published: (2025)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
by: Assadi, Sepehr, et al.
Published: (2025)

New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification
by: Ghosh, Prantar, et al.
Published: (2024)

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

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
by: Shi, Jifan, et al.
Published: (2026)