The design and analysis of spatial data structures
The design and analysis of spatial data structures
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
Overlapping B+trees for temporal data
JCIT Proceedings of the fifth Jerusalem conference on Information technology
On the semantics of “now” in databases
ACM Transactions on Database Systems (TODS)
Advanced database systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
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
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and Data Engineering
R-Tree Based Indexing of Now-Relative Bitemporal Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Specifications for Efficient Indexing in Spatiotemporal Databases
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
Capturing the Uncertainty of Moving-Object Representations
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Access Methods for Bi-Temporal Databases
Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases
Spatio-Temporal Indexing for Large Multimedia Applications
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
A Spatiotemporal Model as the Basis for a Persistent GIS
POS-9 Revised Papers from the 9th International Workshop on Persistent Object Systems
Boundary-Based time partitioning with flattened r-tree for indexing ubiquitous objects
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Design and implementation of an index structure using fixed intervals for tracing of RFID tags
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Time parameterized interval r-tree for tracing tags in RFID systems
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Efficient indexing of moving objects using time-based partitioning with r-tree
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
The SMO-index: a succinct moving object structure for timestamp and interval queries
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
Several applications require management of data which is spatially dynamic, e.g., tracking of battle ships or moving cells in a blood sample. The capability of handling the temporal aspect, i.e., the history of such type of data, is also important. This paper presents and evaluates three temporal extensions of the R-tree, the 3D R-tree, the 2+3 R-tree and the HR-tree, which are capable of indexing spatiotemporal data. Our experiments focus on discretely moving points (i.e., points standing at a specific location for a time period and then moving "instantaneously", and so on and so forth). We explore several parameters, e.g., initial spatial distribution, spatial query area and temporal query length. We found out that the HR-tree usually outperforms the other candidates, in terms of query processing cost, specially when querying time points and small time intervals. However, the main side effect of the HR-tree is its storage requirement, which is much larger than that of the other approaches. To reduce that, we explore a batch oriented updating approach, at the cost of some overhead during query processing time. To our knowledge, this study constitutes the first extensive, though not exhaustive, experimental comparison of access structures for spatiotemporal data.