{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:33:25Z","timestamp":1648809205829},"reference-count":24,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"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":["Information and Software Technology"],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1016\/s0950-5849(98)00054-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:22:28Z","timestamp":1027621348000},"page":"327-337","source":"Crossref","is-referenced-by-count":2,"title":["Indexing bitemporal databases as points"],"prefix":"10.1016","volume":"40","author":[{"given":"Beng Chin","family":"Ooi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng Hian","family":"Goh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0950-5849(98)00054-8_BIB1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0020-0190(94)00176-Y","article-title":"The Interval B-tree","volume":"53","author":"Ang","year":"1995","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB2","series-title":"Proceedings of the 16th International Conference on Very Large Data Bases","first-page":"1","article-title":"The Time Index: An access structure for temporal data","author":"Elmasri","year":"1990"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0169-023X(95)00034-P","article-title":"Indexing temporal data using B+-tree","volume":"18","author":"Goh","year":"1996","journal-title":"Data and Knowledge Engineering"},{"issue":"3","key":"10.1016\/S0950-5849(98)00054-8_BIB4","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/69.224200","article-title":"Efficient indexing methods for temporal relation","volume":"5","author":"Gunadhi","year":"1993","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB5","series-title":"Proceedings of the 10th International Conference on Data Engineering","first-page":"274","article-title":"The TP-index: A dynamic and efficient indexing mechanism for temporal databases","author":"Shen","year":"1994"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB6","series-title":"Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data","first-page":"315","article-title":"Access methods for multiversion data","author":"Lomet","year":"1989"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB7","series-title":"Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data","first-page":"353","article-title":"The performance of a multiversion access method","author":"Lomet","year":"1990"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB8","series-title":"Temporal Databases: Theory, Design and Implementation","first-page":"388","article-title":"Transaction time databases","author":"Lomet","year":"1993"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB9","series-title":"Proceedings of the International Workshop on Temporal Databases","first-page":"235","article-title":"Access methods for bi-temporal databases","author":"Kumar","year":"1995"},{"issue":"1","key":"10.1016\/S0950-5849(98)00054-8_BIB10","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/181550.181560","article-title":"A consensus glossary of temporal database concepts","volume":"23","year":"1994","journal-title":"ACM SIGMOD Record"},{"issue":"6","key":"10.1016\/S0950-5849(98)00054-8_BIB11","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/0306-4379(94)90001-9","article-title":"On indexing spatial and temporal data","volume":"19","author":"Salzberg","year":"1994","journal-title":"Information Systems"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB12_1","series-title":"ACM Computing Surveys","article-title":"A comparison of access methods for time-evolving data","author":"Salzberg","year":"1994"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB12_2","unstructured":"(Also available as Technical Report NU-CCS-94-21 at Northeastern University.)"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB13","series-title":"Proceedings DEXA'96","first-page":"779","article-title":"M-IVTT: An index for bitemporal database","author":"Nascimento","year":"1996"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB14","series-title":"Proceedings of the 3rd International Symposium on Large Spatial Database Systems","first-page":"123","article-title":"On optimal multiversion access structures","author":"Becker","year":"1993"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB15","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","article-title":"Making data structures persistent","volume":"38","author":"Driscoll","year":"1989","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB16","series-title":"Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data","first-page":"426","article-title":"Fully persistent B+-trees","author":"Lanka","year":"1991"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB17","series-title":"Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data","first-page":"47","article-title":"R-trees: A dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB18","series-title":"Proceedings of the 22nd International Conference on Very Large Data Bases","article-title":"The x-tree: An index structure for high-dimensional data","author":"Berchtold","year":"1996"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB19","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00207168308803364","article-title":"A new approach to rectangle intersections","volume":"13","author":"Edelsbrunner","year":"1983","journal-title":"International Journal of Computer Mathematics"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB20","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF01936137","article-title":"Implementation of the grid file: Design concepts and experience","volume":"25","author":"Hinrichs","year":"1985","journal-title":"BIT"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB21","series-title":"Proceedings of the 14th International Conference on Very Large Data Bases","first-page":"360","article-title":"Techniques for design and implementation of efficient spatial access methods","author":"Seeger","year":"1988"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB22","volume":"Volume 1","author":"Knuth","year":"1973"},{"key":"10.1016\/S0950-5849(98)00054-8_BIB23","unstructured":"Anil Kumar, Vassilis J. Tsotras, Chirstos Faloutso, Designing access methods for bitemporal databases, IEEE Transactions on Data and Knowledge Engineering (forthcoming). (Also appeared as Technical Report CS-TR-3764, published by Department of Computer Science, University of Maryland.)."}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584998000548?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584998000548?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:21:06Z","timestamp":1556058066000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950584998000548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":24,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S0950584998000548"],"URL":"https:\/\/doi.org\/10.1016\/s0950-5849(98)00054-8","relation":{},"ISSN":["0950-5849"],"issn-type":[{"value":"0950-5849","type":"print"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}