Copertina

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhao, Fuheng, Miller, Zach, Reznikov, Leron, Agrawal, Divyakant, Abbadi, Amr El
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Databases Data Structures and Algorithms Information Retrieval
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Hybrid Querying Over Relational Databases and Large Language Models
di: Zhao, Fuheng, et al.
Pubblicazione: (2024)

Access Paths for Efficient Ordering with Large Language Models
di: Zhao, Fuheng, et al.
Pubblicazione: (2025)

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

LLM-SQL-Solver: Can LLMs Determine SQL Equivalence?
di: Zhao, Fuheng, et al.
Pubblicazione: (2023)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
di: Xu, Yuexuan, et al.
Pubblicazione: (2024)

Access Control for Information-Theoretically Secure Key-Document Stores
di: Li, Yin, et al.
Pubblicazione: (2025)

Rethinking LSM-tree based Key-Value Stores: A Survey
di: Lv, Yina, et al.
Pubblicazione: (2025)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
di: Tabei, Yasuo
Pubblicazione: (2025)

MetaHive: A Cache-Optimized Metadata Management for Heterogeneous Key-Value Stores
di: Heidari, Alireza, et al.
Pubblicazione: (2024)

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

Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
di: Azizi, Ilias, et al.
Pubblicazione: (2025)

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

Efficiently Constructing Sparse Navigable Graphs
di: Conway, Alex, et al.
Pubblicazione: (2025)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
di: Wang, Carrie, et al.
Pubblicazione: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
di: Gao, Jianyang, et al.
Pubblicazione: (2024)

SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
di: Li, Hui, et al.
Pubblicazione: (2025)

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

Diversity-Aware $k$-Maximum Inner Product Search Revisited
di: Huang, Qiang, et al.
Pubblicazione: (2024)

Linked Array Tree: A Constant-Time Search Structure for Big Data
di: Liu, Songpeng
Pubblicazione: (2025)

MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
di: Dhulipala, Laxman, et al.
Pubblicazione: (2024)

TIMEST: Temporal Information Motif Estimator Using Sampling Trees
di: Pan, Yunjie, et al.
Pubblicazione: (2025)

Correlation Sketches for Approximate Join-Correlation Queries
di: Santos, Aécio, et al.
Pubblicazione: (2021)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
di: Gao, Jianyang, et al.
Pubblicazione: (2024)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
di: Pan, Yunjie, et al.
Pubblicazione: (2024)

Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries
di: Güting, Ralf Hartmut, et al.
Pubblicazione: (2024)

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

Don't Forget Range Delete! Enhancing LSM-based Key-Value Stores with More Compatible Lookups and Deletes
di: Wang, Fan, et al.
Pubblicazione: (2025)

Retrieval with Learned Similarities
di: Ding, Bailu, et al.
Pubblicazione: (2024)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
di: Al-Jazzazi, Yousef, et al.
Pubblicazione: (2025)

Model-Free Counterfactual Subset Selection at Scale
di: Nguyen, Minh Hieu, et al.
Pubblicazione: (2025)

COPR -- Efficient, large-scale log storage and retrieval
di: Reichinger, Julian, et al.
Pubblicazione: (2024)

Triadic First-Order Logic Queries in Temporal Networks
di: Bhalerao, Omkar, et al.
Pubblicazione: (2025)

Scavenger+: Revisiting Space-Time Tradeoffs in Key-Value Separated LSM-trees
di: Zhang, Jianshun, et al.
Pubblicazione: (2025)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
di: Zhang, Ziyu, et al.
Pubblicazione: (2025)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
di: Dhulipala, Laxman, et al.
Pubblicazione: (2023)

Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees
di: Zhang, Jianshun, et al.
Pubblicazione: (2025)

ELMo-Tune-V2: LLM-Assisted Full-Cycle Auto-Tuning to Optimize LSM-Based Key-Value Stores
di: Thakkar, Viraj, et al.
Pubblicazione: (2025)

AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
di: Ramos, David Torres, et al.
Pubblicazione: (2026)

[Extended Version] ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads
di: Liu, Junfeng, et al.
Pubblicazione: (2025)