Temporal Indexes Supporting Valid Time
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.
Keywords
temporal preorder time interval number query and incremental updating simulation and evaluationPreview
Unable to display preview. Download preview PDF.
References
- [1]Becker B, Gschwind S, Ohler T, Seeger B, Widmayer P (1996) An asymptotically optimal multiversion B-Tree. LDB J 5(4): 264–275Google Scholar
- [2]Bentley J (1977) Algorithms for Klee’s rectangle problems. Computer Science Department, Carnegie Mellon University, Pittsburgh, PAGoogle Scholar
- [3]Blankenagel G, Guting R (1994) External segment trees. Algorithmica 12(6): 498–532MathSciNetCrossRefGoogle Scholar
- [4]Bliujute R, Jensen CS, Saltenis S, Slivinskas G (1999) Light-weight indexing of general bitemporal data. Statistical and Scientific Database Management, pp 125–138Google Scholar
- [5]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–356Google Scholar
- [6]Edelsbrunner H (1983) A new approach to rectangle intersections, Parts I & II. International J Comput Math 13: 209–229MathSciNetMATHCrossRefGoogle Scholar
- [7]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–12Google Scholar
- [8]Gunadhi H, Segev A (1985) Efficient indexing methods for temporal relations. IEEE Transactions on Knowledge Data Engineering 5(3): 496–509CrossRefGoogle Scholar
- [9]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–254Google Scholar
- [10]Mccreight EM (1985) Priority search trees. SIAM J Comput 14(2): 257–276MathSciNetMATHCrossRefGoogle Scholar
- [11]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 UniversityGoogle Scholar
- [12]Nascimento M, Silva J (1998) Towards historical R-rrees. In: Proceedings of the 1998 ACM Symposium on Applied Computing, pp 235–240Google Scholar
- [13]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
- [14]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)Google Scholar