Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Becker B, Gschwind S, Ohler T, Seeger B, Widmayer P. An asymptotically optimal multiversion B-tree. VLDB J. 1996;5(4):264–75.
Bliujute R, Jensen CS, Saltenis S, Slivinskas G. R-tree based indexing of now-relative bitemporal data. In: Proceedings of the 24th International Conference on Very Large Data Bases; 1998. p. 345–56.
Burton FW, Huntbach MM, Kollias JG. Multiple generation text files using overlapping tree structures. Comput J. 1985;28(4):414–6.
Driscoll JR, Sarnak N, Sleator DD, Tarjan RE. Making data structures persistent. J Comput Syst Sci. 1989;38(1):86–124.
Kumar A, Tsotras VJ, Faloutsos C. Designing access methods for bitemporal databases. IEEE Trans Knowl Data Eng. 1998;10(1):1–20.
Nascimento MA, Silva JRO. Towards historical R-trees. In: Proceedings of the 1998 ACM Symposium on Applied Computing; 1998. p. 235–40.
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.
Tzouramanis T, Vassilakopoulos M, Manolopoulos Y. Overlapping linear quadtrees and spatio-temporal query processing. Comput J. 2000;43(4):325–43.
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). Bitemporal 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_1514
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1514
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