Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Materialized views and data warehouses
ACM SIGMOD Record
Building the Data Warehouse,3rd Edition
Building the Data Warehouse,3rd Edition
View selection using randomized search
Data & Knowledge Engineering
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Automated Selection of Materialized Views and Indexes in SQL Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
A Formal Perspective on the View Selection Problem
Proceedings of the 27th International Conference on Very Large Data Bases
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
Improving query response time in scientific databases using data aggregation -a case study
DEXA '96 Proceedings of the 7th International Workshop on Database and Expert Systems Applications
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
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 |
A materialised view is constructed to improve response time for complex analytical queries posed on a large data warehouse. Most existing approaches use all the queries posed on the data warehouse for constructing materialised views. It is generally observed that, among all the queries posed on the data warehouse in the past, queries that are similar and more frequently posed have high likelihood of being posed again in future and are therefore, appropriate for constructing materialised views. The approach presented in this paper, attempts to select such frequently posed queries from among all the queries posed on the data warehouse. Further, since the materialised views are required to fit within the available storage space, the approach selects a subset of profitable frequent queries that conforms to the space constraint. The information accessed by these queries has high likelihood of being accessed again by future queries. Furthermore, it is experimentally shown that use of this information for constructing materialised views reduces query response time. This in turn would facilitate decision-making.