Modified R-MVB tree and BTV algorithm used in a distributed spatio-temporal data warehouse

Authors:
Marcin Gorawski;Michal Gorawski
Affiliations:
Silesian University of Technology, Institute of Computer Science, Gliwice, Poland;Silesian University of Technology, Institute of Computer Science, Gliwice, Poland
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 8
Cited 3

An asymptotically optimal multiversion B-tree

The VLDB Journal — The International Journal on Very Large Data Bases
Spatial queries in dynamic environments

ACM Transactions on Database Systems (TODS)
Range Aggregate Processing in Spatial Databases

IEEE Transactions on Knowledge and Data Engineering
Parallel Telemetric Data Warehouse Balancing Algorithm

ISDA '05 Proceedings of the 5th International Conference on Intelligent Systems Design and Applications
On-Line Balancing of Horizontally-Range-Partitioned Data in Distributed Spatial Telemetric Data Warehouse

DEXA '06 Proceedings of the 17th International Conference on Database and Expert Systems Applications
Materialized aR-Tree in Distributed Spatial Data Warehouse

Intelligent Data Analysis - Analysis of Symbolic and Spatial Data
On efficient storing and processing of long aggregate lists

DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Hybrid index for spatio-temporal OLAP operations

ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems

Extended cascaded star schema for distributed spatial data warehouse

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Selection of structures with grid optimization, in multiagent data warehouse

IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
Adding semantic modules to improve goal-oriented analysis of data warehouses using I-star

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structural and software modifications of MVB-tree (reverse pointers, aggregations) in exchange for higher space consumption enable answering the timestamp and time aggregated queries in a fast and easy way. Software extensions are new algorithms that accelerate query processing. This paper contains a brief description of temporal data and ways of handling them in modified R-MVB tree and presents distributed system in which above-mentioned index was tested along with a load balancing algorithm used in this solution.