{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:05Z","timestamp":1759638125119},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447765"},{"type":"electronic","value":"9783662447772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44777-2_25","type":"book-chapter","created":{"date-parts":[[2014,8,16]],"date-time":"2014-08-16T06:43:15Z","timestamp":1408171395000},"page":"296-308","source":"Crossref","is-referenced-by-count":1,"title":["Cache-Oblivious Persistence"],"prefix":"10.1007","author":[{"given":"Pooya","family":"Davoodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d6zg\u00fcr","family":"\u00d6zkan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","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 Indices. Acta Inf.\u00a01, 173\u2013189 (1972)","journal-title":"Acta Inf."},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-45465-9_18","volume-title":"Automata, Languages and Programming","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Cole, R., Raman, R.: Exponential Structures for Efficient Cache-Oblivious Algorithms. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 195. Springer, Heidelberg (2002)"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/S0097539701389956","volume":"35","author":"A. Michael","year":"2005","unstructured":"Michael, A., Bender, E.D.: Demaine, and Martin Farach-Colton. Cache-Oblivious B-Trees. SIAM J. Comput.\u00a035(2), 341\u2013358 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"25_CR4","first-page":"115","volume":"53","author":"A. Michael","year":"2004","unstructured":"Michael, A.: Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cache-oblivious dynamic dictionary\u00a053(2), 115\u2013136 (2004)","journal-title":"A locality-preserving cache-oblivious dynamic dictionary"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Tsakalidis, K., Sioutas, S., Tsichlas, K.: Fully persistent B-trees. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 602\u2013614 (2012)","DOI":"10.1137\/1.9781611973099.51"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Collette, S., Iacono, J., Langerman, S.: Confluent persistence revisited. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 593\u2013601 (2012)","DOI":"10.1137\/1.9781611973099.50"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Davoodi, P., Fineman, J.T., Iacono, J., \u00d6zkan, \u00d6.: Cache-oblivious persistence. CoRR, abs\/1402.5492 (2014)","DOI":"10.1007\/978-3-662-44777-2_25"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Iacono, J., Langerman, S.: Retroactive data structures. ACM Transactions on Algorithms\u00a03(2) (2007)","DOI":"10.1145\/1240233.1240236"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci.\u00a038(1), 86\u2013124 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/S0196-6774(03)00044-0","volume":"48","author":"A. Fiat","year":"2003","unstructured":"Fiat, A., Kaplan, H.: Making data structures confluently persistent. J. Algorithms\u00a048(1), 16\u201358 (2003)","journal-title":"J. Algorithms"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"M.L. Fredman","year":"1986","unstructured":"Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The Pairing Heap: A New Form of Self-Adjusting Heap. Algorithmica\u00a01(1), 111\u2013129 (1986)","journal-title":"Algorithmica"},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2071379.2071383","volume":"8","author":"M. Frigo","year":"2012","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. ACM Transactions on Algorithms\u00a08(1), 4 (2012)","journal-title":"ACM Transactions on Algorithms"},{"issue":"7","key":"25_CR13","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.E.: Planar Point Location Using Persistent Search Trees. Commun. ACM\u00a029(7), 669\u2013679 (1986)","journal-title":"Commun. ACM"},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-Adjusting Binary Search Trees. J. ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a Good But Not Linear Set Union Algorithm. J. ACM\u00a022(2), 215\u2013225 (1975)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44777-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:15:37Z","timestamp":1558959337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44777-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447765","9783662447772"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44777-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}