Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
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.
Blankenagel G, Gueting RH. External segment trees. Algorithmica. 1994;12(6):498–532.
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.
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–77
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–93
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.
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.
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.
Mehlhorn K. Data structures and efficient algorithms, vol. 3: Multi-dimensional searching and computational geometry. EATCS monographs. Springer; Springer-Verlag Berlin Heidelberg. 1984.
Nascimento MA, Dunham MH. Indexing valid time databases via B+-Trees. IEEE Trans Knowl Data Eng. 1999;11(6):929–47.
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.
Salzberg B, Tsotras VJ. A comparison of access methods for time-evolving data. ACM Comput Surv. 1999;31(2):158–221.
Snodgrass RT, Ahn I. Temporal databases. IEEE Comput. 1986;19(9):35–42.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Moro, M.M., Tsotras, V.J. (2018). Valid-Time Indexing. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1513
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1513
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering