Advertisement

Temporal Access Methods

  • Yannis Manolopoulos
  • Yannis Theodoridis
  • Vassilis J. Tsotras
Part of the Advances in Database Systems book series (ADBS, volume 17)

Abstract

Traditional databases capture a single (usually the most recent) state of the modeled reality. This implies that only queries about this captured state can be answered. There are however many time-varying applications that deal with historical (past) data, as well as current, or even data about the future. To address these applications temporal databases have been proposed. Such databases model reality through the use of two orthogonal time dimensions: the valid and transaction times. Depending on which time dimension(s) is supported, a temporal database is characterized as transaction-time, valid-time or bitemporal. Supporting temporal data adds extra database functionality since it allows queries about the modeled reality’s past, current or future behavior. However, it also creates the novel problem of efficiently managing temporal data. In this chapter we first briefly present the basic characteristics of the two time dimensions and what it means to design indices that support them. While the problem of indexing valid-time databases can be reduced to indexing dynamic collections of interval data (and thus one could use the methods from Chapter 4), indexing transaction-time and bitemporal databases requires new approaches. In particular we present four transaction-time methods (the Snapshot Index, the Time-Split B-tree, the Multiversion B-tree and the Overlapping B-tree) and a bitemporal method (the Bitemporal R-tree). We also discuss temporal hashing, the temporal analogue of external hashing in a transaction-time database.

Keywords

Query Time Index Node Valid Time Temporal Database Data Page 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Becker, B., Gschwind, S., Ohler, T., Seeger, B., and Widmayer, P. (1996). An Asymptotically Optimal Multiversion B-tree. The VLDB Journal, 5(4):264–275.CrossRefGoogle Scholar
  2. Burton, F.W., Huntbach, M.M., and Kollias, J.G. (1985). Multiple Generation Text Files using Overlapping Tree Structures. The Computer Journal, 28(4):414–416.CrossRefGoogle Scholar
  3. Beckmann, N., Kriegel, H.P., Schneider, R., and Seeger, B. (1990). The R*-tree: an Efficient and Robust Access Method for Points and Rectangles. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 322–331.Google Scholar
  4. Bliujute, R., Jensen, C.S., Saltenis, S. and Slivinskas, G. (1998). R-Tree Based Indexing of Now-Relative Bitemporal Data. In Proceedings of the 24th International Conference on Very Large Data Bases, pages 345–356.Google Scholar
  5. Driscoll, J.R., Sarnak, N., Sleator, D., and Tarjan, R.E. (1989). Making Data Structures Persistent. Journal of Computer and Systems Sciences, 38(1):86–124.MathSciNetzbMATHCrossRefGoogle Scholar
  6. Easton, M.C. (1986). Key-sequence Data Sets on Indelible Storage. IBM Journal on Research and Development, 30(3):230–241.CrossRefGoogle Scholar
  7. Elmasri, R., Wuu, G., and Kim, Y. (1990). The Time Index: an Access Structure for Temporal Data. In Proceedings of the 16 th International Conference on Very Large Data Bases, pages 1–12.Google Scholar
  8. Elmasri, R., Wuu, G., and Kouramajian, V. (1993). The Time Index and the Monotonic B+-tree. In Temporal Databases: Theory, Design, and Implementation, by Tansel, A., et al. (eds.), pages 433–456. Benjamin/Cummings.Google Scholar
  9. Gunadhi, H. and Segev, A. (1993). Efficient Indexing Methods for Temporal Relations. IEEE Transactions on Knowledge and Data Engineering, 5(3):496–509.CrossRefGoogle Scholar
  10. Jensen, C.S., et al. (1994). A Consensus Glossary of Temporal Database Concepts. ACM SIGMOD Record, 23(1):52–64.CrossRefGoogle Scholar
  11. Jensen, C.S., Mark, L., and Roussopoulos, N. (1991). Incremental Implementation Model for Relational Databases with Transaction Time. IEEE Transactions on Knowledge and Data Engineering, 3(4):461–473.CrossRefGoogle Scholar
  12. Kollios, G. and Tsotras, V.J. (1998). Hashing Methods for Temporal Data, University of California at Riverside, Department of Computer Science, TR UCR_CS_98_01. Available from http://www.cs.ucr.edu/publications/tech_reports/Google Scholar
  13. Kolovson, C. and Stonebraker, M. (1989). Indexing Techniques for Historical Databases. In Proceedings of the 5 th IEEE International Conference on Data Engineering, pages 127–137.Google Scholar
  14. Kolovson, C. and Stonebraker, M. (1991). Segment Indexes: Dynamic Indexing Techniques for Multi-dimensional Interval Data. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 138–147.Google Scholar
  15. Kumar, A., Tsotras, V.J., and Faloutsos, C. (1998). Designing Access Methods for Bitemporal Databases. IEEE Transactions on Knowledge and Data Engineering, 10(1):1–20.CrossRefGoogle Scholar
  16. Kouramajian, V., Kamel, I., Elmasri, R., and Waheed, S. (1994). The Time Index+: an Incremental Access Structure for Temporal Databases. In Proceedings of the 3 rd International Conference on Information and Knowledge Management, pages 296–303.Google Scholar
  17. Landau, G.M., Schmidt, J.P. and Tsotras, V.J. (1995) Historical Queries Along Multiple Lines of Time Evolution. The VLDB Journal 4(4):703–726.CrossRefGoogle Scholar
  18. Lanka, S. and Mays, E. (1991). Fully Persistent B+-trees. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 426–435.Google Scholar
  19. Leung, T.Y.C and Muntz, R.R. (1993). Stream Processing: Temporal Query Processing and Optimization. In Temporal Databases: Theory, Design, and Implementation, by Tansel, A., Clifford, J., Gadia, S.K., Jajodia, S., Segev, A., and Snodgrass R. (eds.), pages 329–355, Benjamin/ Cummings.Google Scholar
  20. Lomet, D. and Salzberg, B. (1989). Access Methods for Multiversion Data. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 315–324.Google Scholar
  21. Manolopoulos, Y. and Kapetanakis, G. (1990). Overlapping B+-trees for Temporal Data. In Proceedings of the 5 th Jerusalem Conference on Information Technology, pages 491–498.Google Scholar
  22. Nascimento, M., Dunham, M.H., and Elmasri, R. (1996). M-IVTT: a Practical Index for Bitemporal Databases. In Proceedings of the 7 th International Conference on Database and Expert Systems Applications, pages 779–790.Google Scholar
  23. Ozsoyoglu, G. and Snodgrass, R. (1995). Temporal and Real-Time Databases: a Survey. IEEE Transactions on Knowledge and Data Engineering, (4):513–532.CrossRefGoogle Scholar
  24. Ramaswamy, S. (1997). Efficient Indexing for Constraint and Temporal Databases. In Proceedings of the 6 th International Conference on Database Theory, pages 419–431.Google Scholar
  25. Snodgrass R. and Ahn, I. (1986). Temporal Databases. IEEE Computer, 19(9):35–42.CrossRefGoogle Scholar
  26. Shen, H., Ooi, B.C., and Lu, H. (1994). The TP-Index: a Dynamic and Efficient Indexing Mechanism for Temporal Databases. In Proceedings of the 10 th International Conference on Data Engineering, pages 274–281.Google Scholar
  27. Salzberg, B. and Tsotras, V.J. (1999). A Comparison of Access Methods for Time-Evolving Data. ACM Computing Surveys, to appear. Also available as TimeCenter TR-18, http:// www.cs.auc.dk/research/DBS/tdb/TimeCenter/publications2.htmlGoogle Scholar
  28. Tsotras, V.J., Gopinath, B., and Hart, G.W. (1995). Efficient Management of Time-Evolving Databases. IEEE Transactions on Knowledge and Data Engineering, 7(4).591–608.CrossRefGoogle Scholar
  29. Tsotras, V.J. and Kangelaris, N. (1995). The Snapshot Index: an I/O-Optimal Access Method for Timeslice Queries. Information Systems, 20(3):237–260.CrossRefGoogle Scholar
  30. Tzouramanis, T., Manolopoulos, Y., and Lorentzos, N. (1999). Overlapping B+-trees: an Implementation of a Transaction Time Access Method. Data and Knowledge Engineering, 29(3):381–404.zbMATHCrossRefGoogle Scholar
  31. Van den Bercken, J. and Seeger, B. (1996). Query Processing Techniques for Multiversion Access Methods. In Proceedings of the 22 nd International Conference on Very Large Data Bases, pages 168–179.Google Scholar
  32. Verma, R.M. and Varman, P.J. (1994). Efficient Archivable Time Index: a Dynamic Indexing Scheme for Temporal Data. In Proceedings of the Conference on Computer Systems and Education, pages 59–72.Google Scholar
  33. Varman, P.J. and Verma, R.M. (1997). An Efficient Multiversion Access Structure. IEEE Transactions on Knowledge and Data Engineering, 9(3):391–409.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Yannis Manolopoulos
    • 1
  • Yannis Theodoridis
    • 2
  • Vassilis J. Tsotras
    • 3
  1. 1.Aristotle UniversityGreece
  2. 2.Greece
  3. 3.University of CaliforniaRiversideUSA

Personalised recommendations