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
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth 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
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Spatial hierarchy and OLAP-favored search in spatial data warehouse
DOLAP '03 Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
Relational extensions for OLAP
IBM Systems Journal
The Data Warehouse Lifecycle Toolkit
The Data Warehouse Lifecycle Toolkit
Hi-index | 0.00 |
Spatio-temporal OLAP is an operation providing the spatial hierarchy and the temporal hierarchy for decision making. In this paper, we propose the extended R-tree for spatio-temporal OLAP operations. The proposed method focuses on using a hybrid index of the extended aggregation R-tree and the temporal hash table. The aggregation R-tree is extended for the spatial hierarchy, which is based on the R-tree. It provides a pre-aggregation for fast retrieval of aggregated values. For a temporal hierarchy, the temporal hash table has buckets which are added levels of temporal unit. It is transformed for the temporal hierarchy. It provides pre-aggregation of each temporal unit as year, month and so on. The proposed method supports spatio-temporal analysis since it provides the spatio-temporal hierarchy and the pre-aggregated value.