Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ramos, David Torres, Lakshman, Vihan, Luo, Chen, Treangen, Todd, Coleman, Benjamin
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Databases
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
par: Coleman, Benjamin, et autres
Publié: (2023)

Space-Efficient Indexes for Uncertain Strings
par: Gabory, Esteban, et autres
Publié: (2024)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
par: Liang, Anqi, et autres
Publié: (2024)

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
par: Ghandeharizadeh, Shahram, et autres
Publié: (2024)

Indexing Strings with Utilities
par: Bernardini, Giulia, et autres
Publié: (2025)

Blocked Bloom Filters with Choices
par: Schmitz, Johanna Elena, et autres
Publié: (2025)

Smaller and More Flexible Cuckoo Filters
par: Schmitz, Johanna Elena, et autres
Publié: (2025)

Aleph Filter: To Infinity in Constant Time
par: Dayan, Niv, et autres
Publié: (2024)

Parallel Dynamic Spatial Indexes
par: Men, Ziyang, et autres
Publié: (2026)

Grafite: Taming Adversarial Queries with Optimal Range Filters
par: Costa, Marco, et autres
Publié: (2023)

Hilbert Forest in the SISAP 2025 Indexing Challenge
par: Imamura, Yasunobu, et autres
Publié: (2025)

Querying in Constant Expected Time with Learned Indexes
par: Croquevielle, Luis, et autres
Publié: (2024)

New Compressed Indices for Multijoins on Graph Databases
par: Arroyuelo, Diego, et autres
Publié: (2024)

Targeted Least Cardinality Candidate Key for Relational Databases
par: Nakos, Vasileios, et autres
Publié: (2024)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
par: Song, Siwoo, et autres
Publié: (2025)

Text Indexing for Long Patterns using Locally Consistent Anchors
par: Ayad, Lorraine A. K., et autres
Publié: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
par: Arroyuelo, Diego, et autres
Publié: (2023)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
par: Yang, Huihui, et autres
Publié: (2025)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
par: Li, Zheng, et autres
Publié: (2025)

Learned Static Function Data Structures
par: Hermann, Stefan, et autres
Publié: (2025)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
par: Zhao, Fuheng, et autres
Publié: (2023)

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

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
par: Zhao, Fuheng, et autres
Publié: (2023)

Space-efficient B-tree Implementation for Memory-Constrained Flash Embedded Devices
par: Ould-Khessal, Nadir, et autres
Publié: (2026)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
par: Jang, Jihoon, et autres
Publié: (2025)

Daisy Bloom Filters
par: Bercea, Ioana O., et autres
Publié: (2022)

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

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
par: Fan, Zhuochen, et autres
Publié: (2024)

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

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
par: Im, Sungjin, et autres
Publié: (2025)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
par: Im, Sungjin, et autres
Publié: (2023)

Down with the Hierarchy: The 'H' in HNSW Stands for "Hubs"
par: Munyampirwa, Blaise, et autres
Publié: (2024)

Compressed Index with Construction in Compressed Space
par: Kosolobov, Dmitry
Publié: (2026)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
par: Iff, Patrick, et autres
Publié: (2025)

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
par: Liu, Junfeng, et autres
Publié: (2025)

B+ANN: A Fast Billion-Scale Disk-based Nearest-Neighbor Index
par: Tekin, Selim Furkan, et autres
Publié: (2025)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
par: Assadi, Sepehr, et autres
Publié: (2025)

New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification
par: Ghosh, Prantar, et autres
Publié: (2024)

Sampling Space-Saving Set Sketches
par: Lee, Homin K., et autres
Publié: (2024)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
par: Shi, Jifan, et autres
Publié: (2026)