M-IVTT: An index for bitemporal databases
In this paper we present an indexing structure for bitemporal databases which allows the user to tune the trade-off between query processing speed and index size. The structure is based on incremental trees indexing valid time ranges, which are pointed to by a tree indexing transaction time. Valid time trees are kept full at every so many transaction time points, and in between those, patching sets are kept. The valid time trees are B+-trees which efficiently index ranges via a mapping function. Analytic performance results are presented and discussed.
KeywordsQuery Processing Indexing Structure Range Query Index Size Valid Time
Unable to display preview. Download preview PDF.
- 1.A. Cappelli, C. Castro, and M.R. Scalas. A modular history-oriented access structure for bitemporal relational databases. In Proceedings of the SOFSEM'95: Theory and Practice of Informatics, Milovy, Czech Republic, Nov./Dec. 1995. (Volume 1012 of Springer Verlag's Lecture Notes of Computer Science, pages 475–491).Google Scholar
- 2.M.H. Dunham, R. Elmasri, M.A. Nascimento, and M. Sobol. Benchmarking temporal databases: A research agenda. Technical Report CSE-95-20, School of Engineering and Applied Sciences, Southern Methodist University, 1995. Available via WWW on URL: http://www.seas.smu.edu/∼mario/Papers/tr-95-cse-20.ps.Google Scholar
- 3.R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Benjamin/Cummings, Redwood City, CA, 2nd edition, 1994.Google Scholar
- 4.A. Kumar, V.J. Tsotras, and C. Faloutsos. Access methods for bi-temporal databases. In J. Clifford and A. Tuzhilin, editors, Proceedings of the International Workshop on Temporal Databases, Workshop in Computing, pages 235–254, Zurich, Switzerland, September 1995. Springer and British Computer Society.Google Scholar
- 5.M.A. Nascimento. Efficient Indexing of Temporal Databases Via B +-trees. PhD thesis, Southern Methodist University, Dallas, TX, June 1996.Google Scholar
- 6.M.A. Nascimento, M.H. Dunham, and R. Elmasri. Analytical perfomance studies of the IVTT bitemporal access structure. Technical Report 95-CSE-19, School of Engineering and Applied Sciences, Southern Methodist University, October 1995. Available via WWW on URL: http://www.seas.smu.edu/∼mario/Papers/tr-96-cse-19.ps.Google Scholar
- 7.M.A. Nascimento, M.H. Dunham, and R. Elmasri. Using incremental trees for space efficient indexing of bitemporal databases. In Proceedings of the Second International Conference on Application of Databases (ADB'95), pages 235–248, Santa Clara, CA, December 1995.Google Scholar
- 8.M.A. Nascimento, M.H. Dunham, and V. Kouramajian. A multiple tree mapppingbased approach for valid-time ranges indexing. Journal of the Brazilian Computer Society, 2(3), April 1996.Google Scholar
- 9.B. Salzberg and V.J. Tsotras. A comparison of access methods for time evolving data. Technical Report NU-CCS-94-21, College of Computer Science, Northeastern University, 1994. (Also published as Technical Report CATT-TR-94-81 at Polytechnic University).Google Scholar
- 10.R.T. Snodgrass and I. Ahn. Temporal databases. IEEE Computer, 19(9):35–42, September 1986.Google Scholar
- 11.A. Tansel et al (Eds). Temporal Databases: Theory, Design, and Implementation. Database Systems and Applications Series. Benjamin/Cummings, Redwood City, CA, 1993.Google Scholar
- 12.V.J. Tsotras and A. Kumar. Temporal database bibliography update. ACM SIGMOD Record, 25(1):41–51, March 1996.Google Scholar