Data Management in Cloud, Grid and P2P Systems; Conference paper. Incremental Algorithms for Selecting Horizontal Schemas of Data Warehouses: The Dynamic Case.
This paper proposes and experimentally assess an incremental approach for selecting data warehouse fragmentation schemes using genetic algorithms.
Following this main consideration, in this paper we propose and experimentally assess an incremental approach for selecting data warehouse fragmentation schemes ...
Incremental Algorithms for Selecting Horizontal Schemas of Data Warehouses: The Dynamic Case. https://doi.org/10.1007/978-3-642-40053-7_2 ·.
Incremental algorithms for selecting horizontal schemas of data warehouses: The dynamic case · Bellatreche Ladjel;Bouchakri Rima;Cuzzocrea Alfredo;Maabout Sofian.
... Incremental Algorithms for Selecting Horizontal Schemas of Data Warehouses. Proc. 6th International Conference on Data Management in Cloud, Grid and P2P ...
Missing: Dynamic Case.
Horizontal Data Partitioning is an optimization technique well suited to optimize star-join queries in Relational Data Warehouses.
Incremental Algorithms for Selecting Horizontal Schemas of Data Warehouses: The Dynamic Case. Lecture notes in computer science, v.8059, 2013년, pp.13 - 25.
An algorithm for querying linked data using Map-Reduce ... Incremental Algorithms for Selecting Horizontal Schemas of Data Warehouses: The Dynamic Case
In this paper, we propose an incremental selection of fragmentation schemes using on genetic algorithms. Intensive experiments are conducted to validate our ...