On solving the view selection problem in distributed data warehouse architectures

Authors:
Andreas Bauer;Wolfgang Lehner
Affiliations:
T-System Nova GmbH;Dresden University of Technology
Venue:
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
Year:
2003

Citing 0
Cited 7

Replica placement in adaptive content distribution networks

Proceedings of the 2004 ACM symposium on Applied computing
Estimating querying and maintenance costs for restructuring data cubes

DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
Towards materialized view selection for distributed databases

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A metamorphosis algorithm for the optimization of a multi-node OLAP system

EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
The M-OLAP cube selection problem: a hyper-polymorphic algorithm approach

IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
A survey of view selection methods

ACM SIGMOD Record
Using functional dependencies for reducing the size of a data cube

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

OLAP(On-Line Analytical Processing) servers usually precompute data cubes to improve the response time of possible aggregate queries over cuboids with different grouping attributes. To reduce the huge size of a sparse data cube, the base single tuples ...