Paper Info
Title
Restoring consistency in p2p deductive databases
Abstract
This paper proposes a logic framework for modeling the interaction among deductive databases and computing consistent answers to logic queries in a P2P environment. As usual, data are exchanged among peers by using logical rules, called mapping rules. The declarative semantics of a P2P system is defined in terms of weak models. Under this semantics each peer uses its mapping rules to import minimal sets of mapping atoms allowing to satisfy its local integrity constraints. An equivalent and alternative characterization of minimal weak model semantics, in terms of prioritized logic programs, is also introduced and the computational complexity of P2P logic queries is investigated.
Year
DOI
Venue
2012
10.1007/978-3-642-33362-0_13
SUM
Keywords
Field
DocType
logic framework,p2p deductive databases,prioritized logic program,restoring consistency,p2p logic query,p2p system,mapping rule,mapping atom,minimal weak model semantics,p2p environment,logic query,declarative semantics
Data mining,Computer science,Logical rules,Data integrity,Database,Semantics,Well-founded semantics,Computational complexity theory
Conference
Citations 
PageRank 
References 
6
0.47
22
Authors
2
Name
Order
Citations
PageRank
Luciano Caroprese114021.01
Ester Zumpano251862.16