{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:23:29Z","timestamp":1742948609121,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":9,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461482666"},{"type":"electronic","value":"9781461482659"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-1-4614-8265-9_1514","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T11:59:56Z","timestamp":1544097596000},"page":"304-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bitemporal 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","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"issue":"4","key":"1514_CR2164","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. VLDB J. 1996;5(4):264\u201375.","journal-title":"VLDB J"},{"key":"1514_CR2165","unstructured":"Bliujute R, Jensen CS, Saltenis S, Slivinskas G. R-tree based indexing of now-relative bitemporal data. In: Proceedings of the 24th International Conference on Very Large Data Bases; 1998. p. 345\u201356."},{"issue":"4","key":"1514_CR2166","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1093\/comjnl\/28.4.414","volume":"28","author":"FW Burton","year":"1985","unstructured":"Burton FW, Huntbach MM, Kollias JG. Multiple generation text files using overlapping tree structures. Comput J. 1985;28(4):414\u20136.","journal-title":"Comput J"},{"issue":"1","key":"1514_CR2167","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"JR Driscoll","year":"1989","unstructured":"Driscoll JR, Sarnak N, Sleator DD, Tarjan RE. Making data structures persistent. J Comput Syst Sci. 1989;38(1):86\u2013124.","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"1514_CR2168","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/69.667079","volume":"10","author":"A Kumar","year":"1998","unstructured":"Kumar A, Tsotras VJ, Faloutsos C. Designing access methods for bitemporal databases. IEEE Trans Knowl Data Eng. 1998;10(1):1\u201320.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1514_CR2169","doi-asserted-by":"crossref","unstructured":"Nascimento MA, Silva JRO. Towards historical R-trees. In: Proceedings of the 1998 ACM Symposium on Applied Computing; 1998. p. 235\u201340.","DOI":"10.1145\/330560.330692"},{"issue":"2","key":"1514_CR2170","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/319806.319816","volume":"31","author":"B Salzberg","year":"1999","unstructured":"Salzberg B, Tsotras VJ. A comparison of access methods for time-evolving data. ACM Comput Surv. 1999;31(2):158\u2013221.","journal-title":"ACM Comput Surv"},{"issue":"9","key":"1514_CR2171","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/MC.1986.1663327","volume":"19","author":"RT Snodgrass","year":"1986","unstructured":"Snodgrass RT, Ahn I. Temporal databases. IEEE Comput. 1986;19(9):35\u201342.","journal-title":"IEEE Comput"},{"issue":"4","key":"1514_CR2172","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, Manolopoulos Y. Overlapping linear quadtrees and spatio-temporal query processing. Comput J. 2000;43(4):325\u201343.","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-1-4614-8265-9_1514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T23:24:05Z","timestamp":1591053845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4614-8265-9_1514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781461482666","9781461482659"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_1514","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}