Efficient path index and extraction of structural information for XML dataXML 데이타의 효율적인 경로 인덱스와 구조 정보 추출

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 538
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorChung, Chin-Wan-
dc.contributor.advisor정진완-
dc.contributor.authorMin, Jun-Ki-
dc.contributor.author민준기-
dc.date.accessioned2011-12-13T05:20:07Z-
dc.date.available2011-12-13T05:20:07Z-
dc.date.issued2002-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=177632&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/32821-
dc.description학위논문(박사) - 한국과학기술원 : 전산학전공, 2002.8, [ viii, 109 p. ]-
dc.description.abstractDue to its flexibility, XML is becoming the de facto standard for exchanging and querying documents over the Web. The key distinction between data in XML and data in traditional models is that XML is not rigidly structured. Because of the self-describing feature of XML data, XML can naturally model irregularities that cannot be modeled by relational or object-oriented data. Thus, new structures such as path indexes that improve the XML query performance are needed. Also, to describe the XML data structure, some languages are proposed. Many XML query languages such as XQuery and XPath use label paths to traverse the irregularly structured XML data. Without a structural summary and efficient indexes, query processing can be quite inefficient due to an exhaustive traversal on XML data. To overcome the inefficiency, several path indexes have been proposed in the research community. Traditional indexes generally record all label paths from the root element in XML data and are constructed with the use of data only. Such path indexes may result in performance degradation due to large sizes and exhaustive navigations for partial matching path queries which start with the self-or-descendent axis("//"). To improve the query performance, we propose an adaptive path index for XML data (termed APEX). APEX does not keep all paths starting from the root and utilizes frequently used paths on query workloads. APEX also has a nice property that it can be updated incrementally according to the changes of query workloads. Experimental results with synthetic and real-life data sets clearly confirm that APEX improves the query processing cost typically 2 to 69 times compared with the traditional indexes, with the performance gap increasing with the irregularity of XML data. To specify the constraint on the XML data structure, many languages such as Document Type Definition (DTD), Document Content Description (DCD), and XML Schema have been proposed. The schema described by these str...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectDTD-
dc.subjectXML-
dc.subjectQuery Processing-
dc.subject질의 처리-
dc.subjectDTD-
dc.subjectXML-
dc.titleEfficient path index and extraction of structural information for XML data-
dc.title.alternativeXML 데이타의 효율적인 경로 인덱스와 구조 정보 추출-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN177632/325007-
dc.description.department한국과학기술원 : 전산학전공, -
dc.identifier.uid000985124-
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