{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:06:11Z","timestamp":1747548371114,"version":"3.38.0"},"publisher-location":"London","reference-count":37,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540199458"},{"type":"electronic","value":"9781447130338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/978-1-4471-3033-8_13","type":"book-chapter","created":{"date-parts":[[2012,1,3]],"date-time":"2012-01-03T17:27:25Z","timestamp":1325611645000},"page":"235-254","source":"Crossref","is-referenced-by-count":14,"title":["Access Methods for Bi-Temporal Databases"],"prefix":"10.1007","author":[{"given":"Anil","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"13_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/MC.1986.1663327","volume":"9","author":"R Snodgrass","year":"1986","unstructured":"R. Snodgrass, I. Ahn. Temporal Databases. IEEE Computer,Vol. l9,No. 9, pp 35\u201342, 1986.","journal-title":"IEEE Computer"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/181550.181560","volume":"23","author":"CS Jensen","year":"1994","unstructured":"C.S. Jensen, editor et al. A Consensus Glossary of Temporal Database Concepts. ACM SIGMOD Record, Vol. 23, No. 1, pp. 52\u201364, 1994.","journal-title":"ACM Sigmond Record"},{"key":"13_CR3","first-page":"115","volume-title":"Proc. ACM SIGMOD","author":"V Lum","year":"1984","unstructured":"V. Lum, P. Dadam, R. Erbe, J. Guenauer, P. Pistor, G. Walch, H. Werner, J.Woodfill. Designing DBMS Support for the Temporal Database. Proc. ACM SIGMOD, pp 115\u2013130, 1984."},{"key":"13_CR4","first-page":"96","volume-title":"Proc. ACM SIGMOD","author":"I Ahn","year":"1986","unstructured":"I. Ahn, R. Snodgrass. Performance Evaluation of a Temporal Database Management System. Proc. ACM SIGMOD, pp 96\u2013107, 1986."},{"key":"13_CR5","first-page":"289","volume-title":"Proc. 13th Conference on Very Large Databases","author":"M Stonebraker","year":"1987","unstructured":"M. Stonebraker. The Design of the Postgres Storage System. Proc. 13th Conference on Very Large Databases, pp 289\u2013300, 1987."},{"key":"13_CR6","first-page":"315","volume-title":"Proc. ACM SIGMOD","author":"D Lomet","year":"1989","unstructured":"D.Lomet, B.Salzberg. Access Methods for Multiversion Data. Proc. ACM SIGMOD,pp 315\u2013324, 1989."},{"key":"13_CR7","first-page":"353","volume-title":"Proc. ACM SIGMOD","author":"D Lomet","year":"1990","unstructured":"D. Lomet, B. Salzberg. The Performance of a Multiversion Access Method. Proc. ACM SIGMOD, pp 353\u2013363, 1990."},{"key":"13_CR8","unstructured":"A. Segev, H. Gunadhi. Event-Join Optimization in Temporal Relational Databases. Proc. 15th Conference on Very Large Databases, pp 205\u2013215, Aug. 1989."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Y. Manolopoulos, G. Kapetanakis. Overlapping B+ Trees for Temporal Data. Proc. of 5th JCIT Conf., Jerusalem, Israel Oct. 22\u201325, pp 491\u2013498, 1990.","DOI":"10.1109\/JCIT.1990.128320"},{"key":"13_CR10","volume-title":"Proc. 16th Conference on Very Large Databases","author":"R Elmasri","year":"1990","unstructured":"R. Elmasri, G. Wuu, Y. Kim. The Time Index: An Access Structure for Temporal Data. Proc. 16th Conference on Very Large Databases, Aug. 1990."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"S. Lanka, E. Mays. Fully Persistent B+ Trees. Proc. ACM SIGMOD, pp 426\u2013435, 1991.","DOI":"10.1145\/119995.115861"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"C. Kolovson, M. Stonebraker. Segment Indexes: Dynamic Indexing Techniques for Multi-dimensional Interval Data. Proc. ACM SIGMOD, pp 138\u2013147, 1991.","DOI":"10.1145\/119995.115807"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1109\/69.109107","volume":"3","author":"CS Jensen","year":"1991","unstructured":"C.S. Jensen, L Mark, N. Roussopoulos. Incremental Implementation Model for Relational Databases with Transaction Time. IEEE Trans, on Knowledge and Data Engineering, Vol. 3, No 4, pp 461\u2013473, 1991.","journal-title":"IEEE Trans, on Knowledge and Data Engineering"},{"key":"13_CR14","first-page":"418","volume-title":"Temporal Databases: Theory","author":"C Kolovson","year":"1993","unstructured":"C. Kolovson. Indexing Techniques for Historical Databases. In A.Tansel, J. Clifford, S.K. Gadia, S. Jajodia, A. Segev, and R. Snodgrass (eds.), Temporal Databases: Theory, Design, and Implementation, Benjamin\/Cummings, pp 418\u2013432, 1993."},{"key":"13_CR15","unstructured":"T.Y.C. Leung, R.R. M\u00fcntz. Stream Processing: Temporal Query Processing and Optimization. In A.Tansel, J.Clifford, S.K.Gadia, S.Jajodia, A.Segev, and R.Snodgrass(eds.), Temporal Databases: Theory, Design and Implementation, Benjamin\/Cummings, pp 329\u2013355, 1993."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer. On Optimal Multiversion Access Structures. Proceedings of Symposium on Large Spatial Databases, 1993. Published in Lecture Notes in Computer Science, Vol 692, pp. 123\u2013141, Springer-Verlag (1993).","DOI":"10.1007\/3-540-56869-7_8"},{"key":"13_CR17","unstructured":"V.J. Tsotras, N. Kangelaris. The Snapshot Index, an I\/O-Optimal Access Method for Snapshot Queries. CATT-Tech. Report 93\u201368, Polytechnic University, Dec. 1993. Also appears at the Information Systems, An International Journal, Vol. 20, No. 3, pp 237\u2013260, 1995."},{"key":"13_CR18","volume-title":"Proc. 10th IEEE Intern. Conf. on Data Engineering","author":"H Shen","year":"1994","unstructured":"H. Shen, B.C. Ooi, H. Lu. The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases. Proc. 10th IEEE Intern. Conf. on Data Engineering, 1994."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"V.J. Ts\u00f6tras, B. Gopinath, G.W.Hart. Efficient Management of Time-Evolving Databases. Accepted at the IEEE Trans, on Knowledge and Data Engineering, 1994.","DOI":"10.1109\/69.404032"},{"key":"13_CR20","volume-title":"To appear at the VLDB Journal","author":"GM Landau","year":"1995","unstructured":"G.M. Landau, J.P. Schmidt, V.J. Tsotras. On Historical Queries along Multiple Lines of Time Evolution. To appear at the VLDB Journal, 1995."},{"key":"13_CR21","unstructured":"B. Salzberg, V.J. Tsotras. A Comparison of Access Methods for Time-Evolving Data. Submitted for publication; available as a technical report from Polytechnic University (CATT-TR-94-8 J), or, Northeastern University (NU-CCS-94-21), 1994."},{"issue":"9","key":"13_CR22","first-page":"362","volume":"80","author":"YJ Chiang","year":"1992","unstructured":"Y.J. Chiang, R. Tamassia. Dynamic Algorithms in Computational Geometry. Proceedings of IEEE, Special Issue on Computational Geometry, Vol 80, No 9, pp 362\u2013381, 1992.","journal-title":"Proceedings of IEEE, Special Issue on Computational Geometry"},{"issue":"2","key":"13_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"EM McCreight","year":"1985","unstructured":"E.M. McCreight. Priority Search Trees. SIAM Journal of Computing, Vol. 14, No 2, pp 257\u2013276, 1985.","journal-title":"SIAM Journal of Computing"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. Proc. ACM SIGMOD, 1984.","DOI":"10.1145\/602259.602266"},{"key":"13_CR25","first-page":"233","volume-title":"Proc. ACM PODS","author":"PC Kanellakis","year":"1993","unstructured":"P.C. Kanellakis, S. Ramaswamy, D.E. Vengroff, J.S. Vitter. Indexing for Data Models with Constraints and Classes. Proc. ACM PODS, pp 233\u2013243, 1993."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"S. Ramaswamy, S. Subramanian. Path Caching: a Technique for Optimal External Searching. Proc. 13th ACM PODS, pp 25\u201335, 1994.","DOI":"10.1145\/182591.182595"},{"key":"13_CR27","volume-title":"Proc. FODO Conference","author":"R Agrawal","year":"1993","unstructured":"R. Agrawal, C. Faloutsos, A. Swami. Efficient Similarity Search in Sequence Databases. Proc. FODO Conference, 1993."},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, M. Ranganathan, Y. Manolopoulos. Fast Subsequence Matching in Time-Series Databases. Proc. ACM SIGMOD, pp 419\u2013429, 1994.","DOI":"10.1145\/191843.191925"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"R.Snodgrass et. al. TSQL92 Language Specification.ACM SIGMOD Ree.Vol 23, Nol, pp 65\u201386, 1994.","DOI":"10.1145\/181550.181562"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider, B. Seeger. The R*-tree: An efficient and Robust Access Method for Points and Rectangles. Proc. ACM SIGMOD, pp 322\u2013331, 1990.","DOI":"10.1145\/93605.98741"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"JR Driscoll","year":"1989","unstructured":"J.R. Driscoll, N. Sarnak, D. Sleator, R.E. Tarjan. Making Data Structures Persistent. J. of Comp, and Syst. Sci., Vol 38, pp 86\u2013124, 1989.","journal-title":"J. of Comp, and Syst. Sci"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner. A new Approach to Rectangle Intersections, Part I&II. Int. Journal of Computer Mathematics, Vol. 13, pp 209\u2013229, 1983.","DOI":"10.1080\/00207168308803365"},{"key":"13_CR33","unstructured":"J.L. Bentley. Algorithms for Klee\u2019s Rectangle Problems. Computer Science Department, Carnegie- Mellon University, Pittsburgh, 1977."},{"key":"13_CR34","volume-title":"Addison-Wesley","author":"H Samet","year":"1989","unstructured":"H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1989."},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"A.Kumar, V.J. Tsotras, C. Faloutsos. On designing Access Methods for Bitemporal Databases. Polytechnic University Tech. Report (CATT-TR-95-85), 1995.","DOI":"10.1007\/978-1-4471-3033-8_13"},{"key":"13_CR36","volume-title":"Proc.24th IEEE FOCS","author":"B Chazelle","year":"1983","unstructured":"B.Chazelle. Filtering Search: a new approach to query answering. Proc.24th IEEE FOCS, 1983."},{"key":"13_CR37","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0196-6774(86)90004-0","volume":"7","author":"R Cole","year":"1986","unstructured":"R. Cole. Searching and Storing Similar lists. J. of Algorithms, Vol 7, pp 202\u2013220. 1986.","journal-title":"J. of Algorithms"}],"container-title":["Workshops in Computing","Recent Advances in Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3033-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T13:09:32Z","timestamp":1742216972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3033-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540199458","9781447130338"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3033-8_13","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1995]]}}}