• Asia pacific journal of information systems
• /
• v.13 no.4
• /
• pp.191-206
• /
• 2003

More views in data warehouse, can respond to the users more rapidly because the user's requests might be processed by accessing only the materialized views with higher probabilities rather than accessing base relations. But, the update duration for maintaining materialized views limits the number of materialized views in data warehouse. In this paper, we propose the algorithm for reducing update duration of materialized views, of which aggregation functions are maintained by self-maintenance. We also implement the proposed algorithm and evaluate the performance of the algorithm.

• Asia pacific journal of information systems
• /
• v.5 no.2
• /
• pp.131-142
• /
• 1995

In distributed database systems materialized views are useful to solve many problems caused by data replication. This paper deals with the problem of updating materialized views incluing join operations. We use a differential update which uses logs that record the change of base tables in certain periods. This method avoids locking of the base tables so that it makes the system more efficient. We update materialized views periodically to save the updating cost envolved. A screen test is applied to differential files to eliminate tuples that are irrelevant to any of the views being updated. Using these methods, a detailed procedure is addressed to refresh materialized views. Then we show that our update procedure performs better than a semijoin approach.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1336-1345
• /
• 2002

Materialized views in data warehouse play important roles in rapidly answering to users's requests for information Processing. More views in data warehouse, can respond to the users more rapidly because the user's requests may be processed by using only the materialized views with higher probabilities rather than accessing base relations. The limited duration, during which the materialized views are updated due to base relations's changes, limits the number of materialized views in data warehouse. In this paper, we propose efficient policy for updating the materialized views, which can save the update duration of views although MIN/MAX values frequently change in base relation. The policy updates the materialized views by distinguishing whether MIN/MAX values's changes in the base relation are insert value or delete value. Then, the number of accesses to the base relation is descreased when updating the MIN/MAX values in the materialized views.

• The KIPS Transactions:PartD
• /
• v.13D no.6 s.109
• /
• pp.797-806
• /
• 2006

In the data warehouse environment, materialized views are typically used to support efficient query processing. Materialized views need to be updated when source data change. Since the update of the views need impose a significant overhead, it is essential to update the views efficiently. Though various view maintenance strategies have been discussed in the past, the efficient maintenance of SPJ materialized views has not been sufficiently investigated. In this paper, we propose an efficient incremental view maintenance method for SPJ materialized views that minimizes the total accesses to data sources. The proposed method finds an optimal view maintenance strategy using a dynamic programming algorithm. We also present various experimental results that shows the efficiency of our proposed method.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.917-926
• /
• 2003

More views in data warehouse, can respond to the users more rapidly because the user's requests may be processed by utilizing only the materialized views with higher probabilities rather than accessing base relations. But, more views cause longer update duration of all the materialized views. During the update time, queries of users can not be processed because accesses to the datawarehouse are blocked. Thus, the update durations of the materialized views are necessary to be reduced. In this paper, we propose algorithm the update duration of the materialized views owing to managing by distinguishing insecton/deletion operations. Though there might overheads for distinguishing insertion/deletion, we concluded that the proposed algorithm could be excellent than others.

• The Journal of Society for e-Business Studies
• /
• v.11 no.4
• /
• pp.33-48
• /
• 2006

Since the emergence of XML as the standard for data exchange on the Web, XML warehousing technology is required to efficiently support Web business applications such as e-Commerce. When the RDBMS is employed as the storage for XML warehouse, XML materialized views of the XML warehouse could be provided by leveraging the materialized views of the RDBMS Because XML documents are mapped into relational tuples, an XML query defining an XML materialized view needs to be transformed into SQL. If relational materialized views were defined with the transformed SQL statements, the XML materialized view could be obtained just by XML-tagging the tuples of the corresponding relational materialized views. The foremost advantage of such a scheme is that the RDBMS does take care of XML materialized view consistency except XML tagging whenever their source XML documents are updated. In this paper, we proposed such a scheme of providing XML materialized views, and implemented it using a commercial RDBMS equipped with materialized view facility in Java on Windows 2000 Professional environment. XML documents in TPC-W, Web e-Commerce Benchmark, were used in performance experiments. The experimental results showed that our proposed scheme for XML materialized views was very effective.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.67-75
• /
• 2006

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. However, materializing all relations rather than a part results in much worse performance in terms of time and space costs. Therefore, we present an improved algorithm for selection of views to materialize using the clustering method to overcome the problem resulting from conventional view selection algorithms. In the presented algorithm, ASVMRT (Algorithm for Selection of Views to Materialize using Reduced Table), we first generate reduced tables in the data warehouse using clustering based on attribute-values density, and then we consider the combination of reduced tables as materialized views instead of a combination of the original base relations. For the justification of the proposed algorithm, we reveal the experimental results in which both time and space costs are approximately 1.8 times better than conventional algorithms.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.327-338
• /
• 2001

The view can provide the user an appropriate portion of the database through data integration and filtering. Views can be materialized for query performance improvement, and in that cse, their consistency needs to be maintained against the updates of the underlying data. They can be either recomputed or incrementally refreshed by reflecting the relevant updates. Since XML could represent the structural information of the documents, for the XML materialized views, new techniques that differ from the previous ones for incrementally refreshing the relational views are required. In this paper, we propose a framework of XML materialized view management where the XML view derived from the underlying XML documents are materialized and incrementally refreshed against the updates of the underlying documents.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.661-670
• /
• 2003

Materialized views which are stored views of the database offer opportunities for significant performance gain in query valuation by providing fast access to pre-computed data. The question of when and how to use a materialized view in processing a given query is a difficult one attracting a significant amount of research. Whether a materialized view can be used in answering a query depends on the relationship between the view and the query. Proposed in this paper are new ways of utilizing materialized views in answering a query. Semantic relationships are used in addition to syntactic ones. We also utilize a materialized view in answering a query even if it has relations unrelated to the query. We first show the conditions for testing whether a materialized view can be utilized in answering a query and then present the algorithms for testing the conditions and reformulating a query with a materialized view.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.387-398
• /
• 2003

Materialized views have received much attention for query performance improvement. They need to be refreshed whenever their underlying data sources are updated. They could be recomputed from scratch or they could be incrementally refreshed by reflecting only those portions of updates that affect them. With emergence of XML as the standard for data exchange on the Web, active research is under way on effectively storing and retrieving XML documents. In this paper, we describe a performance study on the incremental refresh of XML materialized views for the case where XML documents are stored in a relational DBMS, and XML materialized views are maintained with incremental refresh. We describe implementation of a prototype XML storage system that supports XML materialized views and their incremental refresh, and report the performance results obtained with the implemented system through a detailed set of experiments on the incremental refresh of XML materialized views. The results show that the XML view maintenance with incremental refresh outperforms the ordinary view recomputation.