Searching XML Documents by Keywords in Structured P2P Networks
Searching XML Documents by Keywords in Structured P2P Networks
复制标题
DOI：
10.1109/dexa.2008.51
复制
发表时间：
2008-09
期刊：
影响因子：
--
通讯作者：
Xiaochen Li;Toshiyuki Amagasa;H. Kitagawa
中科院分区：
文献类型：
--
作者：
Xiaochen Li;Toshiyuki Amagasa;H. Kitagawa
在本文中，我们提出了一个方案，在基于DHT的结构化P2P网络的XML文档的关键字搜索。我们的想法是在一个基于DHT的P2P网络中为XML文档构建一个倒排索引。为此，我们讨论了如何分解XML文档，并存储在基于DHT的P2P网络的片段。给定一个关键字查询，我们必须能够找到相应的XML片段，这些片段子化了给定的关键字。我们解决这个问题，找到SLCA（最小的最低共同祖先）的关键字的帮助下，基于DHT的倒排索引。我们还讨论了通过引入Bloom过滤器来减少对等点之间消息传输数量的技术。通过实验验证了该方案的可行性。
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.