{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:13:19Z","timestamp":1725574399233},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405351"},{"type":"electronic","value":"9783540450726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45072-6_3","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T13:23:33Z","timestamp":1294493013000},"page":"28-45","source":"Crossref","is-referenced-by-count":1,"title":["The BTR-Tree: Path-Defined Version-Range Splitting in a Branched and Temporal Structure"],"prefix":"10.1007","author":[{"given":"Linan","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Betty","family":"Salzberg","sequence":"additional","affiliation":[]},{"given":"David","family":"Lomet","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Barrena","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-56869-7_8","volume-title":"Advances in Spatial Databases","author":"B. Becker","year":"1993","unstructured":"Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: On optimal multiversion access structures. In: Abel, D.J., Ooi, B.-C. (eds.) SSD 1993. LNCS, vol.\u00a0692, pp. 123\u2013141. Springer, Heidelberg (1993)"},{"key":"3_CR2","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. Journal of Computer and System Sciences\u00a038, 86\u2013124 (1989)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1147\/rd.303.0230","volume":"30","author":"M.C. Easton","year":"1986","unstructured":"Easton, M.C.: Key-sequence data sets on indelible storage. IBM J. Res. Development\u00a030(3), 230\u2013241 (1986)","journal-title":"IBM J. Res. Development"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Evangelidis, G., Lomet, D., Salzberg, B.: The hB-\u03a0-tree: A Multiattribute Index Supporting Concurrency, Recovery and Node Consolidation. VLDB Journal\u00a06(1) (1997)","DOI":"10.1007\/s007780050030"},{"key":"3_CR5","unstructured":"Jiang, L., Salzberg, B., Lomet, D., Barrena, M.: The BT-tree: A branched and temporal access method. In: International Conference on Very Large Data Bases, Cairo, Egypt, September 2000, pp. 451\u2013460 (2000)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/BF01354880","volume":"4","author":"G.M. Landau","year":"1995","unstructured":"Landau, G.M., Schmidt, J.P., Tsotras, V.J.: Historical queries along multiple lines of time evolution. VLDB Journal\u00a04, 703\u2013726 (1995)","journal-title":"VLDB Journal"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Lanka, S., Mays, E.: Fully persistent B+-trees. In: Proceedings of the ACM SIGMOD conference on Management of Data, Denver, CO (1991)","DOI":"10.1145\/115790.115861"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Lomet, D., Salzberg, B.: The performance of a multiversion access method. In: Proceedings of the ACM SIGMOD conference on Management of Data, pp. 354\u2013363 (1990)","DOI":"10.1145\/93597.98744"},{"key":"3_CR9","unstructured":"Muth, P., O\u2019neil, P., Pick, A., Weikum, G.: Design, implementation, and performance on the LHAM log-structured history data access method. In: Proceedings of the 24th VLDB Conference, New York, pp. 452\u2013463 (1998)"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0306-4379(95)00011-R","volume":"20","author":"V.J. Tsotras","year":"1995","unstructured":"Tsotras, V.J., Kangelaris, N.: The snapshot index: An I\/O-optimal access method for timeslice queries. Information Systems\u00a020(3), 237\u2013260 (1995)","journal-title":"Information Systems"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45072-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T15:06:57Z","timestamp":1553353617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45072-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405351","9783540450726"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45072-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}