Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for large-scale information retrieval and search systems because of their scalability, fault-tolerance, and self-organizing nature. Because of this decentralized architecture, however, traditional P2P keyword search systems are difficult to globally share useful semantic knowledge among nodes. As a result, traditional P2P keyword search systems cannot support semantic search (support only naive text-match search). In this paper, we describe a design of the semantic P2P keyword search system. We exploit the semantics of correlation among keywords rather than synonym. The key mechanism is query expansion, where a received query is expanded based on keyword relationships. Keyword relationships are improved through search and retrieval processes and each relationship is shared among nodes holding similar data items. This semantic P2P search system has two main advantages. First, expanding search results through query expansion increases the possibility of locating desired data items which would not be found by traditional P2P search systems due to the keywords' textual mismatch. Second, keyword relationships originally introduced for query expansion, can be used for result ranking. Our main challenges are 1) managing keyword relationships in a fully decentralized manner and 2) maintaining the quality of search results, while suppressing result implosion. We also describe the prototype implementation and evaluation of the semantic P2P search system.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kiyohide NAKAUCHI, Yuichi ISHIKAWA, Hiroyuki MORIKAWA, Tomonori AOYAMA, "Exploiting Semantics in Unstructured Peer-to-Peer Networks" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 7, pp. 1806-1817, July 2004, doi: .
Abstract: Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for large-scale information retrieval and search systems because of their scalability, fault-tolerance, and self-organizing nature. Because of this decentralized architecture, however, traditional P2P keyword search systems are difficult to globally share useful semantic knowledge among nodes. As a result, traditional P2P keyword search systems cannot support semantic search (support only naive text-match search). In this paper, we describe a design of the semantic P2P keyword search system. We exploit the semantics of correlation among keywords rather than synonym. The key mechanism is query expansion, where a received query is expanded based on keyword relationships. Keyword relationships are improved through search and retrieval processes and each relationship is shared among nodes holding similar data items. This semantic P2P search system has two main advantages. First, expanding search results through query expansion increases the possibility of locating desired data items which would not be found by traditional P2P search systems due to the keywords' textual mismatch. Second, keyword relationships originally introduced for query expansion, can be used for result ranking. Our main challenges are 1) managing keyword relationships in a fully decentralized manner and 2) maintaining the quality of search results, while suppressing result implosion. We also describe the prototype implementation and evaluation of the semantic P2P search system.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e87-b_7_1806/_p
Copy
@ARTICLE{e87-b_7_1806,
author={Kiyohide NAKAUCHI, Yuichi ISHIKAWA, Hiroyuki MORIKAWA, Tomonori AOYAMA, },
journal={IEICE TRANSACTIONS on Communications},
title={Exploiting Semantics in Unstructured Peer-to-Peer Networks},
year={2004},
volume={E87-B},
number={7},
pages={1806-1817},
abstract={Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for large-scale information retrieval and search systems because of their scalability, fault-tolerance, and self-organizing nature. Because of this decentralized architecture, however, traditional P2P keyword search systems are difficult to globally share useful semantic knowledge among nodes. As a result, traditional P2P keyword search systems cannot support semantic search (support only naive text-match search). In this paper, we describe a design of the semantic P2P keyword search system. We exploit the semantics of correlation among keywords rather than synonym. The key mechanism is query expansion, where a received query is expanded based on keyword relationships. Keyword relationships are improved through search and retrieval processes and each relationship is shared among nodes holding similar data items. This semantic P2P search system has two main advantages. First, expanding search results through query expansion increases the possibility of locating desired data items which would not be found by traditional P2P search systems due to the keywords' textual mismatch. Second, keyword relationships originally introduced for query expansion, can be used for result ranking. Our main challenges are 1) managing keyword relationships in a fully decentralized manner and 2) maintaining the quality of search results, while suppressing result implosion. We also describe the prototype implementation and evaluation of the semantic P2P search system.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Exploiting Semantics in Unstructured Peer-to-Peer Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1806
EP - 1817
AU - Kiyohide NAKAUCHI
AU - Yuichi ISHIKAWA
AU - Hiroyuki MORIKAWA
AU - Tomonori AOYAMA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2004
AB - Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for large-scale information retrieval and search systems because of their scalability, fault-tolerance, and self-organizing nature. Because of this decentralized architecture, however, traditional P2P keyword search systems are difficult to globally share useful semantic knowledge among nodes. As a result, traditional P2P keyword search systems cannot support semantic search (support only naive text-match search). In this paper, we describe a design of the semantic P2P keyword search system. We exploit the semantics of correlation among keywords rather than synonym. The key mechanism is query expansion, where a received query is expanded based on keyword relationships. Keyword relationships are improved through search and retrieval processes and each relationship is shared among nodes holding similar data items. This semantic P2P search system has two main advantages. First, expanding search results through query expansion increases the possibility of locating desired data items which would not be found by traditional P2P search systems due to the keywords' textual mismatch. Second, keyword relationships originally introduced for query expansion, can be used for result ranking. Our main challenges are 1) managing keyword relationships in a fully decentralized manner and 2) maintaining the quality of search results, while suppressing result implosion. We also describe the prototype implementation and evaluation of the semantic P2P search system.
ER -