Efficient materialized view maintenance in data warehouses데이터웨어하우스에서의 효율적인 실체화 뷰 관리

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 436
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKim, Myoung Ho-
dc.contributor.advisor김명호-
dc.contributor.authorLee, Ki-Yong-
dc.contributor.author이기용-
dc.date.accessioned2011-12-13T05:21:31Z-
dc.date.available2011-12-13T05:21:31Z-
dc.date.issued2006-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=254438&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/32910-
dc.description학위논문(박사) - 한국과학기술원 : 전산학전공, 2006.2, [ viii, 83 p. ]-
dc.description.abstractIn the data warehouse environment, the concept of a materialized view is common and important for efficient support of OLAP query processing. Materialized views are defined over several source relations. These materialized views need to be updated when source relations change. Since the propagation of updates to the views may impose a significant overhead, it is essential to update the ware-house views efficiently. Though various view maintenance strategies have been discussed in the past, the incremental maintenance of some kinds of views has not been sufficiently investigated. In the first part of this dissertation, we propose an efficient incremental view maintenance method for the select-project-join(SPJ) views. The proposed method minimizes the total cost of accessing source relations. We define the delta evaluation expression and a delta evaluation tree which are core concepts of our method. Then, a dynamic programming algorithm that can find the optimal delta evaluation tree is proposed. We also present various experimental results that show the usefulness and efficiency of our proposed method. In the second part, we propose an efficient incremental maintenance method for the data cubes. The data cube is an aggregation operator that computes group-bys for all possible combination of dimension attributes. When the number of the dimension attributes is n, the data cube computes $2^n$ group-bys, each of which is called a cuboid. To maintain a data cube incrementally, previous methods compute a delta cube, which represents the change of the data cube. We call a cuboid in a delta cube a delta cuboid. For a data cube with $2^n$ cuboids, a delta cube consists of $2^n$ delta cuboids. Thus, as the number of dimension attributes increases, the cost of computing a delta cube increases significantly. In the second part of this dissertation, we propose an incremental cube maintenance method that can maintain a data cube using only $^nC_[n/2]$ delta cuboids. As a resu...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectMaterialized View-
dc.subjectData Warehouse-
dc.subjectView Maintenance-
dc.subject뷰 관리-
dc.subject실체화 뷰-
dc.subject데이터 웨어하우스-
dc.titleEfficient materialized view maintenance in data warehouses-
dc.title.alternative데이터웨어하우스에서의 효율적인 실체화 뷰 관리-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN254438/325007-
dc.description.department한국과학기술원 : 전산학전공,-
dc.identifier.uid020005214-
dc.contributor.localauthorKim, Myoung Ho-
dc.contributor.localauthor김명호-
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0