{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T00:02:23Z","timestamp":1746316943557},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,7,18]]},"DOI":"10.1145\/1073970.1074009","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Concurrent cache-oblivious b-trees"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[{"name":"SUNY Stony Brook, Stony Brook, NY"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA"}]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA"}]},{"given":"Bradley C.","family":"Kuszmaul","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA"}]}],"member":"320","published-online":{"date-parts":[[2005,7,18]]},"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.5555\/874062.875514"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335344"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875488"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946311"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684398"},{"key":"e_1_3_2_1_8_1","first-page":"399","volume-title":"M. Farach-Colton. Cache-oblivious B-trees. In FOCS'2000","author":"Bender M. A.","year":"2000","unstructured":"M. A. Bender , E. Demaine , M. Farach-Colton. Cache-oblivious B-trees. In FOCS'2000 , pp. 399 -- 409 , 2000 .]] M. A. Bender, E. Demaine, M. Farach-Colton. Cache-oblivious B-trees. In FOCS'2000, pp. 399--409, 2000.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701389956"},{"key":"e_1_3_2_1_10_1","first-page":"29","volume-title":"SODA 2002","author":"Bender M. A.","year":"2002","unstructured":"M. A. Bender , Z. Duan , J. Iacono , J. Wu . A locality-preserving cache-oblivious dynamic dictionary . In SODA 2002 , pp. 29 -- 38 , 2002 .]] M. A. Bender, Z. Duan, J. Iacono, J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In SODA 2002, pp. 29--38, 2002.]]"},{"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","volume-title":"Manuscript.","author":"Bender M. A.","year":"2005","unstructured":"M. A. Bender , M. Farach-Colton , B. C. Kuszmaul , J. Sukha . Cache-oblivious b-trees for optimizing disk performance . Manuscript. , 2005 .]] M. A. Bender, M. Farach-Colton, B. C. Kuszmaul, J. Sukha. Cache-oblivious b-trees for optimizing disk performance. Manuscript., 2005.]]"},{"key":"e_1_3_2_1_13_1","first-page":"39","volume-title":"SODA 2002","author":"Brodal G. S.","year":"2002","unstructured":"G. S. Brodal , R. Fagerberg , R. Jacob . Cache oblivious search trees via binary trees of small height . In SODA 2002 , pp. 39 -- 48 , 2002 .]] G. S. Brodal, R. Fagerberg, R. Jacob. Cache oblivious search trees via binary trees of small height. In SODA 2002, pp. 39--48, 2002.]]"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"A.\n      Itai A. G.\n      Konheim M.\n      Rodeh\n    .\n  A sparse table implementation of priority queues\n  . In S. Even O. Kariv editors ICALP\n  '81 vol. \n  115\n   of \n  LNCS pp. \n  417\n  --\n  431 1981\n  .]]   A. Itai A. G. Konheim M. Rodeh. A sparse table implementation of priority queues. In S. Even O. Kariv editors ICALP'81 vol. 115 of LNCS pp. 417--431 1981.]]","DOI":"10.1007\/3-540-10843-2_34"},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","volume-title":"DISC'98","author":"Jayanti P.","year":"1998","unstructured":"P. Jayanti . A complete and constant time wait-free implementation of CAS from LL\/SC and vice versa . In DISC'98 , vol. 1499 of LNCS , 1998 .]] P. Jayanti. A complete and constant time wait-free implementation of CAS from LL\/SC and vice versa. In DISC'98, vol. 1499 of LNCS, 1998.]]"},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/3-540-36383-1_4","volume-title":"Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software","author":"Ladner R. E.","year":"2002","unstructured":"R. E. Ladner , R. Fortna , B.-H. Nguyen . A comparison of cache aware and cache oblivious static search trees using program instrumentation . In Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software , vol. 2547 of LNCS , pp. 78 -- 92 , 2002 .]] R. E. Ladner, R. Fortna, B.-H. Nguyen. A comparison of cache aware and cache oblivious static search trees using program instrumentation. In Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software, vol. 2547 of LNCS, pp. 78--92, 2002.]]"},{"key":"e_1_3_2_1_22_1","unstructured":"N. Lynch. Distributed Algorithms. Morgan Kaufmann 1996.]]   N. Lynch. Distributed Algorithms. Morgan Kaufmann 1996.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching, theorem 5","author":"Mehlhorn K.","year":"1984","unstructured":"K. Mehlhorn . Data Structures and Algorithms 1: Sorting and Searching, theorem 5 , pp. 198 -- 199 . Springer-Verlag , 1984 .]] K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching, theorem 5, pp. 198--199. Springer-Verlag, 1984.]]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30186-8_11"},{"key":"e_1_3_2_1_25_1","first-page":"367","volume-title":"SODA'92","author":"Munro J. I.","year":"1992","unstructured":"J. I. Munro , T. Papadakis , R. Sedgewick . Deterministic skip lists . In SODA'92 , pp. 367 -- 375 , 1992 .]] J. I. Munro, T. Papadakis, R. Sedgewick. Deterministic skip lists. In SODA'92, pp. 367--375, 1992.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/647258.720797"}],"event":{"name":"SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005","location":"Las Vegas Nevada USA","acronym":"SPAA05","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 seventeenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073970.1074009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T02:25:36Z","timestamp":1673144736000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073970.1074009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,18]]},"references-count":24,"alternative-id":["10.1145\/1073970.1074009","10.1145\/1073970"],"URL":"https:\/\/doi.org\/10.1145\/1073970.1074009","relation":{},"subject":[],"published":{"date-parts":[[2005,7,18]]},"assertion":[{"value":"2005-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}