{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T21:55:28Z","timestamp":1777154128741,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:00:00Z","timestamp":1181347200000},"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":[[2007,6,9]]},"DOI":"10.1145\/1248377.1248393","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"81-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":78,"title":["Cache-oblivious streaming B-trees"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Farach-Colton","sequence":"additional","affiliation":[{"name":"Rutgers University, Piscataway, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonatan R.","family":"Fogel","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bradley C.","family":"Kuszmaul","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jelani","family":"Nelson","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,9]]},"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","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509950"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970240481X"},{"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.5555\/647912.740801"},{"key":"e_1_3_2_1_6_1","first-page":"399","volume-title":"41st Annual Symp. on Foundations of Computer Science (FOCS)","author":"Bender M. A.","year":"2000","unstructured":"M. A. Bender , E. D. Demaine , and M. Farach-Colton . Cache-oblivious B-trees. SIAM J. Comput., 35(2):341--358, 2005. An earlier version of this paper appeared in Proc . 41st Annual Symp. on Foundations of Computer Science (FOCS) , pages 399 -- 409 , Redondo Beach, California , 2000 . M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. SIAM J. Comput., 35(2):341--358, 2005. An earlier version of this paper appeared in Proc. 41st Annual Symp. on Foundations of Computer Science (FOCS), pages 399--409, Redondo Beach, California, 2000."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.014"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142385"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90015-2"},{"key":"e_1_3_2_1_10_1","first-page":"546","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Brodal G. S.","year":"2003","unstructured":"G. S. Brodal and R. Fagerberg . Lower bounds for external memory dictionaries . In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 546 -- 554 , Baltimore, Maryland , May 2003 . G. S. Brodal and R. Fagerberg. Lower bounds for external memory dictionaries. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 546--554, Baltimore, Maryland, May 2003."},{"key":"e_1_3_2_1_11_1","first-page":"39","volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Brodal G. S.","year":"2002","unstructured":"G. S. Brodal , R. Fagerberg , and R. Jacob . Cache oblivious search trees via binary trees of small height . In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 39 -- 48 , San Francisco, California , Jan. 2002 . G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 39--48, San Francisco, California, Jan. 2002."},{"key":"e_1_3_2_1_12_1","first-page":"859","volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Buchsbaum A. L.","year":"2000","unstructured":"A. L. Buchsbaum , M. Goldwasser , S. Venkatasubramanian , and J. R. Westbrook . On external memory graph traversal . In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 859 -- 860 , San Francisco, California , Jan. 2000 . A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. R. Westbrook. On external memory graph traversal. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 859--860, San Francisco, California, Jan. 2000."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840440"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796479"},{"key":"e_1_3_2_1_16_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_17_1","unstructured":"D. E.\n      Knuth\n      . \n      Sorting\n       and \n      Searching volume \n  3\n   of \n  The Art of Computer Programming\n  . \n  Addison-Wesley Reading Massachusetts 1973\n  .  D. E. Knuth. Sorting and Searching volume 3 of The Art of Computer Programming. Addison-Wesley Reading Massachusetts 1973."},{"key":"e_1_3_2_1_18_1","first-page":"367","volume-title":"Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Munro J. I.","year":"1992","unstructured":"J. I. Munro , T. Papadakis , and R. Sedgewick . Deterministic skip lists . In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 367 -- 375 , Orlando, Florida , January 1992 . J. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic skip lists. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 367--375, Orlando, Florida, January 1992."},{"key":"e_1_3_2_1_19_1","volume-title":"The Design of Dynamic Data Structures","author":"Overmars M. H.","year":"1983","unstructured":"M. H. Overmars . The Design of Dynamic Data Structures . Springer , 1983 . M. H. Overmars. The Design of Dynamic Data Structures. Springer, 1983."},{"key":"e_1_3_2_1_20_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_21_1","unstructured":"Sleepycat Software. The Berkeley Database. http:\/\/www.sleepycat.com 2005.  Sleepycat Software. The Berkeley Database. http:\/\/www.sleepycat.com 2005."}],"event":{"name":"SPAA07: 19th ACM Symposium on Parallelism in Algorithms and Architectures","location":"San Diego California USA","acronym":"SPAA07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1248377.1248393","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1248377.1248393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:25Z","timestamp":1750258285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1248377.1248393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,9]]},"references-count":21,"alternative-id":["10.1145\/1248377.1248393","10.1145\/1248377"],"URL":"https:\/\/doi.org\/10.1145\/1248377.1248393","relation":{},"subject":[],"published":{"date-parts":[[2007,6,9]]},"assertion":[{"value":"2007-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}