skip to main content
10.1145/1065167.1065188acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article

Peer data exchange

Published: 13 June 2005 Publication History

Abstract

In this paper, we introduce and study a framework, called peer data exchange, for sharing and exchanging data between peers. This framework is a special case of a full-fledged peer data management system and a generalization of data exchange between a source schema and a target schema. The motivation behind peer data exchange is to model authority relationships between peers, where a source peer may contribute data to a target peer, specified using source-to-target constraints, and a target peer may use target-to-source constraints to restrict the data it is willing to receive, but cannot modify the data of the source peer.
A fundamental algorithmic problem in this framework is that of deciding the existence of a solution: given a source instance and a target instance for a fixed peer data exchange setting, can the target instance be augmented in such a way that the source instance and the augmented target instance satisfy all constraints of the setting? We investigate the computational complexity of the problem for peer data exchange settings in which the constraints are given by tuple generating dependencies. We show that this problem is always in NP, and that it can be NP-complete even for "acyclic" peer data exchange settings. We also show that the data complexity of the certain answers of target conjunctive queries is in coNP, and that it can be coNP-complete even for "acyclic" peer data exchange settings.
After this, we explore the boundary between tractability and intractability for the problem of deciding the existence of a solution. To this effect, we identify broad syntactic conditions on the constraints between the peers under which testing for solutions is solvable in polynomial time. These syntactic conditions include the important special case of peer data exchange in which the source-to-target constraints are arbitrary tuple generating dependencies, but the target-to-source constraints are local-as-view dependencies. Finally, we show that the syntactic conditions we identified are tight, in the sense that minimal relaxations of them lead to intractability.

References

[1]
S. Abiteboul and O. M. Duschka. Complexity of answering queries using materialized views. In PODS, pages 254--263, 1998.]]
[2]
M. Arenas, L. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In PODS, pages 68--79, 1999.]]
[3]
C. Beeri and M. Vardi. A proof procedure for data dependencies. Journal of the ACM, 31(4):718--741, 1984.]]
[4]
P. Bernstein, F. Giunchiglia, A. Kementsietsidis, J. Mylopoulos, L. Serafini, and I. Zaihrayeu. Data management for Peer-to-Peer computing: A vision. In WebDB, pages 89--94, 2002.]]
[5]
L. Bertossi and L. Bravo. Query answering in peer-to-peer data exchange systems. In EDBT Workshop on Peer-to-Peer Computing and Databases, 2004.]]
[6]
D. Calvanese, G. D. Giacomo, M. Lenzerini, and R. Rosati. Logical foundations of peer-to-peer data integration. In PODS, pages 241--251, 2004.]]
[7]
R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. In ICDT, pages 207--224, 2003.]]
[8]
R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. To appear in Theoretical Computer Science. In press., 2005.]]
[9]
R. Fagin, P. G. Kolaitis, and L. Popa. Data exchange: getting to the core. In PODS, pages 90--101, 2003. To appear in TODS.]]
[10]
E. Franconi, G. Kuper, A. Lopatenko, and L. Serafini. A robust logical and computational characterisation of peer-to-peer database systems. In VLDB Workshop on Databases, Information Systems and Peer-to-Peer Computing, 2003.]]
[11]
E. Franconi, G. Kuper, A. Lopatenko, and I. Zaihrayeu. The coDB robust peer-to-peer database system. In Symposium on Advanced Database Systems, pages 382--393, 2004.]]
[12]
G. Grahne. The Problem of Incomplete Information in Relational Databases. Spring-Verlag, Berlin, 1991. Lecture Notes in Computer Science, vol. 554.]]
[13]
G. Grahne and A. Mendelzon. Tableau techniques for querying information sources through global schemas. In ICDT, pages 332--347, 1999.]]
[14]
A. Halevy, Z. Ives, D. Suciu, and I. Tatarinov. Schema mediation in peer data management systems. In ICDE, pages 505--518, 2003.]]
[15]
M. Lenzerini. Data integration: A theoretical perspective. In PODS, pages 233--246, 2002.]]
[16]
C. Li. Raccoon: A peer-based system for data integration and sharing. In ICDE, page 852, 2004. System Demonstration.]]
[17]
C. O'Donovan, M. J. Martin, A. Gattiker, E. Gasteiger, A. Bairoch, and R. Apweiler. High-quality protein knowledge resource: Swiss-prot and trembl. Briefings in Bioinformatics, 3(3):275--284, 2002.]]
[18]
L. Popa, Y. Velegrakis, R. J. Miller, M. A. Hernández, and R. Fagin. Translating web data. In VLDB, pages 598--609, 2002.]]
[19]
I. Tatarinov. Semantic Data Sharing with a Peer Data Management System. PhD thesis, University of Washington, 2004.]]
[20]
I. Tatarinov and A. Y. Halevy. Efficient query reformulation in peer data management systems. In SIGMOD, pages 539--550, 2004.]]
[21]
R. van der Meyden. Logical approaches to incomplete information: A survey. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems, pages 307--356. Kluwer, 1998.]]

Cited By

View all
  • (2024)Implementation Strategies for Views over Property GraphsProceedings of the ACM on Management of Data10.1145/36549492:3(1-26)Online publication date: 30-May-2024
  • (2022)Incomplete Data and Data Dependencies in Relational DatabasesundefinedOnline publication date: 2-Mar-2022
  • (2018)Updates and Transactions in Peer-to-Peer SystemsEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_1222(4345-4348)Online publication date: 7-Dec-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODS '05: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
June 2005
388 pages
ISBN:1595930620
DOI:10.1145/1065167
  • General Chair:
  • Georg Gottlob,
  • Program Chair:
  • Foto Afrati
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2005

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SIGMOD/PODS05

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Implementation Strategies for Views over Property GraphsProceedings of the ACM on Management of Data10.1145/36549492:3(1-26)Online publication date: 30-May-2024
  • (2022)Incomplete Data and Data Dependencies in Relational DatabasesundefinedOnline publication date: 2-Mar-2022
  • (2018)Updates and Transactions in Peer-to-Peer SystemsEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_1222(4345-4348)Online publication date: 7-Dec-2018
  • (2017)Access Control Policies for Relational Databases in Data Exchange ProcessDatabase and Expert Systems Applications10.1007/978-3-319-64468-4_20(264-271)Online publication date: 1-Aug-2017
  • (2017)Updates and Transactions in Peer-to-Peer SystemsEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_1222-2(1-5)Online publication date: 2-Aug-2017
  • (2014)The backchase revisitedThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-013-0333-y23:3(495-516)Online publication date: 1-Jun-2014
  • (2013)Semantic query optimization in the presence of typesJournal of Computer and System Sciences10.1016/j.jcss.2013.01.01079:6(937-957)Online publication date: 1-Sep-2013
  • (2013)Capturing model-based ontology evolution at the instance levelJournal of Computer and System Sciences10.1016/j.jcss.2013.01.00679:6(835-872)Online publication date: 1-Sep-2013
  • (2013)On simplification of schema mappingsJournal of Computer and System Sciences10.1016/j.jcss.2013.01.00579:6(816-834)Online publication date: 1-Sep-2013
  • (2012)Recomputing Materialized Instances after Changes to Mappings and DataProceedings of the 2012 IEEE 28th International Conference on Data Engineering10.1109/ICDE.2012.107(330-341)Online publication date: 1-Apr-2012
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media