Temporal Indexes Supporting Valid Time

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.

[1]  Ramez Elmasri,et al.  The Time Index: An Access Structure for Temporal Data , 1990, VLDB.

[2]  Ramez Elmasri,et al.  M-IVTT: An Index for Bitemporal Databases , 1996, DEXA.

[3]  Christian S. Jensen,et al.  Light-weight indexing of general bitemporal data , 2000, Proceedings. 12th International Conference on Scientific and Statistica Database Management.

[4]  Bernhard Seeger,et al.  An asymptotically optimal multiversion B-tree , 1996, The VLDB Journal.

[5]  Christos Faloutsos,et al.  Access Methods for Bi-Temporal Databases , 1995, Temporal Databases.

[6]  H. Edelsbrunner A new approach to rectangle intersections part I , 1983 .

[7]  Christian S. Jensen,et al.  R-Tree Based Indexing of Now-Relative Bitemporal Data , 1998, VLDB.

[8]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[9]  Ralf Hartmut Güting,et al.  External segment trees , 1994, Algorithmica.

[10]  Arie Segev,et al.  Efficient Indexing Methods for Temporal Relations , 1993, IEEE Trans. Knowl. Data Eng..

[11]  Mario A. Nascimento,et al.  Towards historical R-trees , 1998, SAC '98.