Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The design of relational databases
The design of relational databases
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On the complexity of the view-selection problem
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A relational model of data for large shared data banks
Communications of the ACM - Special 25th Anniversary Issue
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Materialized View Selection for Multi-Cube Data Models
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Materialized Views Selection in a Multidimensional Database
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Materialized View Selection for Multidimensional Datasets
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Conditional Dependencies for Horizontal Decompositions
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Condensed Cube: An Efficient Approach to Reducing Data Cube Size
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Normalising OLAP cubes for controlling sparsity
Data & Knowledge Engineering
Extracting semantics from data cubes using cube transversals and closures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
General purpose database summarization
VLDB '05 Proceedings of the 31st international conference on Very large data bases
On solving the view selection problem in distributed data warehouse architectures
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
A sophisticate's introduction to database normalization theory
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Quotient cube: how to summarize the semantics of a data cube
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Extending dependencies with conditions
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On generating near-optimal tableaux for conditional functional dependencies
Proceedings of the VLDB Endowment
Discovering data quality rules
Proceedings of the VLDB Endowment
A view selection algorithm with performance guarantee
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Variance aware optimization of parameterized queries
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Automated Physical Database Design and Tuning
Automated Physical Database Design and Tuning
Revisiting the partial data cube materialization
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
A formal model for the problem of view selection for aggregate queries
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
Functional dependencies (FD's) are a powerful concept in data organization. They have been proven very useful in e.g., relational databases for reducing data redundancy. Little work however has been done so far for using them in the context of data cubes. In the present paper, we propose to characterize the parts of a data cube to be materialized with the help of the FD's present in the underlying data. For this purpose, we consider two applications: (i) how to choose the best cuboids of a data cube to materialize in order to guarantee a fixed performance of queries and, (ii) how to choose the best tuples, hence partial cuboids, in order to reduce the size of the data cube without loosing information. In both cases we show how FD's are fundamental.