Information retrieval: data structures and algorithms
Information retrieval: data structures and algorithms
A translation approach to portable ontology specifications
Knowledge Acquisition - Special issue: Current issues in knowledge modeling
WordNet: a lexical database for English
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
An Approach for Measuring Semantic Similarity between Words Using Multiple Information Sources
IEEE Transactions on Knowledge and Data Engineering
ALVIS peers: a scalable full-text peer-to-peer retrieval engine
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
Hybrid global-local indexing for effcient peer-to-peer information retrieval
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Making peer-to-peer keyword searching feasible using multi-level partitioning
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
The common way for keyword search in Distributed Hash Tables (DHTs) based Peer-to-Peer (P2P) system is to construct distributed inverted index by keywords. But it suffers from the problem of unscalable resources (e.g. bandwidth, storage) consumption. In this paper, we present SKS, a scalable keyword search approach in DHTs based P2P system. SKS introduces the ontology to organize the specific domain, which captures the semantic relations between words. SKS constructs distributed inverted index by concepts, which decreases the number of index entries publishing for documents and avoids the intersection of inverted lists between nodes when executing multi-keyword search. With the concept index SKS transforms the keyword search to the match process of concepts, implementing semantic search. Simulation experiment shows that SKS is more efficient than the approach of distributed inverted index by keywords in indices publishing overhead and query overhead.