A Triangular Decomposition Access Method for Temporal Data - TD-tree

In this study, we investigate and present a new index structure, Triangular Decomposition Tree (TD-tree), which can efficiently store and query temporal data in modern database applications. TD-tree is based on spatial representation of interval data and a recursive triangular decomposition of this space. A bounded number of intervals are stored in each leaf of the tree, which hence may be unbalanced. We describe the algorithms used with this structure. A single query algorithm can be applied uniformly to different query types without the need of dedicated query transformation. In addition to the advantages related to the usage of a single query algorithm for different query types and better space complexity, the empirical performance of the TD-tree is demonstrated to be superior to its best known competitors. Also, presented concept can be extended to more dimensions and therefore applied to efficiently manage spatio-temporal data.

[1]  Chuan-Heng Ang,et al.  The Interval B-Tree , 1995, Inf. Process. Lett..

[2]  John Thornton,et al.  An Efficient Method for Indexing Now-relative Bitemporal data , 2004, ADC.

[3]  C. J. Date,et al.  Temporal data and the relational model , 2002 .

[4]  Kostas Tsichlas,et al.  Fully persistent B-trees , 2012, SODA.

[5]  Richard T. Snodgrass,et al.  Developing Time-Oriented Database Applications in SQL , 1999 .

[6]  Vassilis J. Tsotras,et al.  Comparison of access methods for time-evolving data , 1999, CSUR.

[7]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[8]  Curtis E. Dyreson,et al.  Efficiently Supporting Temporal Granularities in a DBMS , 1995 .

[9]  Abdul Sattar,et al.  A novel approach to model NOW in temporal databases , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[10]  Michael Stonebraker,et al.  Segment indexes: dynamic indexing techniques for multi-dimensional interval data , 1991, SIGMOD '91.

[11]  Dieter Pfoser,et al.  Indexing Valid Time Databases Via B -trees – The MAP21 Approach , 2003 .

[12]  Beng Chin Ooi,et al.  Indexing Temporal Data Using Existing B+-Trees , 1996, Data Knowl. Eng..

[13]  Ramez Elmasri,et al.  The Time Index and the Monotonic B+-tree , 1993, Temporal Databases.

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

[15]  Hans-Peter Kriegel,et al.  Managing Intervals Efficiently in Object-Relational Databases , 2000, VLDB.

[16]  Vassilis J. Tsotras,et al.  Efficient Management of Time-Evolving Databases , 1995, IEEE Trans. Knowl. Data Eng..

[17]  Peter Z. Kunszt,et al.  Indexing the Sphere with the Hierarchical Triangular Mesh , 2007, ArXiv.

[18]  Sridhar Ramaswamy.  Efficient Indexing for Constraint and Temporal Databases , 1997, ICDT.

[19]  Abdul Sattar,et al.  Indexing Temporal Data with Virtual Structure , 2010, ADBIS.

[20]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[21]  Mario A. Nascimento,et al.  Indexing Valid Time Databases via B+-Trees , 1999, IEEE Trans. Knowl. Data Eng..

[22]  Eric Mays,et al.  Fully persistent B+-trees , 1991, SIGMOD '91.

[23]  Christos Faloutsos,et al.  Designing Access Methods for Bitemporal Databases , 1998, IEEE Trans. Knowl. Data Eng..

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

[25]  Hans-Peter Kriegel,et al.  Object-Relational Indexing for General Interval Relationships , 2001, SSTD.

[26]  Ramez Elmasri,et al.  The time index+: an incremental access structure for temporal databases , 1994, CIKM '94.

[27]  Christos H. Papadimitriou,et al.  On the analysis of indexing schemes , 1997, PODS '97.

[28]  Thomas Seidl,et al.  Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases , 2005, VLDB.