Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Valid-Time Indexing

  • Mirella M. MoroEmail author
  • Vassilis J. Tsotras
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1513


Valid-time access methods


A valid-time index is a temporal index that enables fast access to valid-time datasets. In a traditional database, an index is used for selection queries. When accessing valid-time databases, such selections also involve the valid-time dimension (the time when a fact becomes valid in reality). The characteristics of the valid-time dimension imply various properties that the temporal index should have in order to be efficient. As traditional indices, the performance of a temporal index is described by three costs: (i) storage cost (i.e., the number of pages the index occupies on the disk), (ii) update cost (the number of pages accessed to perform an update on the index, e.g., when adding, deleting, or updating a record), and (iii) query cost (the number of pages accessed for the index to answer a query).

Historical Background

A valid-time database maintains the entire temporal behavior of an enterprise as best known now [13]. It stores the...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Arge L, Vitter JS. Optimal dynamic interval management in external memory. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science; 1996. p. 560–69.Google Scholar
  2. 2.
    Blankenagel G, Gueting RH. External segment trees. Algorithmica. 1994;12(6):498–532.MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bliujute R, Jensen CS, Saltenis S, Slivinskas G. R-tree based indexing of now-relative bi-temporal data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 345–56.Google Scholar
  4. 4.
    Chiang Y-J, Silva CT. External memory techniques for isosurface extraction in scientific visualization, external memory algorithms and visualization. In: Abello J, Vitter JS, editors. DIMACS series in discrete mathematics and theoretical computer science, vol. 50. AMS; Providence, RI. 1999. p. 247–77Google Scholar
  5. 5.
    Icking C, Klein R, Ottmann T. Priority search trees in secondary memory. In: Proceedings of the International Workshop on Graph Theoretic Concepts in Computer Science; 1988. p. 84–93Google Scholar
  6. 6.
    Kanellakis P, Ramaswamy S, Vengroff D, Vitter JS. Indexing for data models with constraint and classes. In: Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1993. p. 233–43.Google Scholar
  7. 7.
    Kolovson C, Stonebraker M. Segment indexes: dynamic indexing techniques for multi-dimensional interval data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1991. p. 138–47.CrossRefGoogle Scholar
  8. 8.
    Kriegel H-P, Potke M, Seidl T. Managing intervals efficiently in object-relational databases. In: Proceedings of the 26th International Conference on Very Large Data Bases; 2000.Google Scholar
  9. 9.
    Mehlhorn K. Data structures and efficient algorithms, vol. 3: Multi-dimensional searching and computational geometry. EATCS monographs. Springer; Springer-Verlag Berlin Heidelberg. 1984.Google Scholar
  10. 10.
    Nascimento MA, Dunham MH. Indexing valid time databases via B+-Trees. IEEE Trans Knowl Data Eng. 1999;11(6):929–47.CrossRefGoogle Scholar
  11. 11.
    Ramaswamy S, Subramanian S. Path caching: a technique for optimal external searching. In: Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1994. p. 25–35.Google Scholar
  12. 12.
    Salzberg B, Tsotras VJ. A comparison of access methods for time-evolving data. ACM Comput Surv. 1999;31(2):158–221.CrossRefGoogle Scholar
  13. 13.
    Snodgrass RT, Ahn I. Temporal databases. IEEE Comput. 1986;19(9):35–42.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Departamento de Ciencia da ComputaçaoUniversidade Federal de Minas Gerais – UFMGBelo HorizonteBrazil
  2. 2.University of California-RiversideRiversideUSA

Section editors and affiliations

  • Richard T. Snodgrass
    • 1
  • Christian S. Jensen
    • 2
  1. 1.University of ArizonaTucsonUSA
  2. 2.Aalborg UniversityAalborg ØstDenmark