{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:43:56Z","timestamp":1725561836216},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212003"},{"type":"electronic","value":"9783540247418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24741-8_42","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T10:56:54Z","timestamp":1280746614000},"page":"730-747","source":"Crossref","is-referenced-by-count":12,"title":["A Framework for Access Methods for Versioned Data"],"prefix":"10.1007","author":[{"given":"Betty","family":"Salzberg","sequence":"first","affiliation":[]},{"given":"Linan","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"David","family":"Lomet","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Barrena","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Shan","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kanoulas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: On optimal multiversion access structures. In: Proc. Int. Symp. on Spatial Databases, Singapore, pp. 123\u2013141 (1993)","key":"42_CR1","DOI":"10.1007\/3-540-56869-7_8"},{"doi-asserted-by":"crossref","unstructured":"Dietz, P.F., Sleator, D.D.: Two algorithms for maintaining order in a list. In: Proceedings of the nineteenth annual ACM conference on Theory of computing (1987)","key":"42_CR2","DOI":"10.1145\/28395.28434"},{"doi-asserted-by":"crossref","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D.: Making data structure persistent. Journal of Computer and System Sciences\u00a038 (February 1989)","key":"42_CR3","DOI":"10.1016\/0022-0000(89)90034-2"},{"doi-asserted-by":"crossref","unstructured":"Easton, M.C.: Key-sequence data sets on indelible storage. IBM J. Res. Development, 230\u2013241 (1986)","key":"42_CR4","DOI":"10.1147\/rd.303.0230"},{"doi-asserted-by":"crossref","unstructured":"Evangelidis, G., Lomet, D.B., Salzberg, B.: The hB-Pi-Tree: A multi-attribute index supporting concurrency, recovery and node consolidation. The VLDB Jounal, 1\u201325 (January 1997)","key":"42_CR5","DOI":"10.1007\/s007780050030"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45876-X_17","volume-title":"Advances in Database Technology - EDBT 2002","author":"M. Hadjieleftheriou","year":"2002","unstructured":"Hadjieleftheriou, M., Kollios, G., Tsotras, V.J., Gunopulos, D.: Efficient indexing of spatiotemporal objects. In: Jensen, C.S., Jeffery, K., Pokorn\u00fd, J., \u0160altenis, S., Bertino, E., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol.\u00a02287, pp. 251\u2013268. Springer, Heidelberg (2002)"},{"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, pp. 451\u2013460 (2000)","key":"42_CR7"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45072-6_3","volume-title":"Advances in Spatial and Temporal Databases","author":"L. Jiang","year":"2003","unstructured":"Jiang, L., Salzberg, B., Lomet, D., Barrena, M.: The BTRTree: Path-defined version-range splitting in a branched and temporal structure. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol.\u00a02750, Springer, Heidelberg (2003)"},{"unstructured":"Kanoulas, E., Evangelidis, G.: Indexing of spatiotemporal data with the hB-Pi Tree. In: HDMS 2002 1st Hellenic Data Management Symposium, Athens, Hellas (July 2002)","key":"42_CR9"},{"doi-asserted-by":"crossref","unstructured":"Lanka, S., Mays, E.: Fully persistent B\u2009+\u2009-trees. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data, pp. 426\u2013435 (1991)","key":"42_CR10","DOI":"10.1145\/115790.115861"},{"doi-asserted-by":"crossref","unstructured":"Lomet, D., Salzberg, B.: The performance of a multiversion access method. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data, pp. 354\u2013363 (1990)","key":"42_CR11","DOI":"10.1145\/93597.98744"},{"unstructured":"Tao, Y., Papadias, D.: The MV3R-Tree: A spatio-temporal access method for timestamp and interval queries. In: VLDB 2001, Proceedings of 27th International Conference on Very Large Data Bases, September 2001, pp. 431\u2013440 (2001)","key":"42_CR12"},{"doi-asserted-by":"crossref","unstructured":"Varman, P.J., Verma, R.M.: An efficient multiversion access structure. IEEE Transaction on Knowledge and Data Engineering, 391\u2013409 (May\/June 1997)","key":"42_CR13","DOI":"10.1109\/69.599929"}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology - EDBT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24741-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:17:15Z","timestamp":1559344635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24741-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212003","9783540247418"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24741-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}