Data exchange: On the complexity of answering queries with inequalities

Information Processing Letters

Volumn 94, Issue 6, 2005, Pages 253-257

  Ma̧dry, Aleksander ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

Certain answers; Computational complexity; Data exchange; Query answering

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DATABASE SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES; THEOREM PROVING;

CERTAIN ANSWERS; DATA EXCHANGE; LOCAL-AS-VIEW (LAV); QUERY ANSWERING;

DATA STRUCTURES;

EID: 18244363327     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.03.001     Document Type: Article

References (4)

1. S. Abiteboul, O.M. Duschka, Complexity of answering queries using materialized views, in: Proc. ACM Symp. on Principles of Database Systems (PODS), Seattle, WA, 1998, pp. 254-263
2. S. Abiteboul, O.M. Duschka, Complexity of answering queries using materialized views. Unpublished full version of [1], 2000
3. R. Fagin, P.G. Kolaitis, R.J. Miller, L. Popa, Data exchange: Semantics and query answering, in: Proc. Internat. Conf. on Database Theory (ICDT), 2003, pp. 207-224;
4. Theoret. Comput. Sci. (in press)