Flexible intensional query-answering for RDF peer-to-peer systems

Authors:
Zoran Majkić
Affiliations:
University of Maryland, College Park
Venue:
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Year:
2006

Citing 7
Cited 1

Answering queries using views (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Improving Data Access in P2P Systems

IEEE Internet Computing
Layering the Semantic Web: Problems and Directions

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Three theses of representation in the semantic web

WWW '03 Proceedings of the 12th international conference on World Wide Web
Querying the Semantic Web with RQL

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: The Semantic Web: an evolution for a revolution
Massive Parallelism for Query Answering in Weakly Integrated P2P Systems

DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
Logical foundations of peer-to-peer data integration

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Intensional semantics for RDF data structures

IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the Peer-To-Peer (P2P) database systems with RDF ontologies and with the semantic characterization of P2P mappings based on logical views over local peer's ontology. Such kind of virtual-predicate based mappings needs an embedding of RDF ontologies into a predicate first-order logic, or at some of its sublanguages as, for example, logic programs for deductive databases. We consider a peer as a local epistemic logic system with its own belief based on RDF tuples, independent from other peers and their own beliefs. This motivates the need of a semantic characterization of P2P mappings based not on the extension but on the meaning of concepts used in the mappings, that is, based on intensional logic. We show that it adequately models robust weakly-coupled framework of RDF ontologies and supports decidable query answering for the union of conjunctive queries.