Clustering-Based Materialized View Selection in Data Warehouses

Details Clustering-Based Materialized View Selection in Data Warehouses Clustering-Based Materialized View Selection in Data Warehouses

2007-03-23

arxiv.org/abs/cs/0703114v1

Computer Science

Databases

Scientific paper

Materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be cost-driven and influenced by the workload experienced by the system. In this paper, we propose a framework for materialized view selection that exploits a data mining technique (clustering), in order to determine clusters of similar queries. We also propose a view merging algorithm that builds a set of candidate views, as well as a greedy process for selecting a set of views to materialize. This selection is based on cost models that evaluate the cost of accessing data using views and the cost of storing these views. To validate our strategy, we executed a workload of decision-support queries on a test data warehouse, with and without using our strategy. Our experimental results demonstrate its efficiency, even when storage space is limited.

Affiliated with

Also associated with

No associations

Rating

Clustering-Based Materialized View Selection in Data Warehouses does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering-Based Materialized View Selection in Data Warehouses, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering-Based Materialized View Selection in Data Warehouses will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-164543