An overview of data warehousing and OLAP technology
ACM SIGMOD Record
View relevance driven materialized view selection in data warehousing environment
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Selection of Views to Materialize Under a Maintenance Cost Constraint
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Algorithms for Materialized View Design in Data Warehousing Environment
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
What Difference Heuristics Make: Maintenance-Cost View-Selection Revisited
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Dynamic sample selection for approximate query processing
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
GPIVOT: Efficient Incremental Maintenance of Complex ROLAP Views
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Efficient Approximate Query Processing in Peer-to-Peer Networks
IEEE Transactions on Knowledge and Data Engineering
An Incremental View Materialization Approach in ORDBMS
ITC '10 Proceedings of the 2010 International Conference on Recent Trends in Information, Telecommunication and Computing
A new scale for attribute dependency in large database systems
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
| Hi-index | 0.00 |
Quick response time and accuracy are important factors in the success of any database. In large databases particularly in distributed database, query response time plays an important role as timely access to information and it is the basic requirement of successful business application. A data warehouse uses multiple materialized views to efficiently process a given set of queries. The materialization of all views is not possible because of the space constraint and maintenance cost constraint. Materialized views selection is one of the crucial decisions in Database management system for optimal efficiency. Selecting a suitable set of views that minimizes the total cost associated with the materialized views is the key component in data warehousing. Materialized views are found useful for fast query processing. This paper gives the results of proposed tree based materialized view selection algorithm for query processing. In distributed environment where database is distributed over the nodes on which query should get executed & also plays an important role. This paper also proposes node selection method for fast materialized view selection in peer to peer environment. And It is found that the proposed methodology performs well as compared to other materialized view selection strategies.