{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:57:10Z","timestamp":1725566230480},"publisher-location":"Dordrecht","reference-count":8,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789048197934"},{"type":"electronic","value":"9789048197941"}],"license":[{"start":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T00:00:00Z","timestamp":1282089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T00:00:00Z","timestamp":1282089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-90-481-9794-1_1","type":"book-chapter","created":{"date-parts":[[2010,9,17]],"date-time":"2010-09-17T21:21:08Z","timestamp":1284758468000},"page":"3-6","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partially Persistent B-trees with Constant Worst Case Update Time"],"prefix":"10.1007","author":[{"given":"George","family":"Lagogiannis","sequence":"first","affiliation":[]},{"given":"Nikos","family":"Lorentzos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,18]]},"reference":[{"key":"1_CR1_1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s007780050028","volume":"5","author":"B. Becker","year":"1996","unstructured":"Becker B., Gschwind S., Ohler T., Seeger B., Widmayer P.: An asymptotically optimal multiversion B-tree. The VLDB Journal. 5, 264\u2013275 (1996).","journal-title":"The VLDB Journal."},{"issue":"3","key":"1_CR2_1","first-page":"238","volume":"3","author":"G.S. Brodal","year":"1996","unstructured":"Brodal G.S.: Partially Persistent Data Structures of Bounded Degree with Constant Update Time. Nordic Journal of Computing, Vol. 3, No. 3, 238\u2013255 (1996).","journal-title":"Nordic Journal of Computing"},{"key":"1_CR3_1","volume-title":": A programming and problem-solving seminar","author":"M. J. Clancy","year":"1977","unstructured":"Clancy M. J. and. Knuth D. E.: A programming and problem-solving seminar. Technical Report STAN- CS-77-606, Department of Computer Science, Stanford University, Palo Alto (1977)."},{"key":"1_CR4_1","unstructured":"Dietz P. And Raman R.: Persistence, amortization and randomization. In: 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), 78\u201388, (1991)."},{"key":"1_CR5_1","first-page":"86","volume":"38","author":"R. Driscoll","year":"1989","unstructured":"Driscoll R., Sarnak N., Sleator D. and Tarjan R.E.: Making Data Structures Persistent. JCSS, 38, 86\u2013124 (1989).","journal-title":"JCSS"},{"key":"1_CR6_1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1142\/S0129054196000117","volume":"7","author":"R. Fleischer","year":"1996","unstructured":"Fleischer R.: A simple balanced search tree with O(1) worst-case update time. International Journal of Foundations of Computer Science. 7, 137\u2013149 (1996).","journal-title":"International Journal of Foundations of Computer Science."},{"key":"1_CR7_1","volume-title":"New heap data structures.","author":"H Kaplan","year":"1999","unstructured":"Kaplan H. and Tarjan R. E.: New heap data structures. Technical Report TR-597-99, Princeton University (1999)."},{"key":"1_CR8_1","unstructured":"Lagogiannis G., Lorentzos N.: Partially Persistent B-trees with Constant Worst Case Update Time. TR-184, Informatics Laboratory, Department of Science, Agricultural University of Athens (http:\/\/infolab.aua.gr\/people.php?lang=en&id=14)."}],"container-title":["Lecture Notes in Electrical Engineering","Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-90-481-9794-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T15:48:03Z","timestamp":1676648883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-90-481-9794-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,18]]},"ISBN":["9789048197934","9789048197941"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-90-481-9794-1_1","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2010,8,18]]},"assertion":[{"value":"18 August 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}