A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems

Franconi, Enrico; Kuper, Gabriel M.; Lopatenko, Andrei; Serafini, Luciano

doi:10.1007/978-3-540-24629-9_6

Cited by 71 publications

(48 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to these trends, several peer-to-peer data integration formalisms have been introduced [18][19][20][21][22][23]. All these systems focus on an integration approach not based on a global centralized schema.…”

Section: Peer-to-peer Data Integrationmentioning

confidence: 99%

A service-oriented system for distributed data querying and integration on Grids

Comito

Gounaris

Sakellariou

et al. 2009

Future Generation Computer Systems

View full text Add to dashboard Cite

a b s t r a c tData Grids rely on the coordinated sharing of and interaction across multiple autonomous database management systems. They provide transparent access to heterogeneous and autonomous data resources stored on Grid nodes. Data sharing tools for Grids must include both distributed query processing and data integration functionality. This paper presents the implementation of a data sharing system that (i) is tailored to data Grids, (ii) supports well established and widely spread relational DBMSs, and (iii) adopts a hybrid architecture by relying on a peer model for query reformulation to retrieve semantically equivalent expressions, and on a wrapper-mediator integration model for accessing and querying distributed data sources. The system builds upon the infrastructure provided by the OGSA-DQP distributed query processor and the XMAP query reformulation algorithm. The paper discusses the implementation methodology, and presents empirical evaluation results.

show abstract

Section: Peer-to-peer Data Integrationmentioning

confidence: 99%

A service-oriented system for distributed data querying and integration on Grids

Comito

Gounaris

Sakellariou

et al. 2009

Future Generation Computer Systems

View full text Add to dashboard Cite

show abstract

“…Beyond [17] other significant works such as [3,6,9,14,36] have introduced novel frameworks for PDMSs. All of these works agree to the fundamental principles of peer autonomy, peer heterogeneity and peer data exchange through local pairwise mappings.…”

Section: Related Workmentioning

confidence: 99%

“…A query may have to be rewritten several times from peer to peer till it reaches nodes that are able to answer it sufficiently in terms of quality but also quantity. Several theoretical frameworks have been proposed for PDMSs [9,14,17,36]. These frameworks aim at the provision of correct and complete semantics that distinguish PDMSs from data integration systems and also handle inconsistency in such a way that the system does not collapse in its presence.…”

Section: Introductionmentioning

confidence: 99%

“…These frameworks aim at the provision of correct and complete semantics that distinguish PDMSs from data integration systems and also handle inconsistency in such a way that the system does not collapse in its presence. The works in [9,14] employ epistemic and autoepistemic logic in order to achieve maximum peer autonomy w.r.t. both the local semantics and the peer connectivity.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A framework for semantic grouping in P2P databases

Kantere

Tsoumakos

Sellis

2008

Information Systems

View full text Add to dashboard Cite

Abstract. Sharing of structured data in decentralized environments is a challenging problem, especially in the absence of a global schema. Social network structures map network links to semantic relations between participants in order to assist in efficient resource discovery and information exchange. In this work, we propose a scheme that automates the process of creating schema synopses from semantic clusters of peers which own autonomous relational databases. The resulting mediated schemas can be used as global interfaces for relevant queries. Active nodes are able to initiate the group schema creation process, which produces a mediated schema representative of nodes with similar semantics. Group schemas are then propagated in the overlay and used as a single interface for relevant queries. This increases both the quality and the quantity of the retrieved answers and allows for fast discovery of interest groups by joining peers. As our experimental evaluations show, this method increases both the quality and the quantity of the retrieved answers and allows for faster discovery of semantic groups by joining peers.

show abstract

“…Recent papers focused on providing techniques for evolving from basic P2P networks supporting only file exchanges to more complex systems like schema-based P2P networks, capable of supporting the exchange of structured contents. From papers like [19,4,18,10,16,27] the idea of peer data management emerges: every peer is characterized by a schema that represents the domain of interest from the peer perspective, and is equipped with mappings to other peers [25], each mapping providing a semantic relationship between pairs of peers. Data integration in such systems is typically virtual: data stored in one peer is not replicated in other peers, and when a query is posed to a peer, query processing is done by both looking at local data, and collecting relevant data from other peers according to the mappings.…”

Section: Introductionmentioning

confidence: 99%

Inconsistency tolerance in P2P data integration: An epistemic logic approach

Calvanese

Giacomo

Lembo

et al. 2008

Information Systems

View full text Add to dashboard Cite

Abstract. We study peer-to-peer data integration, where each peer models an autonomous system that exports data in terms of its own schema, and data interoperation is achieved by means of mappings among the peer schemas, rather than through a global schema. We propose a multi-modal epistemic semantics based on the idea that each peer is conceived as a rational agent that exchanges knowledge/belief with other peers, thus nicely modeling the modular structure of the system. We then address the issue of dealing with possible inconsistencies, and distinguish between two types of inconsistencies, called local and P2P, respectively. We define a nonmonotonic extension of our logic that is able to reason on the beliefs of peers under inconsistency tolerance. Tolerance to local inconsistency essentially means that the presence of inconsistency within one peer does not affect the consistency of the whole system. Tolerance to P2P inconsistency means being able to resolve inconsistencies arising from the interaction between peers. We study query answering and its data complexity in this setting, and we present an algorithm that is sound and complete with respect to the proposed semantics, and optimal with respect to worst-case complexity.

show abstract

A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems

Cited by 71 publications

References 8 publications

A service-oriented system for distributed data querying and integration on Grids

A service-oriented system for distributed data querying and integration on Grids

A framework for semantic grouping in P2P databases

Inconsistency tolerance in P2P data integration: An epistemic logic approach

Contact Info

Product

Resources

About