Abstract

Abstract-The size of temporal databases and the semantics cases are subsequently investigated: 1) Dynamic structures for of temporal queries pose challenges for the design of efhcient indexing methods. The primary issues that affect the design of indexing methods are examined, and propose several structures and algorithms for specific cases. Indexing methods for timebased queries are developed, queries on the surrogate or timesurrogate and time indexing (ST); 2) Static and dynamic partitioning algorithms for the time-line in the context of temporal attribute and time indexing; and 3) Time-indexing for append-only database. In all the designs, the focus is on invariant key and time, and temporal attribute and time. In the the role of the time attribute. latter case, several methods are presented that partition the timeline, in order to balance the distribution of tuple-pointers within the index. The methods are analyzed against alternatives, and present appropriate empirical results. Index Terms-Indexing, physical organization, query processing, searching, temporal databases. The paper is organized as follows. In Section II, we discuss the relational representation of data in the temporal context, followed by a framework for analyzing the physical design of a temporal database. In Section III, we introduce the APtree, which is designed for time-based query operations on an append-only database, and is subsequently incorporated into our surrogate-time index of Section IV. In Section V, we I.

Citations