The log-structured merge-tree (LSM-tree)-Reference-Cited by-同舟云学术

The log-structured merge-tree (LSM-tree)

Published:1996-06 Issue:4 Volume:33 Page:351-385
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

O’Neil Patrick,Cheng Edward,Gawlick Dieter,O’Neil Elizabeth

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/s002360050048.pdf

Reference29 articles.

1. Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading, MA, Addison-Wesley

2. A measure of transaction processing power,1988

3. Bayer, R., Schkolnick, M.: Concurrency of operations on B-trees. In: Stonebraker, M. (ed.) Readings in database systems, pp. 129–139, San Mateo, CA, Morgan Kaufmann, 1988

4. Bernstein, P. A., Hadzilacos, V., Goodman, N.: Concurrency control and recovery in database systems. Reading, MA, Addison-Wesley 1987

5. Corner, D.: The ubiquitous B-tree. Comput. Surv. 11, 121–137 (1979)

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

1. Storage Management with Multi-Version Partitioned BTrees;Information Systems;2024-11

2. SolsDB: Solve the Ethereum’s bottleneck caused by storage engine;Future Generation Computer Systems;2024-11

3. D ² Comp: Efficient Offload of LSM-tree Compaction with Data Processing Units on Disaggregated Storage;ACM Transactions on Architecture and Code Optimization;2024-09-14

4. MVLevelDB ⁺ : Meeting Relative Consistency Requirements of Temporal Queries in Sensor Streams Databases;ACM Transactions on Embedded Computing Systems;2024-09-04

5. Efficient Wear-Leveling-Aware Data Placement for LSM-Tree based key-value store on ZNS SSDs;Journal of King Saud University - Computer and Information Sciences;2024-09