CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
Fuente:
arXiv
Saved in:
| Main Authors: | Coleman, Benjamin, Ramos, David Torres, Lakshman, Vihan, Luo, Chen, Shrivastava, Anshumali |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
by: Ramos, David Torres, et al.
Published: (2026)
by: Ramos, David Torres, et al.
Published: (2026)
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)
by: Zhao, Fuheng, et al.
Published: (2023)
MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025)
by: Conway, Alex, et al.
Published: (2025)
On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
by: Wang, Carrie, et al.
Published: (2025)
by: Wang, Carrie, et al.
Published: (2025)
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)
by: Gao, Jianyang, et al.
Published: (2024)
jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
by: Tabei, Yasuo
Published: (2025)
by: Tabei, Yasuo
Published: (2025)
SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
by: Li, Hui, et al.
Published: (2025)
by: Li, Hui, et al.
Published: (2025)
Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
by: Iff, Patrick, et al.
Published: (2025)
by: Iff, Patrick, et al.
Published: (2025)
GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
by: Shi, Jifan, et al.
Published: (2026)
by: Shi, Jifan, et al.
Published: (2026)
Diversity-Aware $k$-Maximum Inner Product Search Revisited
by: Huang, Qiang, et al.
Published: (2024)
by: Huang, Qiang, et al.
Published: (2024)
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
by: Xu, Yuexuan, et al.
Published: (2024)
by: Xu, Yuexuan, et al.
Published: (2024)
Linked Array Tree: A Constant-Time Search Structure for Big Data
by: Liu, Songpeng
Published: (2025)
by: Liu, Songpeng
Published: (2025)
TIMEST: Temporal Information Motif Estimator Using Sampling Trees
by: Pan, Yunjie, et al.
Published: (2025)
by: Pan, Yunjie, et al.
Published: (2025)
Correlation Sketches for Approximate Join-Correlation Queries
by: Santos, Aécio, et al.
Published: (2021)
by: Santos, Aécio, et al.
Published: (2021)
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)
by: Gao, Jianyang, et al.
Published: (2024)
Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
by: Azizi, Ilias, et al.
Published: (2025)
by: Azizi, Ilias, et al.
Published: (2025)
Down with the Hierarchy: The 'H' in HNSW Stands for "Hubs"
by: Munyampirwa, Blaise, et al.
Published: (2024)
by: Munyampirwa, Blaise, et al.
Published: (2024)
Accurate and Fast Estimation of Temporal Motifs using Path Sampling
by: Pan, Yunjie, et al.
Published: (2024)
by: Pan, Yunjie, et al.
Published: (2024)
Triadic First-Order Logic Queries in Temporal Networks
by: Bhalerao, Omkar, et al.
Published: (2025)
by: Bhalerao, Omkar, et al.
Published: (2025)
Retrieval with Learned Similarities
by: Ding, Bailu, et al.
Published: (2024)
by: Ding, Bailu, et al.
Published: (2024)
Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
by: Al-Jazzazi, Yousef, et al.
Published: (2025)
by: Al-Jazzazi, Yousef, et al.
Published: (2025)
Model-Free Counterfactual Subset Selection at Scale
by: Nguyen, Minh Hieu, et al.
Published: (2025)
by: Nguyen, Minh Hieu, et al.
Published: (2025)
COPR -- Efficient, large-scale log storage and retrieval
by: Reichinger, Julian, et al.
Published: (2024)
by: Reichinger, Julian, et al.
Published: (2024)
CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
by: Zhang, Ziyu, et al.
Published: (2025)
by: Zhang, Ziyu, et al.
Published: (2025)
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
by: Dhulipala, Laxman, et al.
Published: (2023)
by: Dhulipala, Laxman, et al.
Published: (2023)
Breaking the Curse of Dimensionality: On the Stability of Modern Vector Retrieval
by: Lakshman, Vihan, et al.
Published: (2025)
by: Lakshman, Vihan, et al.
Published: (2025)
Foundations of Vector Retrieval
by: Bruch, Sebastian
Published: (2024)
by: Bruch, Sebastian
Published: (2024)
On the LSH Distortion of Ulam and Cayley Similarities
by: Chierichetti, Flavio, et al.
Published: (2026)
by: Chierichetti, Flavio, et al.
Published: (2026)
Protecting participants or population? Comparison of k-anonymous Origin-Destination matrices
by: Armenante, Pietro, et al.
Published: (2025)
by: Armenante, Pietro, et al.
Published: (2025)
Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
by: Xu, Zhenxiang, et al.
Published: (2024)
by: Xu, Zhenxiang, et al.
Published: (2024)
Fast and exact fixed-radius neighbor search based on sorting
by: Chen, Xinye, et al.
Published: (2022)
by: Chen, Xinye, et al.
Published: (2022)
Streaming Stochastic Submodular Maximization with On-Demand User Requests
by: Wang, Honglian, et al.
Published: (2026)
by: Wang, Honglian, et al.
Published: (2026)
Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
by: Zhang, Tian, et al.
Published: (2026)
by: Zhang, Tian, et al.
Published: (2026)
Hierarchical Locality Sensitive Hashing for Structured Data: A Survey
by: Wu, Wei, et al.
Published: (2022)
by: Wu, Wei, et al.
Published: (2022)
An Effective Tag Assignment Approach for Billboard Advertisement
by: Ali, Dildar, et al.
Published: (2024)
by: Ali, Dildar, et al.
Published: (2024)
Average Case Graph Searching in Non-Uniform Cost Models
by: Szyfelbein, Michał
Published: (2026)
by: Szyfelbein, Michał
Published: (2026)
Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
by: Lebeda, Christian Janos, et al.
Published: (2024)
by: Lebeda, Christian Janos, et al.
Published: (2024)
Deterministic Retrieval at Scale: Optimal-Space LCP Indexing and 308x Energy Reduction on Modern GPUs
by: Byriukov, Stanislav
Published: (2026)
by: Byriukov, Stanislav
Published: (2026)
Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
by: Faro, Simone, et al.
Published: (2025)
by: Faro, Simone, et al.
Published: (2025)
Similar Items
-
AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
by: Ramos, David Torres, et al.
Published: (2026) -
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) -
MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
by: Dhulipala, Laxman, et al.
Published: (2024) -
Efficiently Constructing Sparse Navigable Graphs
by: Conway, Alex, et al.
Published: (2025) -
On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
by: Wang, Carrie, et al.
Published: (2025)