Fuzzy sets and fuzzy logic: theory and applications
Fuzzy sets and fuzzy logic: theory and applications
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
Combining fuzzy information: an overview
ACM SIGMOD Record
The chatty web: emergent semantics through gossiping
WWW '03 Proceedings of the 12th international conference on World Wide Web
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
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
The hyperion project: from data integration to data coordination
ACM SIGMOD Record
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
Proceedings of the 13th international conference on World Wide Web
The Piazza Peer Data Management System
IEEE Transactions on Knowledge and Data Engineering
Efficient query reformulation in peer data management systems
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Rewriting Rules To Permeate Complex Similarity and Fuzzy Queries within a Relational Database System
IEEE Transactions on Knowledge and Data Engineering
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
IQN routing: integrating quality and novelty in P2P querying and ranking
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Using information retrieval techniques to route queries in an infobeacons network
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
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
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
Ontology-Based Data Sharing in P2P Databases
Semantic Web, Ontologies and Databases
SRI@work: efficient and effective routing strategies in a PDMS
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
On the selectivity of multidimensional routing indices
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
OLAP query reformulation in peer-to-peer data warehousing
Information 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
Hi-index | 0.00 |
The huge amount of data available from Internet information sources has focused much attention on the sharing of distributed information through Peer Data Management Systems (PDMSs). In a PDMS, peers have a schema on their local data, and they are related each other through semantic mappings that can be defined between their own schemas.Querying a PDMS means either flooding the network with messages to all peers or take advantage of a routing mechanism to reformulate a query only on the best peers selected according to some given criteria. As reformulations may lead to semantic approximations, we deem that such approximations can be exploited for locating the semantically best directions to forward a query to.In this paper, we propose a distributed index mechanism where each peer is provided with a Semantic Routing Index (SRI) for routing queries effectively. A fuzzy-oriented model for SRI is presented where operations for creating and maintaining SRIs are well-founded. In addition, we show how SRIs can be employed in the query processing phase with the aim of reducing the space of reformulations. Finally, we conduct a series of meaningful experiments showing the effectiveness of the proposed approach.