NDLI: Data correspondence, exchange and repair

Please wait, while we are loading the content...

Increasing representational power and scaling reasoning in probabilistic databases

Foundations of SPARQL query optimization

Aggregate queries for discrete and continuous probabilistic XML

Synthesizing view definitions from data

Composition with target constraints

The complexity of rooted phylogeny problems

Static analysis of schema-mappings ensuring oblivious termination

Data correspondence, exchange and repair

From polynomial time queries to graph structure theory

Efficient processing of 3-sided range queries with probabilistic guarantees

Querying parse trees of stochastic context-free grammars

k-jump strategy for preserving privacy in micro-data disclosure

Answering non-monotonic queries in relational data exchange

A greedy algorithm for constructing a low-width generalized hypertree decomposition

Mapping polymorphism

Forward-XPath and extended register automata on data-trees

Provenance for database transformations

A theoretical study of 'Snapshot Isolation'

Probabilistic data exchange

Bag equivalence of XPath queries

On the tradeoff between mapping and querying power in XML data exchange

Composing local-as-view mappings: closure and applications

On the aggregation problem for synthesized web services

Data correspondence, exchange and repair

Content Provider	ACM Digital Library
Author	Onet, Adrian Grahne, Gösta
Abstract	Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical perspective. In this paper we formally introduce the data correspondence setting and its associated computational problems: checking the existence of solutions, and verifying whether a candidate is a solution, for three distinct types of solutions. Data correspondence is a generalization of data exchange and peer data exchange, and a special case of repairing inconsistent databases. We introduce a new class of dependencies, called semi-LAV, that properly includes both LAV and full dependencies, while retaining tractability for peer data exchange, data correspondence, and database repairs. We also introduce the concept of Σ-satisfying homomorphisms. This new type of homomorphism, together with recent advances, is essential in achieving tractability, while at the same time allowing a large class of dependencies, namely the aforementioned semi-LAV ones. We also show the intractability for a series of problems in the case of weakly acyclic tuple generating dependencies. This implies that many tractability results for weakly acyclic dependencies do not carry over to data correspondence; in these new settings we need to restrict the dependencies a bit further, yielding our semi-LAV dependencies.
Starting Page	219
Ending Page	230
Page Count	12
File Format	PDF
ISBN	9781605589473
DOI	10.1145/1804669.1804698
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-03-23
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Data correspondence, exchange and repair.

Recovering Exchanged Data

Data Exchange with Data-Metadata Translations (2008)

Data Exchange with Data-Metadata Translations (2008)

CONDOR: A System for CONstraint DiscOvery and Repair

Episiotomy and Perineal Repair (Published 17 February 1945)

Endovascular Aortic Aneurysm Repair—Reply

An architecture for universal CAD data exchange

Nasal Plastic Repair (Published 15 May 1926)

Data correspondence, exchange and repair

Similar Documents

Data correspondence, exchange and repair.

Recovering Exchanged Data

Data Exchange with Data-Metadata Translations (2008)

Data Exchange with Data-Metadata Translations (2008)

CONDOR: A System for CONstraint DiscOvery and Repair

Episiotomy and Perineal Repair (Published 17 February 1945)

Endovascular Aortic Aneurysm Repair—Reply

An architecture for universal CAD data exchange

Nasal Plastic Repair (Published 15 May 1926)

Data correspondence, exchange and repair