By Topic

Searching XML Documents by Keywords in Structured P2P Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaochen Li ; Grad. Sch. of Syst. & Inf. Eng., Tsukuba Univ., Tsukuba ; Toshiyuki Amagasa ; Hiroyuki Kitagawa

In this paper we present a scheme for searching XML documents by keywords in DHT-based structured P2P networks. Our idea is to construct an inverted index for XML documents in an DHT-based P2P network. To this end, we discuss how to decompose XML documents and store the resulting fragments in a DHT-based P2P network. Given a query in terms of keywords, we have to be able to find respective XML fragments that subsume given keywords. We address this problem by finding SLCAs (smallest lowest common ancestors) for the keywords with the help of the DHT-based inverted index. We also discuss the technique to reduce number of message transmissions among peers by introducing Bloom filters. We show the feasibility of the proposed scheme by experimentations.

Published in:

2008 19th International Workshop on Database and Expert Systems Applications

Date of Conference:

1-5 Sept. 2008