{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:58Z","timestamp":1750308118641,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,14]],"date-time":"2005-06-14T00:00:00Z","timestamp":1118707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,14]]},"DOI":"10.1145\/1066157.1066196","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"335-346","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Online B-tree merging"],"prefix":"10.1145","author":[{"given":"Xiaowei","family":"Sun","sequence":"first","affiliation":[{"name":"Northeastern University"}]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University"}]},{"given":"Betty","family":"Salzberg","sequence":"additional","affiliation":[{"name":"Northeastern University"}]},{"given":"Chendong","family":"Zou","sequence":"additional","affiliation":[{"name":"IBM"}]}],"member":"320","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233326"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263762"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656532"},{"key":"e_1_3_2_1_5_1","volume-title":"Sorting And Indexing With Partitioned B-Trees. In Biennial Conference on Innovative Data System Research","author":"Graefe G.","year":"2003","unstructured":"G. Graefe . Sorting And Indexing With Partitioned B-Trees. In Biennial Conference on Innovative Data System Research , 2003 . G. Graefe. Sorting And Indexing With Partitioned B-Trees. In Biennial Conference on Innovative Data System Research, 2003."},{"key":"e_1_3_2_1_6_1","volume-title":"Morgan Kaufmann","author":"Gray J.","year":"1993","unstructured":"J. Gray and A. Reuter . Transaction Processing: Techniques and Concepts . Morgan Kaufmann , 1993 . J. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. Morgan Kaufmann, 1993."},{"key":"e_1_3_2_1_7_1","first-page":"16","volume-title":"Proc VLDB Conference","author":"Jagadish H. V.","year":"1997","unstructured":"H. V. Jagadish , P. P. S. Narayan , S. Seshadri , S. Sudarshan , and R. Kanneganti . Incremental Organization for Data Recording and Warehousing . In Proc VLDB Conference , pages 16 -- 25 , 1997 . H. V. Jagadish, P. P. S. Narayan, S. Seshadri, S. Sudarshan, and R. Kanneganti. Incremental Organization for Data Recording and Warehousing. In Proc VLDB Conference, pages 16--25, 1997."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298580"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335416"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319663"},{"key":"e_1_3_2_1_11_1","first-page":"18","volume-title":"Robust and Highly Concurrent B-trees with Node Deletion. In Proc IEEE ICDE Conference","author":"Lomet D.","year":"2004","unstructured":"D. Lomet . Simple , Robust and Highly Concurrent B-trees with Node Deletion. In Proc IEEE ICDE Conference , pages 18 -- 28 , 2004 . D. Lomet. Simple, Robust and Highly Concurrent B-trees with Node Deletion. In Proc IEEE ICDE Conference, pages 18--28, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/130283.130336"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050042"},{"key":"e_1_3_2_1_14_1","first-page":"392","volume-title":"ARIES\/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. In Proc VLDB Conference","author":"Mohan C.","year":"1990","unstructured":"C. Mohan . ARIES\/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. In Proc VLDB Conference , pages 392 -- 405 , 1990 . C. Mohan. ARIES\/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. In Proc VLDB Conference, pages 392--405, 1990."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/130283.130338"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/130283.130337"},{"key":"e_1_3_2_1_17_1","first-page":"452","volume-title":"Proc VLDB Conference","author":"Muth P.","year":"1998","unstructured":"P. Muth , P. E. O'Neil , A. Pick , and G. Weikum . Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method . In Proc VLDB Conference , pages 452 -- 463 , 1998 . P. Muth, P. E. O'Neil, A. Pick, and G. Weikum. Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method. In Proc VLDB Conference, pages 452--463, 1998."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335462"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc Winter Simulation Conference","author":"Schmetman H.","year":"2001","unstructured":"H. Schmetman . CSIM19 : A Powerful Tool for Building System Models . In Proc Winter Simulation Conference , 2001 . H. Schmetman. CSIM19: A Powerful Tool for Building System Models. In Proc Winter Simulation Conference, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263046"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233325"},{"key":"e_1_3_2_1_22_1","first-page":"512","volume-title":"Proc VLDB Conference","author":"Zou C.","year":"1998","unstructured":"C. Zou and B. Salzberg . Safely and Effi ciently Updating References During On-line Reorganization . In Proc VLDB Conference , pages 512 -- 522 , 1998 . C. Zou and B. Salzberg. Safely and Effi ciently Updating References During On-line Reorganization. In Proc VLDB Conference, pages 512--522, 1998."}],"event":{"name":"SIGMOD\/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Baltimore Maryland","acronym":"SIGMOD\/PODS05"},"container-title":["Proceedings of the 2005 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066196","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066157.1066196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:18Z","timestamp":1750262898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,14]]},"references-count":22,"alternative-id":["10.1145\/1066157.1066196","10.1145\/1066157"],"URL":"https:\/\/doi.org\/10.1145\/1066157.1066196","relation":{},"subject":[],"published":{"date-parts":[[2005,6,14]]},"assertion":[{"value":"2005-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}