{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:31:01Z","timestamp":1743064261993,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":18,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_57","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:36:37Z","timestamp":1214505397000},"page":"108-112","source":"Crossref","is-referenced-by-count":0,"title":["B-trees"],"prefix":"10.1007","author":[{"given":"Jan","family":"Vahrenhold","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1_57","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31, 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"57_CR2_57","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4615-0005-6_9","volume-title":"Handbook of Massive Data Sets","author":"L.A. Arge","year":"2002","unstructured":"Arge, L.A.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets, pp.\u00a0313\u2013357. Kluwer, Dordrecht (2002)"},{"key":"57_CR3_57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-003-1021-x","volume":"37","author":"L.A. Arge","year":"2003","unstructured":"Arge, L.A.: The Buffer Tree: A\u00a0technique for designing batched external data structures. Algorithmica 37, 1\u201324 (2003)","journal-title":"Algorithmica"},{"key":"57_CR4_57","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00453-001-0107-6","volume":"33","author":"L.A. Arge","year":"2002","unstructured":"Arge, L.A., Hinrichs, K.H., Vahrenhold, J., Vitter, J.S.: Efficient bulk operations on dynamic R-trees. Algorithmica 33, 104\u2013128 (2002)","journal-title":"Algorithmica"},{"key":"57_CR5_57","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1137\/S009753970240481X","volume":"32","author":"L.A. Arge","year":"2003","unstructured":"Arge, L.A., Vitter, J.S.: Optimal external interval management. SIAM J. Comput. 32, 1488\u20131508 (2003)","journal-title":"SIAM J. Comput."},{"key":"57_CR6_57","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. Acta Inform. 1, 173\u2013189 (1972)","journal-title":"Acta Inform."},{"key":"57_CR7_57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R. Bayer","year":"1977","unstructured":"Bayer, R., Schkolnick, M.: Concurrency of operations on B-trees. Acta Inform. 9, 1\u201321 (1977)","journal-title":"Acta Inform."},{"key":"57_CR8_57","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s007780050028","volume":"5","author":"B. Becker","year":"1996","unstructured":"Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: An asymptotically optimal multiversion B-tree. VLDB J. 5, 264\u2013275 (1996)","journal-title":"VLDB J."},{"key":"57_CR9_57","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D.E. Comer","year":"1979","unstructured":"Comer, D.E.: The ubiquitous B-tree. ACM Comput. Surv. 11, 121\u2013137 (1979)","journal-title":"ACM Comput. Surv."},{"key":"57_CR10_57","series-title":"The MIT Electrical Engineering and Computer Science Series","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"57_CR11_57","volume-title":"Fundamentals of Database Systems","author":"R. Elmasri","year":"2007","unstructured":"Elmasri, R., Navanthe, S.B.: Fundamentals of Database Systems, 5th edn. Addison-Wesley, Boston (2007)","edition":"5"},{"key":"57_CR12_57","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1121995.1122002","volume":"35","author":"G. Graefe","year":"2006","unstructured":"Graefe, G.: B-tree indexes for high update rates. SIGMOD RECORD 35, 39\u201344 (2006)","journal-title":"SIGMOD RECORD"},{"key":"57_CR13_57","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00288968","volume":"17","author":"S. Huddleston","year":"1982","unstructured":"Huddleston, S., Mehlhorn, K.: A\u00a0new data structure for representing sorted lists. Acta Inform. 17, 157\u2013184 (1982)","journal-title":"Acta Inform."},{"key":"57_CR14_57","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0020-0190(02)00228-4","volume":"84","author":"L. Jacobsen","year":"2002","unstructured":"Jacobsen, L., Larsen, K.S., Nielsen, M.N.: On the existence of non-extreme (a,\u202fb)-trees. Inform. Process. Lett. 84, 69\u201373 (2002)","journal-title":"Inform. Process. Lett."},{"key":"57_CR15_57","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/202660.202666","volume":"24","author":"J. Jannink","year":"1995","unstructured":"Jannink, J.: Implementing deletions in $$ { {B}^+ } $$-trees. SIGMOD RECORD 24, 33\u201338 (1995)","journal-title":"SIGMOD RECORD"},{"key":"57_CR16_57","volume-title":"Sorting and Searching. The Art of Computer Programming, vol. 3","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Sorting and Searching. The Art of Computer Programming, vol.\u00a03, 2nd edn. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"57_CR17_57","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science, vol. 1","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science, vol.\u00a01. Springer, Berlin (1984)"},{"key":"57_CR18_57","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00289075","volume":"9","author":"A.C.-C. Yao","year":"1978","unstructured":"Yao, A.C.-C.: On random 2\u20133 trees. Acta Inform. 9, 159\u2013170 (1978)","journal-title":"Acta Inform."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:03:51Z","timestamp":1662170631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_57"}},"subtitle":["1972; Bayer, McCreight"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_57","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}