{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:25:36Z","timestamp":1778300736537,"version":"3.51.4"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data &amp; Knowledge Engineering"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1016\/s0169-023x(98)00046-9","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:18:15Z","timestamp":1049483895000},"page":"381-404","source":"Crossref","is-referenced-by-count":20,"title":["Overlapping B+-trees: An implementation of a transaction time access method"],"prefix":"10.1016","volume":"29","author":[{"given":"Theodoros","family":"Tzouramanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Lorentzos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0169-023X(98)00046-9_BIB1","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/s007780050028","article-title":"On optimal multi-version access structures","volume":"5","author":"Becker","year":"1996","journal-title":"The VLDB Journal"},{"issue":"4","key":"10.1016\/S0169-023X(98)00046-9_BIB2","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1093\/comjnl\/28.4.414","article-title":"Multiple generation text files using overlapping tree structures","volume":"28","author":"Burton","year":"1985","journal-title":"The Computer Journal"},{"issue":"3","key":"10.1016\/S0169-023X(98)00046-9_BIB3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1093\/comjnl\/33.3.279","article-title":"Implementation of overlapping B-trees for time and space efficient representation of collection of similar files","volume":"33","author":"Burton","year":"1990","journal-title":"The Computer Journal"},{"issue":"3","key":"10.1016\/S0169-023X(98)00046-9_BIB4","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1147\/rd.303.0230","article-title":"Key-sequence data sets on indelible storage","volume":"30","author":"Easton","year":"1986","journal-title":"IBM Journal on Development"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB5","series-title":"Proc. 8th IEEE International Conference on Data Engineering","first-page":"574","article-title":"Partition of time index for optical disks","author":"Elmasri","year":"1992"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB6","series-title":"Proc. ACM SIGMOD Conf.","first-page":"47","article-title":"R-trees\u2014A dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB7","series-title":"A consensus glossary of temporal database concepts","first-page":"52","volume":"23","year":"1994"},{"issue":"1","key":"10.1016\/S0169-023X(98)00046-9_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/69.667079","article-title":"Designing access methods for bi-temporal databases","volume":"10","author":"Kumar","year":"1998","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB9","series-title":"Proc. IEEE Int. Conf. on Data Engineering","article-title":"Improving the differential file technique via batch operations for tree structured file organizations","author":"Lang","year":"1986"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB10","series-title":"Proc. ACM SIGMOD Conf.","first-page":"426","article-title":"Fully persistent B+-trees","author":"Lanka","year":"1991"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB11","series-title":"Temporal Databases: Theory, Design and Implementation","first-page":"388","article-title":"Transaction time databases","author":"Lomet","year":"1993"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0169-023X(95)00026-O","article-title":"Functional requirements for historical and interval extensions to the relational model","volume":"17","author":"Lorentzos","year":"1995","journal-title":"Data and Knowledge Engineering"},{"issue":"3","key":"10.1016\/S0169-023X(98)00046-9_BIB13","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1109\/69.599935","article-title":"SQL extension for interval data","volume":"9","author":"Lorentzos","year":"1997","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB14","series-title":"Proc. 5th JCIT Conf.","first-page":"491","article-title":"Overlapping B+-trees for temporal data","author":"Manolopoulos","year":"1990"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB15","series-title":"Ph.D. Dissertation","article-title":"Efficient indexing of temporal databases via B+-trees","author":"Nascimento","year":"1995"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB16","series-title":"Technical Report","article-title":"An introductory survey to indexing techniques for temporal databases","author":"Nascimento","year":"1995"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB17","series-title":"Proc. 7th DEXA Conf.","first-page":"779","article-title":"M-IVTT\u2014An Index for Bi-temporal databases","volume":"Vol. 1134","author":"Nascimento","year":"1996"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB18","unstructured":"B. Saltzberg, V. Sotras, A comparison of access methods for time evolving data, ACM Computing Surveys, in press; ftp:\/\/ftp.ccs.neu.edu\/pub\/people\/salzberg\/tempsurvey.ps.gz"},{"issue":"9","key":"10.1016\/S0169-023X(98)00046-9_BIB19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/MC.1986.1663327","article-title":"Temporal Databases","volume":"19","author":"Snodgrass","year":"1986","journal-title":"IEEE Computer"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB20","series-title":"Temporal Databases: Theory, Design and Implementation","year":"1993"},{"issue":"3","key":"10.1016\/S0169-023X(98)00046-9_BIB21","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0306-4379(95)00011-R","article-title":"The Snapshot Index\u2014An I\/O optimal access method for timeslice queries","volume":"20","author":"Tsotras","year":"1995","journal-title":"Information Systems"},{"key":"10.1016\/S0169-023X(98)00046-9_BIB22","series-title":"Proc. 6th ACM Workshop on Advances in Geographical Information Systems (ACM-GIS 98)","first-page":"1","article-title":"Overlapping linear quadtrees\u2014A spatiotemporal access method","author":"Tzouramanis","year":"1998"},{"issue":"3","key":"10.1016\/S0169-023X(98)00046-9_BIB23","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/69.599929","article-title":"An efficient multi-version access structure","volume":"9","author":"Varman","year":"1997","journal-title":"IEEE Trans. on Knowledge and Data Engineering"}],"container-title":["Data &amp; Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X98000469?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X98000469?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:54:15Z","timestamp":1556654055000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X98000469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0169023X98000469"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(98)00046-9","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}