{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T23:08:04Z","timestamp":1719270484868},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,5]]},"abstract":"<jats:p>Data management systems have traditionally been designed to support either long-running analytics queries or short-lived transactions, but an increasing number of applications need both. For example, online games, socio-mobile apps, and e-commerce sites need to not only maintain operational state, but also analyze that data quickly to make predictions and recommendations that improve user experience. In this paper, we present Minuet, a distributed, main-memory B-tree that supports both transactions and copy-on-write snapshots for in-situ analytics. Minuet uses main-memory storage to enable low-latency transactional operations as well as analytics queries without compromising transaction performance. In addition to supporting read-only analytics queries on snapshots, Minuet supports writable clones, so that users can create branching versions of the data. This feature can be quite useful, e.g. to support complex \"what-if\" analysis or to facilitate wide-area replication. Our experiments show that Minuet outperforms a commercial main-memory database in many ways. It scales to hundreds of cores and TBs of memory, and can process hundreds of thousands of B-tree operations per second while executing long-running scans.<\/jats:p>","DOI":"10.14778\/2311906.2311915","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"884-895","source":"Crossref","is-referenced-by-count":21,"title":["Minuet"],"prefix":"10.14778","volume":"5","author":[{"given":"Benjamin","family":"Sowell","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Golab","sequence":"additional","affiliation":[{"name":"Hewlett-Packard Labs, Palo Alto, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehul A.","family":"Shah","sequence":"additional","affiliation":[{"name":"Nou Data, Palo Alto, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,5]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"CouchDB. http:\/\/couchdb.apache.org\/.  CouchDB. http:\/\/couchdb.apache.org\/."},{"key":"e_1_2_1_2_1","unstructured":"HBase. http:\/\/hbase.apache.org\/.  HBase. http:\/\/hbase.apache.org\/."},{"key":"e_1_2_1_3_1","unstructured":"LevelDB. http:\/\/code.google.com\/p\/leveldb\/.  LevelDB. http:\/\/code.google.com\/p\/leveldb\/."},{"key":"e_1_2_1_4_1","unstructured":"VoltDB. http:\/\/voltdb.com\/.  VoltDB. http:\/\/voltdb.com\/."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453922"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629087.1629088"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050028"},{"key":"e_1_2_1_8_1","first-page":"9","volume-title":"Proc. CIDR","author":"Bernstein P. A.","year":"2011","unstructured":"P. A. Bernstein , C. W. Reid , and S. Das . Hyder - a transactional record manager for shared flash . In Proc. CIDR , pages 9 -- 20 , 2011 . P. A. Bernstein, C. W. Reid, and S. Das. Hyder - a transactional record manager for shared flash. In Proc. CIDR, pages 9--20, 2011."},{"key":"e_1_2_1_9_1","volume-title":"The Zettabyte file system","author":"Bonwick J.","year":"2008","unstructured":"J. Bonwick and M. Ahrens . The Zettabyte file system . 2008 . J. Bonwick and M. Ahrens. The Zettabyte file system. 2008."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767881"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_2_1_12_1","first-page":"43","volume-title":"Proc. USENIX ATC","author":"Chutani S.","year":"1992","unstructured":"S. Chutani , O. T. Anderson , M. L. Kazar , B. W. Leverett , W. A. Mason , and R. N. Sidebotham . The Episode file system . In Proc. USENIX ATC , pages 43 -- 60 , 1992 . S. Chutani, O. T. Anderson, M. L. Kazar, B. W. Leverett, W. A. Mason, and R. N. Sidebotham. The Episode file system. In Proc. USENIX ATC, pages 43--60, 1992."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454167"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247507"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90034-2"},{"key":"e_1_2_1_17_1","first-page":"672","volume-title":"Write-optimized B-trees. In Proc. VLDB","author":"Graefe G.","year":"2004","unstructured":"G. Graefe . Write-optimized B-trees. In Proc. VLDB , pages 672 -- 683 , 2004 . G. Graefe. Write-optimized B-trees. In Proc. VLDB, pages 672--683, 2004."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806908"},{"key":"e_1_2_1_19_1","first-page":"27","volume-title":"Proc. BTW","author":"Graefe G.","year":"2009","unstructured":"G. Graefe and R. Stonecipher . Efficient verification of B-tree integrity . In Proc. BTW , pages 27 -- 46 , 2009 . G. Graefe and R. Stonecipher. Efficient verification of B-tree integrity. In Proc. BTW, pages 27--46, 2009."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(84)90020-6"},{"key":"e_1_2_1_21_1","first-page":"235","volume-title":"USENIX Winter","author":"Hitz D.","year":"1994","unstructured":"D. Hitz , J. Lau , and M. A. Malcolm . File system design for an NFS file server appliance . In USENIX Winter , pages 235 -- 246 , 1994 . D. Hitz, J. Lau, and M. A. Malcolm. File system design for an NFS file server appliance. In USENIX Winter, pages 235--246, 1994."},{"key":"e_1_2_1_22_1","first-page":"661","volume-title":"Proc. VLDB","author":"Jagadish H. V.","year":"2005","unstructured":"H. V. Jagadish , B. C. Ooi , and Q. H. Vu . BATON: A balanced tree structure for peer-to-peer networks . In Proc. VLDB , pages 661 -- 672 , 2005 . H. V. Jagadish, B. C. Ooi, and Q. H. Vu. BATON: A balanced tree structure for peer-to-peer networks. In Proc. VLDB, pages 661--672, 2005."},{"key":"e_1_2_1_23_1","first-page":"451","volume-title":"Proc. VLDB","author":"Jiang L.","year":"2000","unstructured":"L. Jiang , B. Salzberg , D. B. Lomet , and M. B. Garc\u00eda . The BT-tree: A branched and temporal access method . In Proc. VLDB , pages 451 -- 460 , 2000 . L. Jiang, B. Salzberg, D. B. Lomet, and M. B. Garc\u00eda. The BT-tree: A branched and temporal access method. In Proc. VLDB, pages 451--460, 2000."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1992.223026"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767867"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01354880"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115861"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319663"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66956"},{"key":"e_1_2_1_30_1","first-page":"105","volume-title":"Proc. OSDI","author":"MacCormick J.","year":"2004","unstructured":"J. MacCormick , N. Murphy , M. Najork , C. Thekkath , and L. Zhou . Boxwood: Abstractions as the foundation for storage infrastructure . In Proc. OSDI , pages 105 -- 120 , Dec. 2004 . J. MacCormick, N. Murphy, M. Najork, C. Thekkath, and L. Zhou. Boxwood: Abstractions as the foundation for storage infrastructure. In Proc. OSDI, pages 105--120, Dec. 2004."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050004"},{"key":"e_1_2_1_32_1","volume-title":"Proc. LADIS","author":"Najaran M. T.","year":"2011","unstructured":"M. T. Najaran , P. Wijesekera , A. Warfield , and N. C. Hutchinson . Distributed indexing and locking: In search of scalable consistency . In Proc. LADIS , 2011 . M. T. Najaran, P. Wijesekera, A. Warfield, and N. C. Hutchinson. Distributed indexing and locking: In search of scalable consistency. In Proc. LADIS, 2011."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"key":"e_1_2_1_35_1","unstructured":"D. Reed. Naming and synchronization in a decentralized computer system 1978.  D. Reed. Naming and synchronization in a decentralized computer system 1978."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1326542.1326544"},{"key":"e_1_2_1_37_1","first-page":"43","volume-title":"Proc. FAST","author":"Soules C. A. N.","year":"2003","unstructured":"C. A. N. Soules , G. R. Goodson , J. D. Strunk , and G. R. Ganger . Metadata efficiency in versioning file systems . In Proc. FAST , pages 43 -- 58 , 2003 . C. A. N. Soules, G. R. Goodson, J. D. Strunk, and G. R. Ganger. Metadata efficiency in versioning file systems. In Proc. FAST, pages 43--58, 2003."},{"key":"e_1_2_1_38_1","first-page":"1150","volume-title":"Proc. VLDB","author":"Stonebraker M.","year":"2007","unstructured":"M. Stonebraker , S. Madden , D. J. Abadi , S. Harizopoulos , N. Hachem , and P. Helland . The end of an architectural era (it's time for a complete rewrite) . In Proc. VLDB , pages 1150 -- 1160 , 2007 . M. Stonebraker, S. Madden, D. J. Abadi, S. Harizopoulos, N. Hachem, and P. Helland. The end of an architectural era (it's time for a complete rewrite). In Proc. VLDB, pages 1150--1160, 2007."},{"key":"e_1_2_1_39_1","volume-title":"Stratified B-trees and versioning dictionaries. CoRR, abs\/1103.4282","author":"Twigg A.","year":"2011","unstructured":"A. Twigg , A. Byde , G. Milos , T. D. Moreton , J. Wilkes , and T. Wilkie . Stratified B-trees and versioning dictionaries. CoRR, abs\/1103.4282 , 2011 . A. Twigg, A. Byde, G. Milos, T. D. Moreton, J. Wilkes, and T. Wilkie. Stratified B-trees and versioning dictionaries. CoRR, abs\/1103.4282, 2011."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920907"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920991"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2311906.2311915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:29:44Z","timestamp":1672223384000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2311906.2311915"}},"subtitle":["a scalable distributed multiversion B-tree"],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":41,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["10.14778\/2311906.2311915"],"URL":"https:\/\/doi.org\/10.14778\/2311906.2311915","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}