{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:46:53Z","timestamp":1773190013071,"version":"3.50.1"},"publisher-location":"New York, NY","reference-count":11,"publisher":"Springer New York","isbn-type":[{"value":"9781461482666","type":"print"},{"value":"9781461482659","type":"electronic"}],"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_399","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T12:45:05Z","timestamp":1544100305000},"page":"4211-4217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Transaction-Time 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":"399_CR20885","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"},{"issue":"4","key":"399_CR20886","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"},{"key":"399_CR20887","unstructured":"Carey MJ, DeWitt DJ, Richardson JE, Shekita EJ. Object and file management in the EXODUS extensible database system. In: Proceedings of the 12th International Conference on Very Large Data Bases; 1986. p. 91\u2013100."},{"issue":"1","key":"399_CR20888","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":"3","key":"399_CR20889","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1147\/rd.303.0230","volume":"30","author":"MC Easton","year":"1986","unstructured":"Easton MC. Key-sequence data sets on inedible storage. IBM J Res Dev. 1986;30(3):230\u201341.","journal-title":"IBM J Res Dev"},{"key":"399_CR20890","doi-asserted-by":"crossref","unstructured":"Lomet D, Salzberg B. Access methods for multiversion data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1989. p. 315\u201324.","DOI":"10.1145\/66926.66956"},{"issue":"2","key":"399_CR20891","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":"399_CR20892","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":"3","key":"399_CR20893","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0306-4379(95)00011-R","volume":"20","author":"VJ Tsotras","year":"1995","unstructured":"Tsotras VJ, Kangelaris N. The snapshot index: an I\/O-optimal access method for timeslice queries. Inf Syst. 1995;20(3):237\u201360.","journal-title":"Inf Syst"},{"issue":"3","key":"399_CR20894","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S0169-023X(98)00046-9","volume":"29","author":"T Tzouramanis","year":"1999","unstructured":"Tzouramanis T, Manolopoulos Y, Lorentzos NA. Overlapping B+-trees: an implementation of a transaction time access method. Data Knowl Eng. 1999;29(3):381\u2013404.","journal-title":"Data Knowl Eng"},{"issue":"3","key":"399_CR20895","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/69.599929","volume":"9","author":"PJ Varman","year":"1997","unstructured":"Varman PJ, Verma RM. An efficient multiversion access structure. IEEE Trans Knowl Data Eng. 1997;9(3):391\u2013409.","journal-title":"IEEE Trans Knowl Data Eng"}],"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_399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T22:31:33Z","timestamp":1591050693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4614-8265-9_399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781461482666","9781461482659"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_399","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"}}]}}