Principles of distributed database systems
Principles of distributed database systems
A graph based cluster approach for vertical partitioning in database design
Data & Knowledge Engineering
Handbook of combinatorics (vol. 1)
Handbook of combinatorics (vol. 1)
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A general framework for the view selection problem for data warehouse design and evolution
Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
Analysis and performance of inverted data base structures
Communications of the ACM
New TPC benchmarks for decision support and web commerce
ACM SIGMOD Record
Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems
View selection for designing the global data warehouse
Data & Knowledge Engineering - Data warehousing
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems
IEEE Transactions on Software Engineering
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Materialized Views Selection in a Multidimensional Database
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Aggregate-Query Processing in Data Warehousing Environments
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A Foundation for Multi-dimensional Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Algorithms for Materialized View Design in Data Warehousing Environment
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Research in data warehouse modeling and design: dead or alive?
DOLAP '06 Proceedings of the 9th ACM international workshop on Data warehousing and OLAP
Hybrid greedy and genetic algorithms for optimization of relational data warehouses
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Discovering branching and fractional dependencies in databases
Data & Knowledge Engineering
Improvement of Data Warehouse Optimization Process by Workflow Gridification
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Horizontal partitioning by predicate abstraction and its application to data warehouse design
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Reference model and perspective schemata inference for enterprise data integration
INAP'09 Proceedings of the 18th international conference on Applications of declarative programming and knowledge management
Efficient processing of drill-across queries over geographic data warehouses
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
An integer programming approach for the view and index selection problem
Data & Knowledge Engineering
| Hi-index | 0.01 |
The most effective technique to enhance performances of multidimensional databases consists in materializing redundant aggregates called views. In the classical approach to materialization, each view includes all and only the measures of the cube it aggregates. In this paper we investigate the benefits of materializing views in vertical fragments, aimed at minimizing the workload response time. We formalize the fragmentation problem as a 0-1 integer linear programming problem, which is then solved by means of a standard integer programming solver to determine the optimal fragmentation for a given workload. Finally, we demonstrate the usefulness of fragmentation by presenting a large set of experimental results based on the TPC-H benchmark.