XML data placement for effective processing of path queries효율적인 경로 질의 처리를 위한 XML 데이터 배치

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 817
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKim, Myoung Ho-
dc.contributor.advisor김명호-
dc.contributor.authorKim, Jung-Hoon-
dc.contributor.author김정훈-
dc.date.accessioned2011-12-13T05:26:29Z-
dc.date.available2011-12-13T05:26:29Z-
dc.date.issued2007-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=268744&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/33237-
dc.description학위논문(박사) - 한국과학기술원 : 전산학전공, 2007. 8, [ vii, 69 p. ]-
dc.description.abstractXML has become the standard of the data representation and exchange through the Internet recently. XML is a markup language that can separate the contents of data and the presentation of data. Because XML data is modeled as a rooted tree, path queries are widely used for the query processing. In the thesis we present XML data placement methods for effective processing of path queries. Specifically, this thesis addresses two issues of XML data placement, data placement on physical medium and wireless air medium. First, we propose an efficient algorithm that places XML data on the physical storage medium (i.e., magnetic disks) such that the number of disk accesses for path query processing is minimized. The proposed algorithm consists of two steps. In the first step, we assign a number (called the mapping indicator) for each node of a tree in a bottom-up fashion. The mapping indicator of a node denotes the minimum number of disk blocks required for storing the node and all of its descendant nodes. In the second step we map the nodes to disk blocks using the assigned mapping indicator. We analyze the optimality of the proposed method with some relevant proofs. We also show the proposed method provides good performance for various query types with XML data set. Secondly, we propose a set of XML data placement method for wireless air channels which support energy-efficient processing of queries over the wireless stream in mobile clients. The mobile clients can access the XML stream, organized by the proposed method, in a selective way through various kinds of link addresses to related data and signature information on the stream. After defining the BUX (Broadcast Unit of XML data) structure, which is our proposed structure for XML data placement wireless medium, we propose a set of event-driven stream generation and path query processing algorithms for the proposed stream structure. Through performance experiments, we show that our approaches can effectively impro...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectXML-
dc.subjectData Placement-
dc.subjectQuery Processing-
dc.subjectData Broadcast-
dc.subjectXML-
dc.subject데이터 배치-
dc.subject질의 처리-
dc.subject데이터 방송-
dc.subjectXML-
dc.subjectData Placement-
dc.subjectQuery Processing-
dc.subjectData Broadcast-
dc.subjectXML-
dc.subject데이터 배치-
dc.subject질의 처리-
dc.subject데이터 방송-
dc.titleXML data placement for effective processing of path queries-
dc.title.alternative효율적인 경로 질의 처리를 위한 XML 데이터 배치-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN268744/325007-
dc.description.department한국과학기술원 : 전산학전공,-
dc.identifier.uid000995093-
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