• 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.9D no.4
• /
• pp.561-570
• /
• 2002

In order to evaluate the performance of incremental update algorithms, we perform experimental tests on the time of updating view objects. In this paper, the incremental update algorithms are evaluated on two kinds of materialized methods : materialization by value-copy and materialization by preserving object identifiers (OIDs). The result of performance evaluation shows that there is little difference in the updating time of view objects between two materialization methods. The evaluation of query processing on spatial views shows that materialization by value-copy is much better than materialization by preserving OIDs. As the results of overall performance evaluation, it is more desirable to use the incremental update method based on materialization by value-copy than the incremental update method based on materialization by preserving OIDs.

• 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.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.533-544
• /
• 2004

Reports have a significant meaning in time-constrained large transaction environments, such as airplane control systems or wargame simulations. This is due to the necessity of generating reports within a given time limit without restraining the operation performance of large transaction environments. In order to generate reports in large transaction environments while satisfying time-constrained requirements, this paper proposes a model which combines the incremental operation mechanism and materialized view mechanism using triggers and stored procedures. Further, the implementation and evaluation of the proposed model provides the Identification of the characteristics of the proposed model.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.175-187
• /
• 2006

The data cube is an aggregation operator that computes group-bys for all possible combination of dimension attributes. %on the number of the dimension attributes is n, a data cube computes $2^n$ group-bys. Each group-by in a data cube is called a cuboid. Data cubes are often precomputed and stored as materialized views in data warehouses. These data cubes need to be updated when source relation change. The incremental maintenance of a data cube is to compute and propagate only its changes. To compute the change of a data cube of $2^n$ cuboids, previous works compute a delta cube that has the same number of cuboids as the original data cube. Thus, as the number of dimension attributes increases, the cost of computing a delta cube increases significantly. Each cuboid in a delta cube is called a delta cuboid. In this paper. we propose an incremental cube maintenance method that can maintain a data cube by using only $_nC_{{\lceil}n/2{\rceil}}$ delta cuboids. As a result, the cost of computing a delta cube is substantially reduced. Through various experiments, we show the performance advantages of our method over previous methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1265-1272
• /
• 2000

A data warehouse is able to accommodate efficient data mining query processing and subsequent response by providing information needed for decision making. In such an environment, the data warehouse stores materialized view derived from various sources to enhance query processing. The compensating algorithm to maintain materialized view is well known for a single source site environment. In the compensating algorithm, several problems arise to get results in view maintenance. The problems are due to the overhead in query management within the data warehouse, increased complexity to manage queries in the warehouse as updates occur and increased volume of message traffic between the data source and the warehouse. In this paper, we propose a new algorithm that reduces the overhead in managing queries for new maintenance and that enhances the correctness. We also measured the performance of the new algorithm by evaluating the performance of the existing recomputing view and compensating algorithm and comparing the results with the proposed algorithm.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.973-986
• /
• 2004

Reports have a significant meaning In large transaction environments, such as advanced the information technology and online environment. This is due to the necessity of generating reports within a giventime limit without restraining the operation performance of large transaction environments. In order to generate reports in large transaction environments while sa!isfying time-constrained requirements, this paper proposes a model which combines the incremental operation mechanism and materialized view mechanism using triggers and stored procedures. Further, the implementation and evaluation of the proposed model provides the identification of the characteristics of the proposed model.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.243-245
• /
• 2000

W3C(World Wide Web Consortium)가 XML(eXtensible Markup Language)을 차세대 웹 문서 표준으로 제안하면서 많은 응용에서 XML을 사용하려는 다양한 연구가 진행되고 있다. 뷰는 이질적인(heterogeneous) 데이터의 통합 및 여과(filtering) 기능을 통해서 사용자가 요구하는 데이터를 제공한다. 뷰의 구현 기법 중에서 실체 뷰(materialized view)는 뷰의 내용을 직접 저장하는 기법으로서, 사용자의 질의에 빠른 응답시간을 제공할 수 있다. 그러나 실체 뷰는 하부 데이터베이스가 변경되었을 경우에 일관성을 유지해야 하는 오버헤드가 있다. XML은 문서의 구조정보를 나타낼 수 있으므로 기존의 관계 데이터베이스와 객체지향 데이터베이스 등에서 연구되었던 실체 뷰 관리 기법과는 다른 XML 실체 뷰 관리 기법이 요구된다. 본 논문에서는 XML 문서를 대상으로 XML 실체 뷰를 지원하고, 데이터베이스에 저장된 XML 문서가 수정되었을 경우에 XML 실체 뷰에 대해 점진적 갱신(incremental refresh)을 지원하는 XML 실체 뷰 관리 프레임워크(framework)를 제안하였다.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.463-474
• /
• 2009

To analyze multidimensional data conveniently and efficiently, OLAP (On-Line Analytical Processing) systems or e-business are widely using views in a horizontal form to represent measurement values over multiple dimensions. These views can be stored as materialized views derived from several sources in order to support accesses to the integrated data. The horizontal views can provide effective accesses to complex queries of OLAP or e-business. However, we have a problem of occurring maintenance of the horizontal views since data sources are distributed over remote sites. We need a method that propagates the changes of source tables to the corresponding horizontal views. In this paper, we address incremental maintenance of horizontal views that makes it possible to reflect the changes of source tables efficiently. We first propose an overall framework that processes queries over horizontal views transformed from source tables in a vertical form. Under the proposed framework, we propagate the change of vertical tables to the corresponding horizontal views. In order to execute this view maintenance process efficiently, we keep every change of vertical tables in a differential file and then modify the horizontal views with the differential file. Because the differential file is represented as a vertical form, its tuples should be converted to those in a horizontal form to apply them to the out-of-date horizontal view. With this mechanism, horizontal views can be efficiently refreshed with the changes in a differential file without accessing source tables. Experimental results show that the proposed method improves average performance by 1.2$\sim$5.0 times over the existing methods.

• Earthquakes and Structures
• /
• v.20 no.2
• /
• pp.201-213
• /
• 2021

Contrast to the conventional jointed bridge design, integral abutment bridges (IABs) offer some marked advantages like reduced maintenance and enhanced service life of the structure due to elimination of joints in the deck and monolithic construction practices. However, the force transfer mechanism during seismic and thermal movements is a topic of interest owing to rigid connection between superstructure and substructure (piers and abutments). This study attempts to model an existing IAB by including the abutment backfill interaction and soil-foundation interaction effects using Winkler foundation assumption to determine its seismic response. Keeping in view the significance of abutment behavior in an IAB, the probability of damage to the abutment is evaluated using fragility function. Incremental Dynamic Analysis (IDA) approach is used in this regard, wherein, nonlinear time history analyses are conducted on the numerical model using a selected suite of ground motions with increasing intensities until damage to abutment. It is concluded from the fragility analysis results that for a MCE level earthquake in the location of integral bridge, the probability of complete damage to the abutment is minimal.