Query equivalence and containment on relational and tree databases

The query containment problem is to check if the answer set of one query is always a subset of another query for any given database. Algorithms for query containment are crucial in several contexts in databases. <br><br>As far as the query containment problem is concerned, various algorithms and complexity results can be obtained, depending on the following three factors:<br>the query language,<br>whether some constraints are considered,<br>the structure of the database.<br><br>In this work, we address the query containment problem from the above three different aspects by giving algorithms and complexity results.

Author dc:creator

• Wei, Fang

Contributors dc:contributor

• Lausen, Georg

Repository record source_url

https://freidok.uni-freiburg.de/data/1780

OAI identifier oai:identifier

oai:freidok.uni-freiburg.de:1780