Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
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
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
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
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The primary challenge in developing a peer-to-peer file sharing system is implementing an efficient keyword search mechanism. Current keyword search system for structured P2P systems relies on the intersection of distributed inverted index. However, when executing multiple-attribute queries, the bandwidth overhead is unacceptable. In order to reduce query overhead, indexing can be done by a set of keywords which is adopted in KSS system. However, KSS index is considerably larger than standard inverted index and the insert and storage overhead are dramatically increased. In this paper, by adopting term ranking approach such as TFIDF and exploiting the relationship information between query keywords, the indexing is done by individual keyword while search can be done in a set of related keywords like KSS. Experiments results clearly demonstrated that the improved keyword search system can match standard inverted index in insert overhead and storage overhead, while can compete with KSS index in query overhead.