EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Efa: An Efficient Content Routing Algorithm in Large Peer-to-Peer Overlay Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Ontology-based data source localization in a structured peer-to-peer environment
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Semantic reconciliation in peer multi-data source management system
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
The anatomy of a large-scale social search engine
Proceedings of the 19th international conference on World wide web
A semantic-based approach for data management in a P2P system
Transactions on large-scale data- and knowledge-centered systems III
Resource discovery considering semantic properties in data grid environments
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
Searching the village: models and methods for social search
Communications of the ACM
A semantic searching scheme in heterogeneous unstructured P2P networks
Journal of Computer Science and Technology - Special issue on Natural Language Processing
| Hi-index | 0.02 |
A challenging problem in a schema-based peer-to-peer (P2P) system is how to locate peers that are relevant with respect to a given query. In this paper, we propose a new semantic routing mechanism in the context of the SenPeer P2P Data Management System (PDMS). SenPeer is an unstructured P2P system based on an organization of peers around super-peers according to their semantic domains. Our proposal is based on the use of a distributed data structure, called expertise table, maintained by the super-peers and describing data at the neighboring peers. This table, combined with matching techniques, is the basis of a semantic overlay network. Semantic links are exploited for efficient query propagation towards peers that may have relevant data. We give a performance evaluation of our semantic query routing with respect to important criteria such as precision, recall and number of messages. The results show that our algorithm significantly outperforms a baseline algorithm without semantics.