Parallel Consistency Maintenance of Materialized Views Using Referential Integrity Constraints in Data Warehouses

2005 ◽  
pp. 146-156 ◽  
Author(s):  
Jinho Kim ◽  
Byung-Suk Lee ◽  
Yang-Sae Moon ◽  
Soo-Ho Ok ◽  
Wookey Lee
Keyword(s):  
Integrity Constraints ◽  
Materialized Views ◽  
Data Warehouses ◽  
Consistency Maintenance ◽  
Referential Integrity

scholarly journals Materialized views and data warehouses

1998 ◽  
Vol 27 (1) ◽  
pp. 21-26 ◽  
Author(s):  
Nick Roussopoulos
Keyword(s):  
Materialized Views ◽  
Data Warehouses

A Space-Efficient Protocol for Consistency of External View Maintenance on Data Warehouse Systems

2008 ◽  
pp. 3116-3141
Author(s):  
Shi-Ming Huang ◽  
David C. Yen ◽  
Hsiang-Yuan Hsueh
Keyword(s):  
Data Warehouse ◽  
Heterogeneous Data ◽  
Materialized Views ◽  
Data Warehouses ◽  
View Maintenance ◽  
Synchronization Mechanism ◽  
Materialized View ◽  
Heterogeneous Data Sources ◽  
Data Validity ◽  
Data View

The materialized view approach is widely adopted in implementations of data warehouse systems in or-der for efficiency purposes. In terms of the construction of a materialized data warehouse system, some managerial problems still exist to most developers and users in the view resource maintenance area in particular. Resource redundancy and data inconsistency among materialized views in a data warehouse system is a problem that many developers and users struggle with. In this article, a space-efficient protocol for materialized view maintenance with a global data view on data warehouses with embedded proxies is proposed. In the protocol set, multilevel proxy-based protocols with a data compensating mechanism are provided to certify the consistency and uniqueness of materialized data among data resources and materialized views. The authors also provide a set of evaluation experiences and derivations to verify the feasibility of proposed protocols and mechanisms. With such protocols as proxy services, the performance and space utilization of the materialized view approach will be improved. Furthermore, the consistency issue among materialized data warehouses and heterogeneous data sources can be properly accomplished by applying a dynamic compensating and synchronization mechanism. The trade-off between efficiency, storage consumption, and data validity for view maintenance tasks can be properly balanced.

Efficient Computation of Data Cubes and Aggregate Views

2011 ◽  
pp. 421-426
Author(s):  
Leonardo Tininini
Keyword(s):  
Response Times ◽  
Materialized Views ◽  
Data Warehouses ◽  
Efficient Computation ◽  
Huge Amount ◽  
Data Cubes ◽  
Multidimensional Database ◽  
Efficient Calculation ◽  
Fundamental Requirement

This paper reviews the main techniques for the efficient calculation of aggregate multidimensional views and data cubes, possibly using specifically designed indexing structures. The efficient evaluation of aggregate multidimensional queries is obviously one of the most important aspects in data warehouses (OLAP systems). In particular, a fundamental requirement of such systems is the ability to perform multidimensional analyses in online response times. As multidimensional queries usually involve a huge amount of data to be aggregated, the only way to achieve this is by pre-computing some queries, storing the answers permanently in the database and reusing these almost exclusively when evaluating queries in the multidimensional database. These pre-computed queries are commonly referred to as materialized views and carry several related issues, particularly how to efficiently compute them (the focus of this paper), but also which views to materialize and how to maintain them.

Defining Referential Integrity Constraints in Graph-oriented Datastores

2020 ◽  
Author(s):  
Thibaud Masson ◽  
Romain Ravet ◽  
Francisco Ruiz ◽  
Souhaila Serbout ◽  
Diego Ruiz ◽  
...  
Keyword(s):  
Integrity Constraints ◽  
Referential Integrity

Materialized View Selection using Improvement based Bee Colony Optimization

2015 ◽  
Vol 7 (4) ◽  
pp. 35-61 ◽  
Author(s):  
Biri Arun ◽  
T.V. Vijay Kumar
Keyword(s):  
Optimization Algorithm ◽  
Strategic Decision ◽  
Materialized Views ◽  
Data Warehouses ◽  
View Selection ◽  
Bee Colony ◽  
New Information ◽  
Corporate Entity ◽  
Bee Colony Optimization ◽  
Materialized View Selection

In the present information age, data and information are vital not just for the survival of any corporate entity, but also to provide it with an edge over its competitors. Data warehouses have become the foundational databases of almost every corporation. However, extracting new information from these data warehouses takes hours, and even days, which is practically unacceptable. Materialized views have been popularly used to facilitate fast information extraction. However, the selection of appropriate views, which significantly accelerate information synthesis is an NP-Complete problem. The aim of this paper is to select near optimal sets of views for materialization using the improvement bee colony optimization algorithm. The experimental results indicate that the improvement bee colony optimization algorithm performs better than the constructive bee colony optimization algorithm and the fundamental view selection algorithm HRUA. The views thus selected would significantly minimize the response time of analytical queries, when materialized, resulting in efficient strategic decision making.

Sign in / Sign up

Export Citation Format

Share Document