{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T16:25:04Z","timestamp":1776356704515,"version":"3.51.2"},"reference-count":36,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8932,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,2]]},"DOI":"10.1016\/0022-0000(89)90034-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"86-124","source":"Crossref","is-referenced-by-count":397,"title":["Making data structures persistent"],"prefix":"10.1016","volume":"38","author":[{"given":"James R.","family":"Driscoll","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil","family":"Sarnak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel D.","family":"Sleator","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90034-2_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization of large ordered indexes","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(89)90034-2_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","article-title":"Decomposable searching problems 1: Static-to-dynamic transformations","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(89)90034-2_BIB3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(80)90018-3","article-title":"On the average number of rebalancing operations in weight-balanced trees","volume":"11","author":"Blum","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(89)90034-2_BIB4","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0209045","article-title":"Design and analysis of a data structure for representing sorted lists","volume":"9","author":"Brown","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90034-2_BIB5","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","article-title":"Filtering search: A new approach to query-answering","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90034-2_BIB6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0019-9958(85)80045-0","article-title":"How to search in history","volume":"77","author":"Chazelle","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(89)90034-2_BIB7","series-title":"Automata, Languages, and Programming, 12th Colloquium","first-page":"90","article-title":"Fractional cascading: A data structuring technique with geometric applications (extended abstract)","volume":"Vol. 194","author":"Chazelle","year":"1985"},{"key":"10.1016\/0022-0000(89)90034-2_BIB8","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01840440","article-title":"Fractional cascading I: A data structuring technique","volume":"1","author":"Chazelle","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0022-0000(89)90034-2_BIB9","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0196-6774(86)90004-0","article-title":"Searching and storing similar lists","volume":"7","author":"Cole","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(89)90034-2_BIB10","series-title":"Proceedings, 14th Annual ACM Symp. on Theory of Computing","first-page":"62","article-title":"Maintaining order in a linked list","author":"Dietz","year":"1982"},{"key":"10.1016\/0022-0000(89)90034-2_BIB11","series-title":"Proceedings, 19th Annual ACM Symp. on Theory of Computing","first-page":"365","article-title":"Two algorithms for maintaining order in a list","author":"Dietz","year":"1987"},{"key":"10.1016\/0022-0000(89)90034-2_BIB12","series-title":"Proceedings, 21 st Annual IEEE Symp. on Foundations of Computer Science","first-page":"200","article-title":"Efficient uses of the past","author":"Dobkin","year":"1980"},{"key":"10.1016\/0022-0000(89)90034-2_BIB13","series-title":"Proceedings, 19th Annual IEEE Symp. on Foundations of Computer Science","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"key":"10.1016\/0022-0000(89)90034-2_BIB14","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0020-0190(81)90030-2","article-title":"Real-time queue operations in pure LISP","volume":"13","author":"Hood","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(89)90034-2_BIB15","series-title":"Theoretical Computer Science VII","first-page":"234","article-title":"Robust balancing in B-trees","volume":"Vol. 104","author":"Huddleston","year":"1981"},{"key":"10.1016\/0022-0000(89)90034-2_BIB16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00288968","article-title":"A new data structure for representing sorted lists","volume":"17","author":"Huddlfston","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(89)90034-2_BIB17","series-title":"An Efficient Scheme for Fast Local Updates in Linear Lists","author":"Huddleston","year":"1981"},{"key":"10.1016\/0022-0000(89)90034-2_BIB18","series-title":"Proceedings, 13th Annual ACM Symp. on Theory of Computing","first-page":"62","article-title":"Localized search in sorted lists","author":"Kosaraju","year":"1981"},{"key":"10.1016\/0022-0000(89)90034-2_BIB19","series-title":"Making B-Trees Work for B","author":"Krijnen","year":"1983"},{"key":"10.1016\/0022-0000(89)90034-2_BIB20","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(81)90101-0","article-title":"Hysterical B-trees","volume":"12","author":"Maier","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(89)90034-2_BIB21","series-title":"AVL Dags","author":"Myers","year":"1982"},{"key":"10.1016\/0022-0000(89)90034-2_BIB22","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(83)90106-0","article-title":"An applicative random-access stack","volume":"17","author":"Myers","year":"1983","journal-title":"Inform. Process. Left."},{"key":"10.1016\/0022-0000(89)90034-2_BIB23","series-title":"Conf. Record Eleventh Annual ACM Symp. on Principles of Programming Languages","first-page":"66","article-title":"Efficient applicative data types","author":"Myers","year":"1984"},{"key":"10.1016\/0022-0000(89)90034-2_BIB24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","article-title":"Binary search trees of bounded balance","volume":"2","author":"Nievergelt","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90034-2_BIB25","unstructured":"M. H. Overmars, Searching in the past, I, Inform. and Computation, in press."},{"key":"10.1016\/0022-0000(89)90034-2_BIB26","series-title":"Technical Report RUU-CS-81-9","article-title":"Searching in the Past II: General Transforms","author":"Overmars","year":"1981"},{"key":"10.1016\/0022-0000(89)90034-2_BIB27","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1145\/2166.357218","article-title":"Incremental context-dependent analysis for language-based editors","volume":"5","author":"Reps","year":"1983","journal-title":"ACM Trans. Program. System. Lang."},{"key":"10.1016\/0022-0000(89)90034-2_BIB28","article-title":"Persistent Data Structures","author":"Sarnak","year":"1986"},{"key":"10.1016\/0022-0000(89)90034-2_BIB29","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","article-title":"Planar point location using persistent search trees","volume":"29","author":"Sarnak","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(89)90034-2_BIB30","series-title":"Technical Report 85-01-02","article-title":"Efficient Algorithms for Computing Geometric Intersections","author":"Swart","year":"1985"},{"key":"10.1016\/0022-0000(89)90034-2_BIB31","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0022-0000(89)90034-2_BIB32","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0020-0190(83)90099-6","article-title":"Updating a balanced search tree in O(1) rotations","volume":"16","author":"Tarjan","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(89)90034-2_BIB33","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","article-title":"Amortized computational complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0022-0000(89)90034-2_BIB34","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00289142","article-title":"Maintaining order in a generalized linked list","volume":"21","author":"Tsakalidis","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(89)90034-2_BIB35","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0019-9958(85)80034-6","article-title":"AVL-trees for localized search","volume":"67","author":"Tsakalidis","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(89)90034-2_BIB36","series-title":"An Optimal Implementation for Localized Search","author":"Tsakalidis","year":"1984"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900342?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900342?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:54:39Z","timestamp":1550325279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0022000089900342"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90034-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}