The log-structured merge-tree (LSM-tree)
- 1 June 1996
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 33 (4), 351-385
- https://doi.org/10.1007/s002360050048
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- TheSB-tree an index-sequential structure for high-performance sequential accessActa Informatica, 1992
- The design and implementation of a log-structured file systemACM Transactions on Computer Systems, 1992
- Principles and realization strategies of multilevel transaction managementACM Transactions on Database Systems, 1991
- A simple bounded disorder file organization with good performanceACM Transactions on Database Systems, 1988
- The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU timeACM SIGMOD Record, 1987
- Distributed logging for transaction processingPublished by Association for Computing Machinery (ACM) ,1987
- The Escrow transactional methodACM Transactions on Database Systems, 1986
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Differential filesACM Transactions on Database Systems, 1976