ACM Computing Surveys (CSUR)
Cluster validity methods: part I
ACM SIGMOD Record
Clustering validity checking methods: part II
ACM SIGMOD Record
Overlay Networks: A Scalable Alternative for P2P
IEEE Internet Computing
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Ontology-Based Clustering and Routing in Peer-to-Peer Networks
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Ontology Matching
OntSum: A Semantic Query Routing Scheme in P2P Networks Based on Concise Ontology Indexing
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
Semantic peer, here are the neighbors you want!
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Semantically routing queries in peer-based systems: The h-link approach
The Knowledge Engineering Review
A framework for semantic grouping in P2P databases
Information Systems
A measure for cluster cohesion in semantic overlay networks
Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
GrouPeer: Dynamic clustering of P2P databases
Information Systems
A Semantic-Based Ontology Matching Process for PDMS
Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
Rewiring strategies for semantic overlay networks
Distributed and Parallel Databases
Scalable semantic overlay generation for p2p-based digital libraries
ECDL'06 Proceedings of the 10th European conference on Research and Advanced Technology for Digital Libraries
Matching ontologies in open networked systems: techniques and applications
Journal on Data Semantics V
Load balance for semantic cluster-based data integration systems
Proceedings of the 17th International Database Engineering & Applications Symposium
Hi-index | 0.00 |
Peer Data Management Systems PDMSs are advanced P2P applications in which each peer represents an autonomous data source making available an exported schema to be shared with other peers. Query answering in PDMSs can be improved if peers are efficiently disposed in the overlay network according to the similarity of their content. The set of peers can be partitioned into clusters, so as the semantic similarity among the peers participating into the same cluster is maximal. The creation and maintenance of clusters is a challenging problem in the current stage of development of PDMSs. This work proposes an incremental peer clustering process. The authors present a PDMS architecture designed to facilitate the connection of new peers according to their exported schema described by an ontology. The authors propose a clustering process and the underlying algorithm. The authors present and discuss some experimental results on peer clustering using the approach.