This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Indexing Methods for Temporal Relations
June 1993 (vol. 5 no. 3)
pp. 496-509

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.

[1] I. Ahn, "Toward an implementation of database management systems with temporal support," inProc. Int. Conf. Data Eng., Feb. 1986, pp. 374-381.
[2] I. Ahn and R. Snodgrass, "Performance evaluation of a temporal data-base management system," inProc. ACM-SIGMOD Conf. Management of Data, May 1987, pp. 96-107.
[3] R. Snodgrass and I. Ahn, "Partitioned storage for temporal databases,"Inform. Syst., vol. 13, no. 4, pp. 369-391, 1988.
[4] G. Ariav, "A temporal oriented data model,"ACM Trans. Database Syst., vol. 11, no. 4, pp. 499-527, Dec. 1986.
[5] J. Clifford and A. Croker, "The historical relational datamodel (HRDM) and algebra based on lifespan,"Data Eng., pp. 528-537, Feb. 1987.
[6] J. Clifford and A. V. Tansel, "On an algebra for historical relational databases: Two views," inProc. ACM SIGMOD, 1985, pp. 247- 265.
[7] H. Gunadhi and A. Segev, "Physical design of temporal databases," Dept. Computing Sci. Res. and Development, Lawrence Berkeley Lab., CA, Tech. Rep. LBL-24 578, Jan. 1988.
[8] H. Gunadhi and A. Segev, "A framework for query optimization in temporal databases," inProc. 5th Int. Conf. Statistical and Scientific Database Management, 1990, pp. 131-147.
[9] H. Guttman, "R-trees: A dynamic index structure for spatial searching," inProc. ACM/SIGMOD Conf., 1984, pp. 47-56.
[10] K. A. Kimball, "Indexing techniques for historical databases," inProc. 5th Int. Conf. Data Eng., 1989, pp. 127-137.
[11] H. P. Kriegel, "Peformance comparison of index structures for multikey retrieval," inProc. ACM-SIGMOD Conf. Management of Data, May 1984, pp. 186-196.
[12] V. Lum, R. Dadam, R. Erbe, J. Guenauer, P. Pistor, G. Walch, H. Werner, and J. Woodfill, "Designing DBMS support for the temporal dimension," inProc. ACM SIGMOD '84, June 1984, pp. 115-130.
[13] S. B. Navathe and R. Ahmed, "TSOL--A language interface for history data bases," inProc. Int. Conf. Temporal Aspects of Inform. Syst., 1987, pp. 113-128.
[14] D. Rotem and A. Segev, "Physical organization of temporal data," inProc. Third Int. Conf. Data Eng., Feb. 1987, pp. 547-553.
[15] A. Segev and H. Gunadhi, "Event-join optimization in temporal relational databases," inProc. VLDB, Aug. 1989.
[16] A. Segev and A. Shoshani, "Logical modeling of temporal data," inProc. ACM-Sigmod Int. Conf. on Management of Data, 1987.
[17] A. Segev and A. Shoshani, "The representation of a temporal data model in the relational environment," presented at the 4th Int. Conf. on Statistical and Scientific Data Manage., June 1988.
[18] A. Shoshani and K. Kawagoe, "Temporal data management," inProc. VLDB, Kyoto, Japan, 1986, pp. 79-88.
[19] R. Snodgrass, "The temporal query language TQuel,"ACM Trans. Database Syst., vol. 12, no. 2, June 1987.
[20] R. Snodgrass and I. Ahn, "A taxonomy of time in databases," inProc. ACM SIGMOD '85, 1985, pp. 236-246.
[21] R. Snodgrass and I. Ahn, "Performance analysis of temporal queries," Dept. of Camp. Sci., Univ. of North Carolina, Chappel-Hill, TempIS Doc. no. 17, Aug. 1987.
[22] Special issue ofBull. Technical Committee on Data Eng., vol. 11, no. 4, 1988.
[23] M. Stonebraker, "The POSTGRES storage system," inProc. 1987 VLDB Conf., Brighton, England, Sept. 1987.
[24] M. Stonebraker and L. Rowe, "The design of POSTGRES," inProc. 1986 ACM-SIGMOD Conf. Management of Data, Washington, DC, May 1986.
[25] M. Stonebraker, T. Sellis, and E. Hanson, "An analysis of rule indexing implementations in data base systems," inProc. Int. Conf. Expert Database Syst., Apr. 1986, pp. 353-364.
[26] T. J. Teorey and J. R. Fry,Design of Database Structures. Englewood Cliffs, NJ: Prentice-Hall, 1982.

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 and Data Engineering, vol. 5, no. 3, pp. 496-509, June 1993, doi:10.1109/69.224200
Usage of this product signifies your acceptance of the Terms of Use.