A Framework for the View Selection Problem in Data Warehousing Environment
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 9
Abstract
A set of essential new concepts and tools have evolved into a new technology that makes it possible to access and produce accurate and timely management information for the competitive world. The phrase that has come to characterize this new technology is Data Warehousing (DW). The general problem of selecting an appropriate set of views to materialize is called the materialized view selection problem. In order to acquire a precise and quick response to an analytical query, proper selection of the views to materialize in the data warehouse is crucial. In traditional view selection algorithms, all relations are considered for selection as materialized views. Due to the space constraint and maintenance cost constraint, the materialization of all views is not possible. The primary goal of data warehousing is to select a suitable set of views that minimizes the total cost associated with the materialized views. In this paper, we present a framework, an optimized version of our previous work, for the view selection problem, which intends to achieve the best combination of low query processing cost, low view maintenance cost and good query response. All the cost metrics associated with the materialized views selection that comprise the query execution frequencies, base-relation update frequencies, query access costs, view maintenance costs and the system’s storage space constraints are considered by this framework. This framework optimizes the maintenance, storage and query processing cost and selects the most cost effective views to materialize. Thus, an efficient data warehousing system is the outcome.
Authors and Affiliations
B. Ashadevi , Dr. R. Balasubramanian , Dr. P. Navaneetham
Keywords
Related Articles
- EP ID EP155320
- DOI -
- Views 130
- Downloads 0
Association Rules Extraction from Incremental Databases through ICPT
Association Rule Mining is an important task in data mining. This paper proposes two stage ICPT (Incremental Compact Pattern Tree) Construction Methodology. This methodology facilitates to obtain incidental association r...
WebParF:A Web Partitioning Framework for Parallel Crawler
With the ever proliferating size and scale of the WWW [1], efficient ways of exploring content are of increasing importance. How can we efficiently retrieve information from it through crawling? And in this “era of tera”...
Face Recognition Technique Using PCA, Wavelet and SVM
We present a method of face recognition in which features are extracted by applying Principal component analysis on wavelet subband. Support vector machine and nearest distance methods are used for classification. Result...
Invariant Moments based War Scene Classification using ANN and SVM: A Comparative Study
In this paper we are trying to classify a war scene from the natural scene. For this purpose two set of image categories are taken viz., opencountry & war tank. By using Invariant Moments features are extracted from...
Relation based Ontology Matching using Alignment Strategies
The set of relation within a knowledge domain will be expressed with a help of Ontology, but data within the knowledge domain get scattered all over its space. To get a most precise result there must be necessary to rela...