FenceKV: Enabling Efficient Range Query for Key-Value Separation-Reference-Cited by-同舟云学术

FenceKV: Enabling Efficient Range Query for Key-Value Separation

Author:

Tang Chenlei¹^ORCID,Wan Jiguang¹^ORCID,Xie Changsheng¹^ORCID

Affiliation:

1. Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, Hubei, China

Funder

National Natural Science Foundation of China

Special Project for Research and Development in Key areas of Guangdong Province

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Computational Theory and Mathematics,Hardware and Architecture,Signal Processing

Link

Reference45 articles.

2. HashCache: Cache storage for the next billion;badam;Proc 6th USENIX Symp Netw Syst Des Implementation,2009

4. REMIX: Efficient range query for LSM-trees;zhong;Proc 19th USENIX Conf File Storage Technol,2021

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. TreeKV: efficient garbage collection and range query for key-value separated LSM-stores;Third International Symposium on Computer Applications and Information Systems (ISCAIS 2024);2024-07-11

2. Wayfinder: Speeding up Key-Value Separation by Avoiding I/O Based Indirection;Proceedings of the 2nd Workshop on Simplicity in Management of Data;2024-06-14

4. Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13