The temporal query language TQuel
ACM Transactions on Database Systems (TODS)
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
Towards an analysis of range query performance in spatial data structures
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Semantics of time-varying information
Information Systems
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the semantics of “now” in databases
ACM Transactions on Database Systems (TODS)
Overlapping linear quadtrees: a spatio-temporal access method
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A foundation for representing and querying moving objects
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Temporal Specialization and Generalization
IEEE Transactions on Knowledge and Data Engineering
The Effect of Buffering on the Performance of R-Trees
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
R-Tree Based Indexing of Now-Relative Bitemporal Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Specifications for Efficient Indexing in Spatiotemporal Databases
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Benchmarking Spatial Joins À La Carte
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Efficient Index Structures for Spatio-Temporal Objects
DEXA '00 Proceedings of the 11th International Workshop on Database and Expert Systems Applications
Light-Weight Indexing of General Bitemporal Data
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Modification semantics in now-relative databases
Information Systems
Supporting frequent updates in R-trees: a bottom-up approach
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
The RUM-tree: supporting frequent updates in R-trees using memos
The VLDB Journal — The International Journal on Very Large Data Bases
Data management challenges for computational transportation
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
Journal of Intelligent Information Systems
Hi-index | 0.00 |
Real-world entities are inherently spatially and temporally referenced, and database applications increasingly exploit databases that record the past, present, and anticipated future locations of entities, e.g., the residences of customers obtained by the geo-coding of addresses. Indices that efficiently support queries on the spatio-temporal extents of such entities are needed. However, past indexing research has progressed in largely separate spatial and temporal streams. Adding time dimensions to spatial indices, as if time were a spatial dimension, neither supports nor exploits the special properties of time. On the other hand, temporal indices are generally not amenable to extension with spatial dimensions. This paper proposes the first efficient and versatile index for a general class of spatio-temporal data: the discretely changing spatial aspect of an object may be a point or may have an extent; both transaction time and valid time are supported, and a generalized notion of the current time, now, is accommodated for both temporal dimensions. The index is based on the R $^*$-tree and provides means of prioritizing space versus time, which enables it to adapt to spatially and temporally restrictive queries. Performance experiments are reported that evaluate pertinent aspects of the index.