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
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
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
Query Processing Techniques for Multiversion Access Methods
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
This paper presents a new method for storage and access to spatiotemporal data. That is spatial objects that have some non-spatial attributes updated asynchronously. An example of such objects may be water meters. Proposed method is a hybrid of well documented dedicated solutions for spatial, temporal, spatial aggregate and temporal aggregate data processing. Thanks to that it was possible to achieve high performance for detailed and aggregate query processing without usage of approximation. Index name (i.e. STAH-tree) is English abbreviation and can be extended as Spatio-Temporal Aggregation Hybrid Tree. Part of this work aims in creation of cost model checked against experimental results of system performance. Some other experiments that verify system behavior were also performed.