Materialized View Driven Architecture over Lattice of Cuboids in Data Warehouse

2021 ◽  
Author(s):  
Partha Ghosh ◽  
Takaaki Goto ◽  
Jyotsna Kumar Mandal ◽  
Soumya Sen
Keyword(s):  
Data Warehouse ◽  
Materialized View

Materialized View Selection in the Data Warehouse

2010 ◽  
Vol 29-32 ◽  
pp. 1133-1138 ◽  
Author(s):  
Li Juan Zhou ◽  
Hai Jun Geng ◽  
Ming Sheng Xu
Keyword(s):  
Decision Support ◽  
Data Warehouse ◽  
Materialized Views ◽  
Storage Space ◽  
View Selection ◽  
Materialized View ◽  
Query Response Time ◽  
Materialized View Selection ◽  
Optimal Efficiency ◽  
The Cost

A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing decision-support or OLAP queries. Materialized view selection is one of the crucial decisions in designing a data warehouse for optimal efficiency. The goal is to select an appropriate set of views that minimizes sum of the query response time and the cost of maintaining the selected views, given a limited amount of resource, e.g., materialization time, storage space, etc. In this article, we present an improved PGA algorithm to accomplish the view selection problem; the experiments show that our proposed algorithm shows it’s superior.

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.

Materialized View Selection for Data Warehouse Design

2011 ◽  
pp. 1182-1187 ◽  
Author(s):  
Dimitri Theodoratos ◽  
Wugang Xu ◽  
Alkis Simitsis
Keyword(s):  
Decision Support ◽  
Data Warehouse ◽  
Information Sources ◽  
Distributed Databases ◽  
Materialized Views ◽  
Materialized View ◽  
Other Information ◽  
Materialized View Selection ◽  
On Line ◽  
Analytical Processing

A Data Warehouse (DW) is a repository of information retrieved from multiple, possibly heterogeneous, autonomous, distributed databases and other information sources for the purpose of complex querying, analysis and decision support. Data in the DW are selectively collected from the sources, processed in order to resolve inconsistencies, and integrated in advance (at design time) before data loading. DW data are usually organized multidimensionally to support On-Line Analytical Processing (OLAP). A DW can be abstractly seen as a set of materialized views defined over the source relations. During the initial design of a DW, the DW designer faces the problem of deciding which views to materialize in the DW. This problem has been addressed in the literature for different classes of queries and views and with different design goals.

Research on Materialized Views under Disk-Space Constraint in Data Warehouse

2014 ◽  
Vol 989-994 ◽  
pp. 1955-1958
Author(s):  
Lei Ma
Keyword(s):  
Data Warehouse ◽  
Space Constraint ◽  
Maintenance Cost ◽  
Materialized Views ◽  
Ranking Algorithm ◽  
Disk Space ◽  
View Selection ◽  
Materialized View ◽  
Processing Cost ◽  
Materialized View Selection

Materialized view is an important topic in data warehouse research, and also affects the query efficiency and maintenance cost. The disk-space view-selection problem is to select a set of materialized views for the purpose of minimizing the total query processing cost and the total maintenance cost. In this paper we introduce evolutionary algorithm using stochastic ranking algorithm, which can enable materialized view selection under disk-space constraint. The algorithm improve the stochastic ranking algorithm, which can find a near-optimal feasible solution. This paper use the algorithm in Police data warehouse.

Sign in / Sign up

Export Citation Format

Share Document