The temporal query language TQuel
ACM Transactions on Database Systems (TODS)
A temporal relational model and a query language
Information Sciences: an International Journal
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Fundamentals of database systems (2nd ed.)
Fundamentals of database systems (2nd ed.)
The time index+: an incremental access structure for temporal databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Temporal databases: access structures, search methods, migration strategies, and declustering techniques
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Indexing Methods for Temporal Relations
IEEE Transactions on Knowledge and Data Engineering
Partitioning of Time Index for Optical Disks
Proceedings of the Eighth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Time Index: An Access Structure for Temporal Data
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Managing Temporal Financial Data in an Extensible Database
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Grow and Post Index Trees: Roles, Techniques and Future Potential
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
| Hi-index | 0.00 |
In this paper, we propose a new indexing structure, called the TI/R-tree, which combines techniques used in temporal access structures with techniques used in spatial access structures to provide a suitable means for maintaining and retrieving the history of geographic data.The TI/R-tree uses features from both the time index [ElWK90, Kour94] and the R-tree [Gutt84]. It has a tree structure similar to the time index and maintains a set of linearly ordered indexing points on the time dimension. The leaf nodes of the TI/R-tree refer to logical buckets which are organized as incremental R-trees; that is, at certain time points only deltas are kept. This permits the reconstruction of R-trees at any time point by using a number of logical buckets.