LLAMA
Authors:
Open Access
- 26 August 2013
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 6 (10) , 877-888
Abstract
LLAMA is a subsystem designed for new hardware environments that supports an API for page-oriented access methods, providing both cache and storage management. Caching (CL) and storage (SL) layers use a common mapping table that separates a page's logical and physical location. CL supports data updates and management updates (e.g., for index re-organization) via latch-free compare-and-swap atomic state changes on its mapping table. SL uses the same mapping table to cope with page location changes produced by log structuring on every page flush. To demonstrate LLAMA's suitability, we tailored our latch-free Bw-tree implementation to use LLAMA. The Bw-tree is a B-tree style index. Layered on LLAMA, it has higher performance and scalability using real workloads compared with BerkeleyDB's B-tree, which is known for good performance.Keywords
This publication has 11 references indexed in Scilit:
- Design of flash-based DBMS2007
- The log-structured merge-tree (LSM-tree)Acta Informatica, 1996
- The LRU-K page replacement algorithm for database disk bufferingACM SIGMOD Record, 1993
- ARIES/IM: an efficient and high concurrency index management method using write-ahead loggingACM SIGMOD Record, 1992
- The design and implementation of a log-structured file systemACM Transactions on Computer Systems, 1992
- GENESIS: an extensible database management systemIEEE Transactions on Software Engineering, 1988
- Principles of database buffer managementACM Transactions on Database Systems, 1984
- Concurrent manipulation of binary search treesACM Transactions on Database Systems, 1980
- System RACM Transactions on Database Systems, 1976
- Organization and maintenance of large ordered indexesActa Informatica, 1972