19 citations · 23 across the 6 of their papers we have counts for
4 papers · 1 filter
Don't Forget Range Delete! Enhancing LSM-based Key-Value Stores with More Compatible Lookups and Deletes
Fan Wang, Dingheng Mo, Siqiang Luo
LSM-trees are featured by out-of-place updates, where key deletion is handled by inserting a tombstone to mark its staleness instead of removing it in place. This defers actual rem…
LSM-Vec: A Memory-Efficient Disk-Based System for Large-Scale Dynamic Vector Search
Shurui Zhong, Dingheng Mo, Siqiang Luo +1
RAG and AI retrieval have made vector approximate nearest-neighbor (ANN) search a key retrieval operation in modern data systems. These workloads are both large and dynamic. Vector…
How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice
Dingheng Mo, Siqiang Luo, Stratos Idreos
LSM-tree based key-value stores are widely adopted as the data storage backend in modern big data applications. The LSM-tree grows with data ingestion, by either adding levels with…
Aster: Enhancing LSM-structures for Scalable Graph Database
Dingheng Mo, Junfeng Liu, Fan Wang +1
There is a proliferation of applications requiring the management of large-scale, evolving graphs under workloads with intensive graph updates and lookups. Driven by this challenge…