Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
Journal of Computational and Applied Mathematics
ACM Computing Surveys (CSUR)
Exploiting hierarchical domain structure to compute similarity
ACM Transactions on Information Systems (TOIS)
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Clustering Large Datasets in Arbitrary Metric Spaces
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
SETS: search enhanced by topic segmentation
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
The Piazza Peer Data Management System
IEEE Transactions on Knowledge and Data Engineering
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
SRI: exploiting semantic information for effective query routing in a PDMS
WIDM '06 Proceedings of the 8th annual ACM international workshop on Web information and data management
Efficient peer-to-peer semantic overlay networks based on statistical language models
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
p2pDating: Real life inspired semantic overlay networks for Web search
Information Processing and Management: an International Journal
SRI@work: efficient and effective routing strategies in a PDMS
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
PARIS: a peer-to-peer architecture for large-scale semantic data integration
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Semantic overlay networks for p2p systems
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
DESENT: decentralized and distributed semantic overlay generation in P2P networks
IEEE Journal on Selected Areas in Communications
Building a PDMS infrastructure for XML data sharing with SUNRISE
DataX '08 Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web
Building self-organized image retrieval network
Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
Rewiring strategies for semantic overlay networks
Distributed and Parallel Databases
Affinity P2P: A self-organizing content-based locality-aware collaborative peer-to-peer network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Expert Systems with Applications: An International Journal
A semantic-based approach for data management in a P2P system
Transactions on large-scale data- and knowledge-centered systems III
GROUP: a gossip based building community protocol
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Gossiping correspondences to reduce semantic heterogeneity of unstructured P2P systems
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
Working in a dynamic environment: the nep4b approach as a MAS
AP2PC'08 Proceedings of the 7th international conference on Agents and Peer-to-Peer Computing
A peer-to-peer recommender system for self-emerging user communities based on gossip overlays
Journal of Computer and System Sciences
Ontology-Based Clustering in a Peer Data Management System
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connected through semantic mappings. Querying a PDMS may lead to very poor results, because of the semantic degradation due to the approximations given by the traversal of the semantic mappings, thus leading to the problem of how to boost a network of mappings in a PDMS. In this paper we propose a strategy for the incremental maintenance of a flexible network organization that clusters together peers which are semantically related in Semantic Overlay Networks (SONs), while maintaining a high degree of node autonomy. Semantic features, a summarized representation of clusters, are stored in a "light" structure which effectively assists a newly entering peer when choosing its semantically closest overlay networks. Then, each peer is supported in the selection of its own neighbors within each overlay network according to two policies: Range-based selection and k-NN selection. For both policies, we introduce specific algorithms which exploit a distributed indexing mechanism for efficient network navigation. The proposed approach has been implemented in a prototype where its effectiveness and efficiency have been extensively tested.