Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
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
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
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
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
SETS: search enhanced by topic segmentation
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient Semantic-Based Content Search in P2P Network
IEEE Transactions on Knowledge and Data Engineering
Making Search Efficient on Gnutella-Like P2P Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
An Improved P2P Model Based on Chord
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
FS-Chord: A New P2P Model with Fractional Steps Joining
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Similarity Search in a Hybrid Overlay P2P Network
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
A Semantic Overlay Network for P2P Schema-Based Data Integration
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Enhancing Search Performance on Gnutella-Like P2P Systems
IEEE Transactions on Parallel and Distributed Systems
Efficient semantic search on DHT overlays
Journal of Parallel and Distributed Computing
A Class-Based Search System in Unstructured P2P Networks
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Expertise-based peer selection in Peer-to-Peer networks
Knowledge and Information Systems
A semantic layer for publishing and localizing xml data for a p2p xquery mediator
Proceedings of the 17th international conference on World Wide Web
Advanced semantic search and retrieval in a collaborative peer-to-peer system
UPGRADE '08 Proceedings of the third international workshop on Use of P2P, grid and agents for the development of content networks
Speed up semantic search in p2p networks
Proceedings of the 17th ACM conference on Information and knowledge management
Search Enhanced by Distributed Semantic Clustering in Gnutella-like P2P Systems
MASCOTS '07 Proceedings of the 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Ontology Driven Semantic Search over Structure P2P Network
HIS '09 Proceedings of the 2009 Ninth International Conference on Hybrid Intelligent Systems - Volume 03
Query Routing Mechanisms in Self-Organizing Search Systems
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
SEIF: Search Enhanced by Intelligent Feedback in Unstructured P2P Networks
ICPP '09 Proceedings of the 2009 International Conference on Parallel Processing
Semantic query routing in senpeer, a P2P data management system
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
SocioNet: A Social-Based Multimedia Access System for Unstructured P2P Networks
IEEE Transactions on Parallel and Distributed Systems
Semantic overlay networks for p2p systems
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
Semi-structured semantic overlay for information retrieval in self-organizing networks
Proceedings of the 21st international conference companion on World Wide Web
Searching semantic data warehouses: models, issues, architectures
Proceedings of the 2nd International Workshop on Semantic Search over the Web
Hi-index | 0.00 |
Semantic-based searching in peer-to-peer (P2P) networks has drawn significant attention recently. A number of semantic searching schemes, such as GES proposed by Zhu Y et al., employ search models in Information Retrieval (IR). All these IR-based schemes use one vector to summarize semantic contents of all documents on a single node. For example, GES derives a node vector based on the IR model: VSM (Vector Space Model). A topology adaptation algorithm and a search protocol are then designed according to the similarity between node vectors of different nodes. Although the single semantic vector is suitable when the distribution of documents in each node is uniform, it may not be efficient when the distribution is diverse. When there are many categories of documents at each node, the node vector representation may be inaccurate. We extend the idea of GES and present a new class-based semantic searching scheme (CSS) specifically designed for unstructured P2P networks with heterogeneous single-node document collection. It makes use of a state-of-the-art data clustering algorithm, online spherical k-means clustering (OSKM), to cluster all documents on a node into several classes. Each class can be viewed as a virtual node. Virtual nodes are connected through virtual links. As a result, the class vector replaces the node vector and plays an important role in the class-based topology adaptation and search process. This makes CSS very efficient. Our simulation using the IR benchmark TREC collection demonstrates that CSS outperforms GES in terms of higher recall, higher precision, and lower search cost.