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

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.99-116
• /
• 2009

For the mapping of two dimensional table structures of relational databases to the hierarchical XML documents, we apply the foreign key relationships of relational databases. In other words, the primary key of another table referenced by a foreign key of one tuple is mapped to the parent of the foreign key. Then XML hierarchies with order are expressed. In addition, the XML view file generated by the foreign key mappings shows side effects in the case of the relational database update for the satisfaction of referential integrity constraint in the foreign key. Thus, by inferring the foreign key roles at the generation of XML hierarchies, we can anticipate where the side effects occur in the hierarchies. We keep the XML view files up-to-date by reflecting the side effects to the XML files at the update of the underlying relational databases.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.265-267
• /
• 2001

일반적으로 효율적인 질의.검색.분석을 수행하기 위해서 이질적이고 분산된 정보 소스들 부터 통합된 정보를 포함한 데이터 저장고를 데이터 웨어하우스라 일컬으며, 이를 웹기술과 접목한 기술을 웹 웨어하우징이라 한다. 본 연구에서는 웹 웨어하우징 기술의 모토가 될 수 있는 기술로서 분산되어 저장된 다양한 소스 데이터에 대해 실체 뷰로 간과되어지는 데이터 웨어하우스에 관한 유지 방법에 관한 연구이다. 본 연구의 성능 평가를 위해서 기존에 알려진 보상알고리즘, 모든 기본 릴레이션에서 키 애트리뷰트들을 포함해야만 하는 스트로브와 이를 완화시켜서 성능향상을 보이는 스윕 알고리즘들을 각각 특성별로 비교하며, 전송된 바이트 수와 갱신된 회수에 따른 성능 평가 및 갱신 유형에 따른 성능 평가를 수행하여 결과를 보인다.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.293-304
• /
• 2004

Recently, caching for the database-backed web applications has received much attention. The results of frequent queries could be cached for repeated reuse or for efficient processing of the relevant queries. Since the emergence of XML as a standard for data exchange on the web, today's web applications are to retrieve information from the remote XML sources across the network, and thus it is desirable to maintain the XML query results in the cache for the web applications. In this paper, we describe implementation of an XML query processing system that supports cache-answerability of XML queries, and evaluate its performance. XML path expression, which is one of the core features of XML query languages including XQuery, XPath, and XQL was considered as the XML query. Their result is maintained as an XML materialized view in the XML cache. The algorithms to rewrite the given XML path expression using its relevant materialized view proposed in [13] were implemented with RDBMS as XML store. The major issues of implementation are described in detail. The results of performance experiments conducted with the implemented system showed effectiveness of cache-answerability of XML queries. Comparison with previous research in terms of performance is also Provided.

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

• Journal of Internet Computing and Services
• /
• v.6 no.4
• /
• pp.59-73
• /
• 2005

Caching query results and reusing them in processing of subsequent queries is an important query optimization technique. Materialized view and view indexing are the representative examples of such a technique. The two schemes had received much attention for relational databases, and have been investigated for XML data since XML emerged as the standard for data exchange on the Web. In XML view indexing, XML view xv which is the result of an XML query is represented as an XML view index(XVI), a structure containing the identifiers of xv's underlying XML elements as well as the information on xv. Since XVI for xv stores just the identifiers of the XML elements not the elements themselves, when xv is requested, its XVI should be materialized against xv's underlying XML documents. In this paper, we address the problem of integrating an XML view index management system with an RDBMS based XML storage system. The proposed system was implemented in Java on Windows 2000 Server with each of two different commercial RDBMSs, and used in evaluating performance improvement through XML view indexing as well as its overheads. The experimental results revealed that XML view indexing was very effective with an RDBMS based XML storage system while its overhead was negligible.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.392-394
• /
• 1998

데이터 웨어하우스 시스템은 의사 결정의 지원에 필요한 요약, 분석 작업을 수행하여 다양한 고품질의 정보 서비스를 사용자에게 제공한다[1]. 이러한 데이터 웨어하우스에 사용자가 질의를 요청할 경우 다차원 모델을 고려해 보면 여러 테이블을 조인해야 할 경우가 발생하고 이때 방대한 양의 사실 테이블을 가지고 있는 데이터 웨어하우스는 질의 처리시 성능 저하를 초래 할 수 있다. 그러므로 본 연구에서는 사용자의 질의에서 자주 요구되는 집계사실을 미리 저장하여 데이터 웨어하우스에 대한 질의 처리 성능향상을 기대할 수 있도록 집계사실이 저장될 효율적인 집계 테이블 생성에 따른 설계와 구현을 한다. 이를 수행하기 위해 본 논문에는 집계 사실의 저장방법에 대해 살펴보고, 집계 계획에 근거한 집계테이블 생성 인터페이스의 프로토타입 설계 및 구현을 살펴본다. 이렇게 함으로서 사용자의 의사결정에 필요한 정보를 데이터 웨어하우스에서 더욱 신속하게 얻을 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.133-135
• /
• 2003

데이터베이스 기반의 웹 응용을 위한 캐슁 기법이 최근 많이 연구되고 있다. 자주 제기되는 질의의 결과를 캐쉬해두면 반복 질의를 위한 재사용은 물론 관련 질의의 처리에 이용될 수 있다. 웹 상에서 데이터 교환의 표준으로 XML이 등장한 이래 현재 웹 응용들은 네트워크 상의 원격 XML 소스로부터 데이터 검색을 수행하는 경우가 많아졌는데 이의 효율적인 지원을 위해 검색 결과를 캐쉬하는 것은 유용하다. 본 논문은 웹에서 XML 질의를 관련 XML 캐쉬를 이용하여 처리하는 기법의 구현 및 성능 평가에 관한 것이다. XML 질의로 XQuery, XPath, XQL 등과 같은 모든 XML 질의어의 핵심 요소인 경로 표현식을 대상으로 하였고, XML 캐쉬는 XML 실체뷰를 고려하였고, 캐쉬를 이용한 XML 질의 변환 알고리즘은 [12]에 제시된 것을 대상으로 하였다. [12]의 질의 변환 알고리즘을 지원하는 프로토타입 XML 저장 시스템이 관계 DBMS를 이용하여 구현되어 실제 웹에서의 성능 실험에 이용되었다. 성능 실험 결과 웹에서 캐쉬를 이용한 XML 질의 처리의 효율성을 확인하였다.

• IE interfaces
• /
• v.16 no.2
• /
• pp.229-239
• /
• 2003

The On-Line Analytical Processing (OLAP) tools access data from the data warehouse for complex data analysis, such as multidimensional data analysis, and decision support activities. Current research has lead to new developments in all aspects of data warehousing, however, there are still a number of problems that need to be solved for making data warehousing effective. View maintenance, one of them, is to maintain view in response to updates in source data. Keeping the view consistent with updates to the base relations, however, can be expensive, since it may involve querying external sources where the base relations reside. In order to reduce maintenance costs, it is possible to maintain the views using information that is strictly local to the data warehouse. This process is usually referred to as "self-maintenance of views". A number of algorithm have been proposed for self maintenance of views where they keep some additional information in data warehouse in the form of auxiliary views. But those algorithms did not consider a consistency of materialized views using view self-maintenance. The purpose of this paper is to research consistency problem when self-maintenance of views is implemented. The proposed "conveyor algorithm" will resolved a complete consistency of materialized view using self-maintenance with considering network delay. The rationale for conveyor algorithm and performance characteristics are described in detail.