{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T23:08:30Z","timestamp":1774307310427,"version":"3.50.1"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2013,8,26]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.14778\/2536206.2536215","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"877-888","source":"Crossref","is-referenced-by-count":43,"title":["LLAMA"],"prefix":"10.14778","volume":"6","author":[{"given":"Justin","family":"Levandoski","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Lomet","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudipta","family":"Sengupta","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"266","volume-title":"VLDB","author":"Ailamaki A.","year":"1999","unstructured":"A. Ailamaki , D. J. DeWitt , M. D. Hill , and D. A. Wood : DBMSs on a Modern Processor: Where Does Time Go ? VLDB , 1999 , 266 - 277 . A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood: DBMSs on a Modern Processor: Where Does Time Go? VLDB, 1999, 266-277."},{"issue":"2","key":"e_1_2_1_2_1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/320455.320457","article-title":"System R: Relational Approach to Database Management","volume":"1","author":"Astrahan M.","year":"1976","unstructured":"M. Astrahan , M. Blasgen , D. Chamberlin , : System R: Relational Approach to Database Management . ACM TODS 1 ( 2 ): 97 - 137 ( 1976 ). M. Astrahan, M. Blasgen, D. Chamberlin, et al.: System R: Relational Approach to Database Management. ACM TODS 1(2): 97-137 (1976).","journal-title":"ACM TODS"},{"issue":"11","key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1109\/32.9057","article-title":"GENESIS","volume":"14","author":"Batory D. S.","year":"1988","unstructured":"D. S. Batory , J. R. Barnett , J. F. Garza , K. P. Smith , K. Tsukuda , B. C. Twichell , T. E. Wise : GENESIS : An Extensible Database Management System. IEEE Trans. Software Eng. 14 ( 11 ): 1711 - 1730 ( 1988 ). D. S. Batory, J. R. Barnett, J. F. Garza, K. P. Smith, K. Tsukuda, B. C. Twichell, T. E. Wise: GENESIS: An Extensible Database Management System. IEEE Trans. Software Eng. 14(11): 1711-1730 (1988).","journal-title":"An Extensible Database Management System. IEEE Trans. Software Eng."},{"issue":"1","key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and Maintenance of Large Ordered Indices","volume":"1","author":"Bayer R.","year":"1972","unstructured":"R. Bayer and E. M. McCreight : Organization and Maintenance of Large Ordered Indices . Acta Inf. 1 ( 1 ) pp. 173 - 189 , 1972 . R. Bayer and E. M. McCreight: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1(1) pp. 173-189, 1972.","journal-title":"Acta Inf."},{"key":"e_1_2_1_5_1","unstructured":"BerkeleyDB. http:\/\/www.oracle.com\/technology\/products\/berkeley-db\/index.html. BerkeleyDB. http:\/\/www.oracle.com\/technology\/products\/berkeley-db\/index.html."},{"key":"e_1_2_1_6_1","first-page":"9","volume-title":"CIDR","author":"Bernstein P.","year":"2011","unstructured":"P. Bernstein , C. Reid , and S. Das : Hyder - a transactional record manager for shared flash . CIDR , 2011 , pp. 9 - 20 . P. Bernstein, C. Reid, and S. Das: Hyder - a transactional record manager for shared flash. CIDR, 2011, pp. 9-20."},{"key":"e_1_2_1_7_1","first-page":"2","volume":"11","author":"Comer D.","year":"1979","unstructured":"D. Comer : The Ubiquitous B-tree. ACM Comp. Surveys 11 , 2 ( June 1979 ) 121-137. D. Comer: The Ubiquitous B-tree. ACM Comp. Surveys 11, 2 (June 1979) 121-137.","journal-title":"The Ubiquitous B-tree. ACM Comp. Surveys"},{"key":"e_1_2_1_8_1","first-page":"25","volume-title":"SIGMOD","author":"Debnath B.","year":"2011","unstructured":"B. Debnath , S. Sengupta , and J. Li , SkimpyStash: RAM Space Skimpy Key-Value Store on Flash-based Storage . SIGMOD , 2011 , pp. 25 - 36 . B. Debnath, S. Sengupta, and J. Li, SkimpyStash: RAM Space Skimpy Key-Value Store on Flash-based Storage. SIGMOD, 2011, pp. 25-36."},{"issue":"4","key":"e_1_2_1_9_1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/1994.2022","article-title":"Principles of database buffer management","volume":"9","author":"Effelsberg W.","year":"1984","unstructured":"W. Effelsberg , T. Haerder : Principles of database buffer management . ACM TODS 9 ( 4 ) 560 - 595 , 1984 . W. Effelsberg, T. Haerder: Principles of database buffer management. ACM TODS 9 (4) 560-595, 1984.","journal-title":"ACM TODS"},{"key":"e_1_2_1_10_1","volume-title":"SIGMOD 2008: 981-992","author":"Harizopoulos S.","unstructured":"S. Harizopoulos , D. Abadi , S. Madden , M. Stonebraker : OLTP through the looking glass, and what we found there . SIGMOD 2008: 981-992 . S. Harizopoulos, D. Abadi, S. Madden, M. Stonebraker: OLTP through the looking glass, and what we found there. SIGMOD 2008: 981-992."},{"key":"e_1_2_1_11_1","first-page":"1","volume-title":"Write amplification analysis in flash-based solid state drives. iSYSTOR 2009","author":"Hu X.-Y.","unstructured":"X.-Y. Hu , E. Eleftheriou , R. Haas , I. Iliadis , and R. Pletka , Write amplification analysis in flash-based solid state drives. iSYSTOR 2009 : pp. 10: 1 - 10 :9. X.-Y. Hu, E. Eleftheriou, R. Haas, I. Iliadis, and R. Pletka, Write amplification analysis in flash-based solid state drives. iSYSTOR 2009: pp. 10:1-10:9."},{"issue":"3","key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1145\/320613.320619","article-title":"Concurrent manipulation of binary search trees","volume":"5","author":"Kung H.","year":"1980","unstructured":"H. Kung and P. Lehman , Concurrent manipulation of binary search trees , TODS , vol. 5 , no. 3 , pp. 354 - 382 , 1980 . H. Kung and P. Lehman, Concurrent manipulation of binary search trees, TODS, vol. 5, no. 3, pp. 354-382, 1980.","journal-title":"TODS"},{"issue":"4","key":"e_1_2_1_13_1","first-page":"298","article-title":"High-Performance Concurrency Control Mechanisms for Main-Memory Databases","volume":"5","author":"Larson P-A","year":"2011","unstructured":"P-A Larson , S. Blanas , C. Diaconu , : High-Performance Concurrency Control Mechanisms for Main-Memory Databases . PVLDB 5 ( 4 ): 298 - 309 ( 2011 ). P-A Larson, S. Blanas, C. Diaconu, et al: High-Performance Concurrency Control Mechanisms for Main-Memory Databases. PVLDB 5(4): 298-309 (2011).","journal-title":"PVLDB"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/1247480.1247488","volume-title":"SIGMOD","author":"Lee S.-W.","year":"2007","unstructured":"S.-W. Lee , B. Moon . Design of Flash-Based DBMS: An In-Page Logging Approach . SIGMOD , 2007 , pp. 55 - 66 . S.-W. Lee, B. Moon. Design of Flash-Based DBMS: An In-Page Logging Approach. SIGMOD, 2007, pp. 55-66."},{"key":"e_1_2_1_15_1","first-page":"123","volume-title":"CIDR","author":"Levandoski J.","year":"2011","unstructured":"J. Levandoski , D. Lomet , M. Mokbel , K. Zhao , Deuteronomy : Transaction Support for Cloud Data . CIDR , 2011 , pp. 123 - 133 . J. Levandoski, D. Lomet, M. Mokbel, K. Zhao, Deuteronomy: Transaction Support for Cloud Data. CIDR, 2011, pp. 123-133."},{"key":"e_1_2_1_16_1","first-page":"302","volume-title":"The Bw-Tree: A B-tree for New Hardware Platforms. ICDE","author":"Levandoski J.","year":"2013","unstructured":"J. Levandoski , D. Lomet , S. Sengupta . The Bw-Tree: A B-tree for New Hardware Platforms. ICDE 2013 , pp. 302 - 313 . J. Levandoski, D. Lomet, S. Sengupta. The Bw-Tree: A B-tree for New Hardware Platforms. ICDE 2013, pp. 302-313."},{"key":"e_1_2_1_17_1","volume-title":"Techniques and Future Potential. SSD 1991: 183-206","author":"Lomet D. B.","unstructured":"D. B. Lomet : Grow and Post Index Trees: Roles , Techniques and Future Potential. SSD 1991: 183-206 . D. B. Lomet: Grow and Post Index Trees: Roles, Techniques and Future Potential. SSD 1991: 183-206."},{"key":"e_1_2_1_18_1","unstructured":"D. Lomet: The Case for Log Structuring in Database Systems. HPTS (1995). D. Lomet: The Case for Log Structuring in Database Systems. HPTS (1995)."},{"key":"e_1_2_1_19_1","first-page":"123","article-title":"Unbundling Transaction Services in the Cloud","volume":"2009","author":"Lomet D.","unstructured":"D. Lomet , A. Fekete , G. Weikum , M. Zwilling . Unbundling Transaction Services in the Cloud . CIDR , 2009 : 123 - 133 . D. Lomet, A. Fekete, G. Weikum, M. Zwilling. Unbundling Transaction Services in the Cloud. CIDR, 2009: 123-133.","journal-title":"CIDR"},{"key":"e_1_2_1_20_1","unstructured":"\"MemSQL Indexes. http:\/\/developers.memsql.com\/docs\/1b\/indexes.html \"MemSQL Indexes. http:\/\/developers.memsql.com\/docs\/1b\/indexes.html"},{"key":"e_1_2_1_21_1","volume-title":"Frank E. Levine: ARIES\/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. SIGMOD 1992: 371-380","author":"Mohan C.","unstructured":"C. Mohan , Frank E. Levine: ARIES\/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. SIGMOD 1992: 371-380 . C. Mohan, Frank E. Levine: ARIES\/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. SIGMOD 1992: 371-380."},{"key":"e_1_2_1_22_1","unstructured":"\"MongoDB. http:\/\/www.mongodb.org\/MongoDB. http:\/\/www.mongodb.org. \"MongoDB. http:\/\/www.mongodb.org\/MongoDB. http:\/\/www.mongodb.org."},{"issue":"4","key":"e_1_2_1_23_1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s002360050048","article-title":"The Log-Structured Merge-Tree (LSM-Tree)","volume":"33","author":"O'Neil Patrick E.","year":"1996","unstructured":"Patrick E. O'Neil , Edward Cheng , Dieter Gawlick , Elizabeth J. O'Neil : The Log-Structured Merge-Tree (LSM-Tree) . Acta Inf. 33 ( 4 ): 351 - 385 ( 1996 ). Patrick E. O'Neil, Edward Cheng, Dieter Gawlick, Elizabeth J. O'Neil: The Log-Structured Merge-Tree (LSM-Tree). Acta Inf. 33(4): 351-385 (1996).","journal-title":"Acta Inf."},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/170035.170081","volume-title":"SIGMOD","author":"O'Neil E.","year":"1993","unstructured":"E. O'Neil , P. O'Neil , G. Weikum . The LRU-K page replacement algorithm for database disk buffering . SIGMOD 1993 . pp 297 - 306 . E. O'Neil, P. O'Neil, G. Weikum. The LRU-K page replacement algorithm for database disk buffering. SIGMOD 1993. pp 297-306."},{"issue":"10","key":"e_1_2_1_25_1","first-page":"610","article-title":"PLP: Page Latch-free Shared-everything OLTP","volume":"4","author":"Pandis I.","year":"2011","unstructured":"I. Pandis , P. T\u00f6z\u00fcn , R. Johnson , and A. Ailamaki , \" PLP: Page Latch-free Shared-everything OLTP ,\" PVLDB 4 ( 10 ) pp. 610 - 621 , 2011 . I. Pandis, P. T\u00f6z\u00fcn, R. Johnson, and A. Ailamaki, \"PLP: Page Latch-free Shared-everything OLTP,\" PVLDB 4(10) pp. 610-621, 2011.","journal-title":"PVLDB"},{"key":"e_1_2_1_26_1","unstructured":"Project Voldermont. http:\/\/www.project-voldemort.com\/voldemort\/ Project Voldermont. http:\/\/www.project-voldemort.com\/voldemort\/"},{"issue":"1","key":"e_1_2_1_27_1","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/146941.146943","article-title":"The Design and Implementation of a Log-Structured File System","volume":"10","author":"Rosenblum M.","year":"1992","unstructured":"M. Rosenblum and J. Ousterhout , \" The Design and Implementation of a Log-Structured File System ,\" ACM TOCS 10 ( 1 ) pp. 26 - 52 , 1992 . M. Rosenblum and J. Ousterhout, \"The Design and Implementation of a Log-Structured File System,\" ACM TOCS 10(1) pp. 26-52, 1992.","journal-title":"ACM TOCS"},{"key":"e_1_2_1_28_1","volume-title":"SIGMOD 2012: 217-228","author":"Sears R.","unstructured":"R. Sears and R. Ramakrishnan , bLSM: A General Purpose Log Structured Merge Tree . SIGMOD 2012: 217-228 . R. Sears and R. Ramakrishnan, bLSM: A General Purpose Log Structured Merge Tree. SIGMOD 2012: 217-228."},{"issue":"11","key":"e_1_2_1_29_1","first-page":"795","article-title":"PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors","volume":"4","author":"Sewall J.","year":"2011","unstructured":"J. Sewall , J. Chhugani , C. Kim , \" PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors . PVLDB 4 ( 11 ) pp. 795 - 806 , 2011 . J. Sewall, J. Chhugani, C. Kim, et al. \"PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors. PVLDB 4 (11) pp. 795-806, 2011.","journal-title":"PVLDB"},{"key":"e_1_2_1_30_1","volume-title":"SIGMOD 2012: 1-12","author":"Thomson A.","unstructured":"A. Thomson , T. Diamond , S-C Weng , K. Ren , : Calvin: fast distributed transactions for partitioned database systems . SIGMOD 2012: 1-12 . A.Thomson, T. Diamond, S-C Weng, K. Ren, et al.: Calvin: fast distributed transactions for partitioned database systems. SIGMOD 2012: 1-12."},{"key":"e_1_2_1_31_1","unstructured":"Wikipedia: (CRUD) http:\/\/en.wikipedia.org\/wiki\/Create _read _update_and_delete Wikipedia: (CRUD) http:\/\/en.wikipedia.org\/wiki\/Create _read _update_and_delete"},{"key":"e_1_2_1_32_1","unstructured":"Wikipedia: (NoSQL) http:\/\/en.wikipedia.org\/wiki\/NoSQL Wikipedia: (NoSQL) http:\/\/en.wikipedia.org\/wiki\/NoSQL"},{"key":"e_1_2_1_33_1","unstructured":"\"Xbox LIVE. http:\/\/www.xbox.com\/live \"Xbox LIVE. http:\/\/www.xbox.com\/live"},{"key":"e_1_2_1_34_1","volume-title":"SIGMOD 2013: 1243-1254","author":"Diaconu C.","unstructured":"C. Diaconu , C. Freedman , P.-\u00c5. Larson, P. Mittal , R. Stonecipher , N. Verma , and M. Zwilling . Hekaton: SQL Server's Memory-Optimized OLTP Engine . SIGMOD 2013: 1243-1254 . C. Diaconu, C. Freedman, P.-\u00c5. Larson, P. Mittal, R. Stonecipher, N. Verma, and M. Zwilling. Hekaton: SQL Server's Memory-Optimized OLTP Engine. SIGMOD 2013: 1243-1254."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2536206.2536215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T00:02:26Z","timestamp":1716854546000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2536206.2536215"}},"subtitle":["a cache\/storage subsystem for modern hardware"],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":34,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2013,8,26]]}},"alternative-id":["10.14778\/2536206.2536215"],"URL":"https:\/\/doi.org\/10.14778\/2536206.2536215","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}