Conjunctive Queries and Mappings With Unequalities
Loading...
Related Collections
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Karvounarakis, Grigoris
Contributor
Abstract
We study conjunctive queries with unequalities (x ≠ y) and we identify cases when query containment can still be characterized by the existence of homomorphisms. We also identify a class of GLAV-like database schema mappings with unequalities, for which the chase theorem holds, and thus data exchange has the same complexity as for GLAV mappings. Finally, we define a notion of consistency and provide an algorithm to check whether a set of mappings is consistent.
Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2008-01-01
Volume number
Issue number
Publisher
Publisher DOI
Comments
University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-08-37