{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:18Z","timestamp":1763467758747,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T00:00:00Z","timestamp":1151280000000},"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":[[2006,6,26]]},"DOI":"10.1145\/1142351.1142385","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"233-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":50,"title":["Cache-oblivious string B-trees"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[{"name":"Stony Brook University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Farach-Colton","sequence":"additional","affiliation":[{"name":"Rutgers"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bradley C.","family":"Kuszmaul","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_2_1","volume-title":"Efficient tree layout in a multilevel memory hierarchy. arXiv:cs.DS\/0211010","author":"Alstrup S.","year":"2004","unstructured":"S. Alstrup , M. A. Bender , E. D. Demaine , M. Farach-Colton , T. Rauhe , and M. Thorup . Efficient tree layout in a multilevel memory hierarchy. arXiv:cs.DS\/0211010 , 2004 . http:\/\/www.arXiv.org\/pdf\/cs.DS\/0211010.]] S. Alstrup, M. A. Bender, E. D. Demaine, M. Farach-Colton, T. Rauhe, and M. Thorup. Efficient tree layout in a multilevel memory hierarchy. arXiv:cs.DS\/0211010, 2004. http:\/\/www.arXiv.org\/pdf\/cs.DS\/0211010.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647812.738140"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/320521.320530"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740822"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740801"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796541"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701389956"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545385"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.014"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109621"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545386"},{"issue":"11","key":"e_1_3_2_1_14_1","first-page":"1400","article-title":"Compressed indexing method","volume":"11","author":"Chang H. K.","year":"1969","unstructured":"H. K. Chang . Compressed indexing method . IBM Technical Disclosure Bulletin , 11 ( 11 ): 1400 -- 1401 , 1969 .]] H. K. Chang. Compressed indexing method. IBM Technical Disclosure Bulletin, 11(11):1400--1401, 1969.]]","journal-title":"IBM Technical Disclosure Bulletin"},{"key":"e_1_3_2_1_15_1","first-page":"593","article-title":"Method and means for generating compressed keys","volume":"3","author":"W. A.","year":"1969","unstructured":"W. A. Clark IV, K. A. Salmond , and T. A. Stafford . Method and means for generating compressed keys . US Patent 3 , 593 ,309, 3 Jan. 1969 .]] W. A. Clark IV, K. A. Salmond, and T. A. Stafford. Method and means for generating compressed keys. US Patent 3,593,309, 3 Jan. 1969.]]","journal-title":"US Patent"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_2_1_17_1","first-page":"n2","article-title":"Worst-case optimal tree layout in a memory hierarchy. Manuscript. arXiv","author":"Demaine E. D.","year":"2004","unstructured":"E. D. Demaine , J. Iacono , and S. Langerman . Worst-case optimal tree layout in a memory hierarchy. Manuscript. arXiv : DS\/0410048 , 2004 . http:\/\/joh n2 .poly.edu\/papers\/manu04\/paper.pdf.]] E. D. Demaine, J. Iacono, and S. Langerman. Worst-case optimal tree layout in a memory hierarchy. Manuscript. arXiv:DS\/0410048, 2004. http:\/\/john2.poly.edu\/papers\/manu04\/paper.pdf.]]","journal-title":"DS\/0410048"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28434"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/301970.301973"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90040-4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796479"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1014"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/646235.682700"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"e_1_3_2_1_25_1","volume-title":"Israel Inst. of Tech.","author":"Katriel I.","year":"2002","unstructured":"I. Katriel . Implicit data structures based on local reorganizations. Master's thesis, Technion , Israel Inst. of Tech. , Haifa , May 2002 .]] I. Katriel. Implicit data structures based on local reorganizations. Master's thesis, Technion, Israel Inst. of Tech., Haifa, May 2002.]]"},{"key":"e_1_3_2_1_26_1","unstructured":"D. E.\n      Knuth\n      . \n      Sorting\n       and \n      Searching vol. \n  3\n   of \n  The Art of Computer Programming\n  . \n  Addison-Wesley Reading Massachusetts 1973\n  .]]  D. E. Knuth. Sorting and Searching vol. 3 of The Art of Computer Programming. Addison-Wesley Reading Massachusetts 1973.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1923"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/646245.684538"},{"key":"e_1_3_2_1_29_1","volume-title":"Massachusetts Inst. of Tech.","author":"Prokop H.","year":"1999","unstructured":"H. Prokop . Cache-oblivious algorithms. Master's thesis, Department of Electrical Engineering and Computer Science , Massachusetts Inst. of Tech. , June 1999 .]] H. Prokop. Cache-oblivious algorithms. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Inst. of Tech., June 1999.]]"},{"key":"e_1_3_2_1_30_1","unstructured":"Sleepycat Software. The Berkeley Database. http:\/\/www.sleepycat.com 2005.]]  Sleepycat Software. The Berkeley Database. http:\/\/www.sleepycat.com 2005.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/258612.258689"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.124.0351"}],"event":{"name":"SIGMOD\/PODS06: International Conference on Management of Data and Symposium on Principles Database and Systems","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGAI ACM Special Interest Group on Artificial Intelligence","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"SIGMOD\/PODS06"},"container-title":["Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1142351.1142385","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1142351.1142385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:11Z","timestamp":1750259171000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1142351.1142385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,26]]},"references-count":32,"alternative-id":["10.1145\/1142351.1142385","10.1145\/1142351"],"URL":"https:\/\/doi.org\/10.1145\/1142351.1142385","relation":{},"subject":[],"published":{"date-parts":[[2006,6,26]]},"assertion":[{"value":"2006-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}