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 120
- Downloads 0
CHOICES ON DESIGNING GF (P) ELLIPTIC CURVE COPROCESSOR BENEFITING FROM MAPPING HOMOGENEOUS CURVES IN PARALLEL MULTIPLICATIONS
Modular inversion operation is known to be the most time consuming operation in ECC field arithmetic computations. In addition, Many ECC designs that use projective coordinates over GF (p) have not considered different f...
Healthcare Service Sector: Classifying and Finding Cancer spread pattern in Southern India Using Data Mining Techniques
Data mining has evolved from an experimental analysis to a predicting methodology due to highly precise algorithms and high performance data mining tools. Knowledge discovery in database has been used to predict survivab...
Locating ATMs in Urban Areas
In recent years, the banks and financial institutions have considerably attempted to provide better and more varied services to the customers. These varied services may satisfy needs of different group of customers. In t...
Ultrasonic Sensor Based 3D Mapping & Localization
This article provides a basic level introduction to 3D mapping using sonar sensors and localization. It describes the methods used to construct a low-cost autonomous robot along with the hardware and software used as wel...
Semantic Inference Model For DatabaseInference Detection Violation
Database Security has become a major problem in modern day’s applications. Generally for Information security everybody tries to protect sensitive data by using different security techniques. Despite these security measu...