loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 19th International Conference on Database and Expert Systems Application
Searching XML Documents by Keywords in Structured P2P Networks
September 01-September 05
ISBN: 978-0-7695-3299-8
ASCII Text
x 
 
Xiaochen Li, Toshiyuki Amagasa, Hiroyuki Kitagawa, "Searching XML Documents by Keywords in Structured P2P Networks," Database and Expert Systems Applications, International Workshop on, pp. 274-278, 2008 19th International Conference on Database and Expert Systems Application, 2008.
 
 
BibTex
x
 
@article{ 10.1109/DEXA.2008.51,
author = {Xiaochen Li and Toshiyuki Amagasa and Hiroyuki Kitagawa},
title = {Searching XML Documents by Keywords in Structured P2P Networks},
journal ={Database and Expert Systems Applications, International Workshop on},
volume = {0},
year = {2008},
issn = {1529-4188},
pages = {274-278},
doi = {http://doi.ieeecomputersociety.org/10.1109/DEXA.2008.51},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Database and Expert Systems Applications, International Workshop on
TI - Searching XML Documents by Keywords in Structured P2P Networks
SN - 1529-4188
SP274
EP278
A1 - Xiaochen Li,
A1 - Toshiyuki Amagasa,
A1 - Hiroyuki Kitagawa,
PY - 2008
KW - XML
KW - DHT
KW - P2P
KW - Bloom filter
KW - keyword search
VL - 0
JA - Database and Expert Systems Applications, International Workshop on
ER -
 
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.
Index Terms:
XML, DHT, P2P, Bloom filter, keyword search
Citation:
Xiaochen Li, Toshiyuki Amagasa, Hiroyuki Kitagawa, "Searching XML Documents by Keywords in Structured P2P Networks," dexa, pp.274-278, 2008 19th International Conference on Database and Expert Systems Application, 2008
Usage of this product signifies your acceptance of the Terms of Use.