Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Fragmentation: a technique for efficient query processing
ACM Transactions on Database Systems (TODS)
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
Snakes and sandwiches: optimal clustering strategies for a data warehouse
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The Aqua approximate query answering system
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A horizontal fragmentation algorithm for the fact relation in a distributed data warehouse
Proceedings of the eighth international conference on Information and knowledge management
Exploiting statistics on query expressions for optimization
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Horizontal data partitioning in database design
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Approximate Query Answering Using Data Warehouse Striping
Journal of Intelligent Information Systems - Special issue on data warehousing and knowledge discovery
WARLOCK: A Data Allocation Tool for Parallel Warehouses
Proceedings of the 27th International Conference on Very Large Data Bases
An Iterative Method for Distributed Database Design
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Sampling-Based Estimation of the Number of Distinct Values of an Attribute
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Fast Approximate Answers to Aggregate Queries on a Data Cube
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
Dynamic Histograms: Capturing Evolving Data Sets
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
AutoPart: Automating Schema Design for Large Scientific Databases Using Data Partitioning
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Arranging fact table records in a data warehouse to improve query performance
Computers and Operations Research
Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution
IEEE Transactions on Knowledge and Data Engineering
Experimental evidence on partitioning in parallel data warehouses
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Parallel OLAP with the Sidera server
Future Generation Computer Systems
An evolutionary approach to schema partitioning selection in a data warehouse
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
An evolutionary approach to materialized views selection in a datawarehouse environment
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Hi-index | 0.00 |
The large size of a data warehouse and the complexity of OLAP queries constitute query performance challenges. Several techniques have been developed to reduce query response time. Data fragmentation improves significantly data management, accessibility and query execution time. Optimal fragmentation schema is designed from workload gathered from data exploitation. So, in context of relational-and object-oriented databases these techniques remain adapted because the workload is almost stable. However, the specific characteristics of data warehouse and more particularly the nature of OLAP queries makes data model and workload very dynamic and consequently an ineffective designed fragmentation schema. To achieve this problem, we propose in this paper an approach based on exploitation of recent statistical data access for dynamic data fragmentation in data warehouse.