{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:29Z","timestamp":1760203049168,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_1514","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:43:04Z","timestamp":1253090584000},"page":"239-243","source":"Crossref","is-referenced-by-count":0,"title":["Bi-Temporal Indexing"],"prefix":"10.1007","author":[{"given":"Mirella M.","family":"Moro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"1514_CR1_1514","first-page":"264","volume":"5","author":"B. Becker","year":"1996","unstructured":"Becker B., Gschwind S., Ohler T., Seeger B., and Widmayer P. An asymptotically optimal multiversion B-tree. VLDB J., 5(4):264\u2013275, 1996.","journal-title":"An asymptotically optimal multiversion B-tree. VLDB J."},{"key":"1514_CR2_1514","unstructured":"Bliujute R., Jensen C.S., Saltenis S., and Slivinskas G. R-tree based indexing of now-relative bitemporal data. In Proc. 24th Int. Conf. on Very Large Data Bases, 1998, pp. 345\u2013356."},{"issue":"4","key":"1514_CR3_1514","first-page":"414","volume":"28","author":"F.W. Burton","year":"1985","unstructured":"Burton F.W., Huntbach M.M., and Kollias J.G. Multiple generation text files using overlapping tree structures. Comput. J., 28(4):414\u2013416, 1985.","journal-title":"Multiple generation text files using overlapping tree structures. Comput. J."},{"issue":"1","key":"1514_CR4_1514","doi-asserted-by":"crossref","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., and Tarjan R.E. Making data structures persistent. J. Comput. Syst. Sci., 38(1):86\u2013124, 1989.","journal-title":"Making data structures persistent. J. Comput. Syst. Sci."},{"issue":"1","key":"1514_CR5_1514","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/69.667079","volume":"10","author":"A. Kumar","year":"1998","unstructured":"Kumar A., Tsotras V.J., and Faloutsos C. Designing access methods for bitemporal databases. IEEE Trans. Knowl. Data Eng., 10(1):1\u201320, 1998.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1514_CR6_1514","unstructured":"Nascimento M.A. and Silva J.R.O. Towards historical R-trees. In Proc. 1998 ACM Symp. on Applied Computing, 1998, pp. 235\u2013240."},{"issue":"2","key":"1514_CR7_1514","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/319806.319816","volume":"31","author":"B. Salzberg","year":"1999","unstructured":"Salzberg B. and Tsotras V.J. A comparison of access methods for time-evolving data. ACM Comput. Surv., 31(2):158\u2013221, 1999.","journal-title":"ACM Comput. Surv."},{"issue":"9","key":"1514_CR8_1514","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/MC.1986.1663327","volume":"19","author":"R.T. Snodgrass","year":"1986","unstructured":"Snodgrass R.T. and Ahn I. Temporal databases. IEEE Comput., 19(9):35\u201342, 1986.","journal-title":"IEEE Comput."},{"issue":"4","key":"1514_CR9_1514","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1093\/comjnl\/43.4.325","volume":"43","author":"T. Tzouramanis","year":"2000","unstructured":"Tzouramanis T., Vassilakopoulos M., and Manolopoulos Y. Overlapping linear quadtrees and spatio-temporal query processing. Comput. J., 43(4):325\u2013343, 2000.","journal-title":"Comput. J."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_1514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T03:11:54Z","timestamp":1590981114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_1514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_1514","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}