Database Paper Browser

Back to papers

Quasi-inverses of Schema Mappings

Summary: Introduce quasi-inverse, a relaxation of inverse that quotients instances equivalent for data exchange; give a necessary-and-sufficient combinatorial criterion for s-t tgds, showing LAV mappings always have quasi-inverses while some full s-t tgds do not. Characterize the languages needed to express quasi-inverses and inverses (resolving an open problem) and show quasi-inverses can often recover exported data in data-exchange scenarios. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1422
Venue
PODS
Year
2007
Pagerank
8.2908844e-05
Overall Rank
2,692 | 81.28%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 17 of 17 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
48 Data Integration: A Theoretical Perspective 2002 PODS 0.00069720859
188 Applying Model Management to Classical Meta Data Problems 2003 CIDR 0.00035968389
621 Schema Mappings, Data Exchange, and Metadata Management 2005 PODS 0.00019005115
822 Composing Schema Mappings: Second-Order Dependencies to the Rescue 2004 PODS 0.00016255689
879 Composing Mappings Among Data Sources 2003 VLDB 0.00015674595
1,494 Inverting Schema Mappings 2006 PODS 0.00011693148
1,742 Composition of Mappings Given by Embedded Dependencies 2005 PODS 0.00010708408
Previous Page 1 / 1 Next

Semantically Similar Papers