ACM Home Page
Please provide us with feedback. Feedback
Logical foundations of peer-to-peer data integration
Full text PdfPdf (225 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Paris, France
SESSION: Data exchange II table of contents
Pages: 241 - 251  
Year of Publication: 2004
ISBN:158113858X
Authors
Diego Calvanese  Free University of Bolzano/Bozen, Bolzano, Italy
Giuseppe De Giacomo  Univ. di Roma La Sapienza, Roma, Italy
Maurizio Lenzerini  Univ. di Roma La Sapienza, Roma, Italy
Riccardo Rosati  Univ. di Roma La Sapienza, Roma, Italy
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 95,   Citation Count: 26
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1055558.1055593
What is a DOI?

ABSTRACT

In peer-to-peer data integration, each peer exports data in terms of its own schema, and data interoperation is achieved by means of mappings among the peer schemas. Peers are autonomous systems and mappings are dynamically created and changed. One of the challenges in these systems is answering queries posed to one peer taking into account the mappings. Obviously, query answering strongly depends on the semantics of the overall system. In this paper, we compare the commonly adopted approach of interpreting peer-to-peer systems using a first-order semantics, with an alternative approach based on epistemic logic. We consider several central properties of peer-to-peer systems: modularity, generality, and decidability. We argue that the approach based on epistemic logic is superior with respect to all the above properties. In particular, we show that, in systems in which peers have decidable schemas and conjunctive mappings, but are arbitrarily interconnected, the first-order approach may lead to undecidability of query answering, while the epistemic approach always preserves decidability. This is a fundamental property, since the actual interconnections among peers are not under the control of any actor in the system.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
P. A. Bernstein, F. Giunchiglia, A. Kementsietsidis, J. Mylopoulos, L. Serafini, and I. Zaihrayeu Data management for peer-to-peer computing: A vision. In Proc. of the 5th Int. Workshop on the Web and Databases (WebDB 2002), 2002.
 
3
A. Calì, D. Calvanese, G. De Giacomo, and M. Lenzerini. Accessing data integration systems through conceptual schemas. In Proc. of the 10th Ital. Conf. on Database Systems (SEBD 2002), pages 161--168, 2002.
 
4
 
5
6
 
7
A. Calì, D. Lembo, and R. Rosati. Query rewriting and answering under constraints in data integration systems. In Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), pages 16--21, 2003.
 
8
M. A. Casanova, R. Fagin, and C. H. Papadimitriou. Inclusion dependencies and their interaction with functional dependencies. J. of Computer and System Sciences, 28(1):29--59, 1984.
 
9
T. Catarci and M. Lenzerini. Representing and using interschema knowledge in cooperative information systems. J. of Intelligent and Cooperative Information Systems, 2(4):375--398, 1993.
 
10
A. K. Chandra and M. Y. Vardi. The implication problem for functional and inclusion dependencies is undecidable. SIAM J. on Computing, 14(3):671--677, 1985.
 
11
12
 
13
 
14
 
15
S. Gribble, A. Halevy, Z. Ives, M. Rodrig, and D. Suciu. What can databases do for peer-to-peer? In Proc. of the 4th Int. Workshop on the Web and Databases (WebDB 2001), 2001.
 
16
A. Halevy, Z. Ives, D. Suciu, and I. Tatarinov. Schema mediation in peer data management systems. In Proc. of the 19th IEEE Int. Conf. on Data Engineering (ICDE 2003), pages 505--516, 2003.
 
17
18
 
19
20
 
21
 
22
J. Madhavan and A. Y. Halevy. Composing mappings among data sources. In Proc. of the 29th Int. Conf. on Very Large Data Bases (VLDB 2003), pages 572--583, 2003.
 
23
 
24
M. P. Papazoglou, B. J. Kramer, and J. Yang. Leveraging Web-services and peer-to-peer networks. In Proc. of the 15th Int. Conf. on Advanced Information Systems Engineering (CAiSE 2003), pages 485--501, 2003.
 
25

CITED BY  26
Collaborative Colleagues:
Diego Calvanese: colleagues
Giuseppe De Giacomo: colleagues
Maurizio Lenzerini: colleagues
Riccardo Rosati: colleagues