The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - June (1993 vol.5)
pp: 496-509
ABSTRACT
<p>The primary issues that affect the design of indexing methods are examined, and several structures and algorithms for specific cases are proposed. The append-only tree (AP-tree) structure indexes data for append-only databases to help event-join optimization and queries that can exploit the inherent time ordering of such databases. Two variable indexing for the surrogate and time is discussed. It is shown that a nested index could be a very efficient structure in this context and is preferable to a composite B-tree or an index that involves linear lists of historical tuples. The problems of indexing time intervals, as related to nonsurrogate joint-indexing, are discussed. Several algorithms to partition the time line are introduced. A two-variable AT index based on nested indexing is outlined.</p>
INDEX TERMS
append-only tree structure; indexing methods; temporal relations; structures; algorithms; append-only databases; event-join optimization; inherent time ordering; nested index; linear lists; historical tuples; indexing; temporal databases
CITATION
A. Segev, H. Gunadhi, "Efficient Indexing Methods for Temporal Relations", IEEE Transactions on Knowledge & Data Engineering, vol.5, no. 3, pp. 496-509, June 1993, doi:10.1109/69.224200
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool