{"id":{"repo_id":"freiburg-diss","oai_identifier":"oai:freidok.uni-freiburg.de:1780"},"canonical_url":"https://search.dev.ndltd.org/etd/freiburg-diss/oai:freidok.uni-freiburg.de:1780","repository":{"repo_id":"freiburg-diss","name":"University of Freiburg","base_url":"https://freidok.uni-freiburg.de/oai/oai2.php"},"display":{"title":"Query equivalence and containment on relational and tree databases","abstract":"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.","abstract_html":"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. &lt;br&gt;&lt;br&gt;As far as the query containment problem is concerned, various algorithms and complexity results can be obtained, depending on the following three factors:&lt;br&gt;the query language,&lt;br&gt;whether some constraints are considered,&lt;br&gt;the structure of the database.&lt;br&gt;&lt;br&gt;In this work, we address the query containment problem from the above three different aspects by giving algorithms and complexity results.","abstract_has_math":false,"creators":["Wei, Fang"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Lausen, Georg"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-07-24T02:22:28Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://freidok.uni-freiburg.de/data/1780","outbound_label":"Repository record","outbound_source":"source_url"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Lausen, Georg"]},{"key":"dc:creator","label":"Author","values":["Wei, Fang"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:type","label":"Dc Type","values":["DoctoralThesis"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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.","Das ,,Query Containment'' Problem handelt von der \"Überprüfung der Teilmengenrelation zweier Ergebnismengen die von zwei Anfragen an eine beliebige Datenbank resultieren.<br><br>Algorithmen zur Lösung des ,,Query Containment'' Problems spielen eine wichtige Rolle inerhalb verschiedenster Teilbereiche von Datenbanken.<br><br>Das ,,Query Containment'' Problem kann im Wesentlichen unter den folgenden drei Kriterien betrachtet werden:<br>die Anfragesprache,<br>die Berücksichtigung von Constraints,<br>die Struktur der Datenbank.<br><br>In der vorliegenden Arbeit werden unter Berücksichtigung dieser drei Kriterien, Algorithmen und Komplexitätsangaben für das \"Query Containment\" Problem vorgestellt."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Query equivalence and containment on relational and tree databases","Das Query Containment Problem auf relationalen und baumstrukturierten Datenbanken"]}]}],"canonical_facts":{"dc:contributor":["Lausen, Georg"],"dc:creator":["Wei, Fang"],"dc:description.abstract":["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.","Das ,,Query Containment'' Problem handelt von der \"Überprüfung der Teilmengenrelation zweier Ergebnismengen die von zwei Anfragen an eine beliebige Datenbank resultieren.<br><br>Algorithmen zur Lösung des ,,Query Containment'' Problems spielen eine wichtige Rolle inerhalb verschiedenster Teilbereiche von Datenbanken.<br><br>Das ,,Query Containment'' Problem kann im Wesentlichen unter den folgenden drei Kriterien betrachtet werden:<br>die Anfragesprache,<br>die Berücksichtigung von Constraints,<br>die Struktur der Datenbank.<br><br>In der vorliegenden Arbeit werden unter Berücksichtigung dieser drei Kriterien, Algorithmen und Komplexitätsangaben für das \"Query Containment\" Problem vorgestellt."],"dc:format.medium":["application/pdf"],"dc:title":["Query equivalence and containment on relational and tree databases","Das Query Containment Problem auf relationalen und baumstrukturierten Datenbanken"],"dc:type":["DoctoralThesis"]},"updated_at":"2026-07-24T02:22:28Z"}