Efficient document filtering and routing methods in publish/subscribe systems출판/구독 시스템에서의 효율적인 문서 필터링 및 전달 방법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 548
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKim, Myoung Ho-
dc.contributor.advisor김명호-
dc.contributor.authorYoo, Sang-Hyun-
dc.contributor.author유상현-
dc.date.accessioned2011-12-13T05:27:02Z-
dc.date.available2011-12-13T05:27:02Z-
dc.date.issued2009-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=309349&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/33273-
dc.description학위논문(박사) - 한국과학기술원 : 전산학전공, 2009.2, [ xi, 94 p. ]-
dc.description.abstractPublish/subscribe systems are frequently used for disseminating documents to various clients geographically distributed in the network. Typically, such systems consist of publishers who produce documents, subscribers who consume them, and a broker that delivers documents from publishers to subscribers. If the publish/subscribe system maintains multiple brokers to achieve scalability, a document routing method between brokers is needed. To do this, in the first part of this dissertation, we propose an efficient subscription routing algorithm with subscriptions especially expressed in XPath patterns as in an XML-based publish/subscribe system [55]. We first discuss that publish/subscribe systems can utilize the homomorphism relationship among XPath patterns to route XPath patterns. Then, we develop a lattice data structure called the partially ordered set of XPath patterns (abbreviated as POX) and its corresponding algorithm for efficiently maintaining homomorphism relationships. Finally, we present performance evaluation results that validate our algorithm with respect to system performance and scalability. In the second part of this dissertation, we mention the $\textsl{k}$ -NN query that the publish/subscribe system can frequently encounter and develop algorithms for exact $\textsl{k}$ -NN search using the R-tree that is the most popular structure to index multi-dimensional data items. Our method pre-computes and maintains l nearest neighbors for each subscription and exploits them to prune the search space. To minimize the cost of reading the l-NN subscriptions from the disk, we also propose a method that expects l’, the minimum value of l, according to the value $\textsl{k}$. We prove that our method always returns exact results and propose complete algorithms that process the $\textsl{k}$ -NN query and update the R-tree. The experimental results show that our method outperforms the existing one proposed in [49]. In Mobile Ad Hoc Networks (MANETs) wher...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectPublish/Subscribe-
dc.subjectXML-
dc.subjectXPath-
dc.subjectk-NN-
dc.subjectMANET-
dc.subject출판/구독-
dc.subject필터링-
dc.subject모바일 애드 혹 네트워크-
dc.subjectPublish/Subscribe-
dc.subjectXML-
dc.subjectXPath-
dc.subjectk-NN-
dc.subjectMANET-
dc.subject출판/구독-
dc.subject필터링-
dc.subject모바일 애드 혹 네트워크-
dc.titleEfficient document filtering and routing methods in publish/subscribe systems-
dc.title.alternative출판/구독 시스템에서의 효율적인 문서 필터링 및 전달 방법-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN309349/325007-
dc.description.department한국과학기술원 : 전산학전공,-
dc.identifier.uid020045161-
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