EFFICIENT INDEXING METHODS FOR TEMPORAL RELATIONS

The size of temporal databases and the semantics of temporal queries p ose challenges for the design of efficient indexing methods. The prima ry issues that affect the design of indexing methods are examined, and propose several structures and algorithms for specific cases. Indexin g methods for time-based queries are developed, queries on the surroga te or time-invariant key and time, and temporal attribute and time. In the latter case, several methods are presented that partition the tim e-line, in order to balance the distribution of tuple-pointers within the index. The methods are analyzed against alternatives, and present appropriate empirical results.