Schema-based semantic query optimization for XML queriesXML 질의를 위한 스키마 기반 의미적 질의 최적화

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 442
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorChung, Chin-Wan-
dc.contributor.advisor정진완-
dc.contributor.authorPark, Chang-Won-
dc.contributor.author박창원-
dc.date.accessioned2011-12-13T05:20:04Z-
dc.date.available2011-12-13T05:20:04Z-
dc.date.issued2002-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=177629&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/32818-
dc.description학위논문(박사) - 한국과학기술원 : 전산학전공, 2002.8, [ iv, 110 p. ]-
dc.description.abstractSemantic query optimization is an approach to optimizing a query with respect to some semantic information such as structural information and integrity constraints. This thesis presents new schema-based semantic query optimization techniques, which rely on available structural information, for XML queries. The techniques described in the thesis resolve several open problems in the field of schema-based query optimization for XML queries. First, we present a new technique called the two-phase query pruning that consists of the preprocessing phase and the pruning phase. Our two-phase query pruning is effective in optimizing multiple regular path expressions, and is more scalable and efficient than the combination of the previous query pruning and post-processing in that it never deals with exponentially many combinations of sub-results produced from all the regular path expressions. Several experiments we conducted show that the two-phase query pruning outperforms the previous approach. Second, another new technique called structural function inlining is presented. Based on the technique, we develop a new approach to optimizing and typing structurally recursive queries. The approach produces an optimal algebraic expression for a query with regard to available type information. Furthermore, it yields a precise result type for the query. Our experiments show that the number of node lookups by our approach is on the average 3.7 times and up to 279.8 times smaller than that by the current approach in evaluating structurally recursive queries.eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectQuery Pruning-
dc.subjectSemantic Query Optimization-
dc.subjectXML Query Optimization-
dc.subjectStructural Function Inlining-
dc.subject구조적 함수 인라이닝-
dc.subject질의전지-
dc.subject의미적 질의 최적화-
dc.subjectXML 질의 최적화-
dc.titleSchema-based semantic query optimization for XML queries-
dc.title.alternativeXML 질의를 위한 스키마 기반 의미적 질의 최적화-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN177629/325007-
dc.description.department한국과학기술원 : 전산학전공, -
dc.identifier.uid000975141-
dc.contributor.localauthorChung, Chin-Wan-
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