Abstract
This chapter studies the temporal index technique based on valid time. Firstly, it introduces the current study on temporal index. Subsequently, it introduces temporal equivalence, temporal preorder and other basic conceptions, and studies their relative properties, which provide the necessary mathematical frame for the temporal index. In addition, it introduces the algorithm for temporal linear order branch by studying the properties of time interval number. Thereby, the temporal index — TRdim is established. After that, we study the incremental updating algorithm based on the query algorithm and the index. Finally, we design and implement a simulation experiment, whose result indicates the feasibility and validity of TRdim.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Becker B, Gschwind S, Ohler T, Seeger B, Widmayer P (1996) An asymptotically optimal multiversion B-Tree. LDB J 5(4): 264–275
Bentley J (1977) Algorithms for Klee’s rectangle problems. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA
Blankenagel G, Guting R (1994) External segment trees. Algorithmica 12(6): 498–532
Bliujute R, Jensen CS, Saltenis S, Slivinskas G (1999) Light-weight indexing of general bitemporal data. Statistical and Scientific Database Management, pp 125–138
Bliujute R, Jensen CS, Saltenis S, Slivinskas G (1998) R-Tree based indexing of now-relative bitemporal data. In: Proceedings of 24th International Conference on Very Large DataBases, New York, USA, pp 345–356
Edelsbrunner H (1983) A new approach to rectangle intersections, Parts I & II. International J Comput Math 13: 209–229
Elmasri R, Wuu GTJ, Kim YJ (1990) The Time Index: An access structure for temporal data. In: Proceedings of the 16th Very Large Databases Conference, San Francisco: Morgan Kaufmann Publishers Inc., pp1–12
Gunadhi H, Segev A (1985) Efficient indexing methods for temporal relations. IEEE Transactions on Knowledge Data Engineering 5(3): 496–509
Kumar A, Tsotras VJ, Faloutsos C (1995) Access methods for bitemporal databases. In: Clifford S, Tuzhlin A (eds) Proceedings of the International Workshop on Recent Advances in Temporal Databases (Zurich, Switzerland, Sept.), Springer-Verlag, New York, pp 235–254
Mccreight EM (1985) Priority search trees. SIAM J Comput 14(2): 257–276
Nascimento M, Dunham M (1997) Indexing valid time database via B+tree, the MAP21 approch. Technical Report CSE-97-08, Dallas, USA: School of Engineering and Applied Sciences, Southern Methodist University
Nascimento M, Silva J (1998) Towards historical R-rrees. In: Proceedings of the 1998 ACM Symposium on Applied Computing, pp 235–240
Nascimento M, Dunham MH, Elmasri R (1995) Analytical performance studies of the IVTT bitemporal access structure. Technical Report 95-CSE-19, School of Engineering and Applied Sciences, Southern Methodist University, http://www.seas.smu.edu/Papers/tr-96-cse-19.ps
Nascimento M, Dunham MH, Elmasri R (1996) M-IVTT: a practical index for bitemporal databases. In: Proceedings of the Conference on DEXA (DEX’ 96, Zurich, Switzerland)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Tsinghua University Press, Beijing and Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Liu, H., Ye, X., Shi, M., Yang, B. (2010). Temporal Indexes Supporting Valid Time. In: Tang, Y., Ye, X., Tang, N. (eds) Temporal Information Processing Technology and Its Application. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14959-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-14959-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14958-0
Online ISBN: 978-3-642-14959-7
eBook Packages: Computer ScienceComputer Science (R0)