12 citations · 18 across the 13 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
David Torres Ramos, Vihan Lakshman, Chen Luo +2
We study the problem of building space-efficient, in-memory indexes for massive key-value datasets with highly skewed value distributions. This challenge arises in many data-intens…
cs.DS2023
CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
Benjamin Coleman, David Torres Ramos, Vihan Lakshman +2
Lookup tables are a fundamental structure in many data processing and systems applications. Examples include tokenized text in NLP, quantized embedding collections in recommendatio…
cs.DS2022★ 1 cited
DESSERT: An Efficient Algorithm for Vector Set Search with Vector Set Queries
Joshua Engels, Benjamin Coleman, Vihan Lakshman +1
We study the problem of with . This task is analogous to traditional near-neighbor search, with the exception that both th…