Estimating Query Containment by querying a single database instance
This paper examines the possibility of simply querying a database as a fast approximation for the query containment problem and measures its accuracy compared with a proper solver. The algorithm for a Correct Query Containment solver, which is used for comparisons sake, as well as the approximative ...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Skolan för datavetenskap och kommunikation (CSC)
2016
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-187257 |
| Summary: | This paper examines the possibility of simply querying a database as a fast approximation for the query containment problem and measures its accuracy compared with a proper solver. The algorithm for a Correct Query Containment solver, which is used for comparisons sake, as well as the approximative algorithm is laid out. The database that was used to approximate query containment is also discussed. The results are discussed as well as the areas that this method can be applied to. Further ways to increase the accuracy is discussed. The results show that while the method has some potential the accuracy can be poor. A genetic algorithm is used to increase the accuracy for one set of queries, but the results failed to carry over to other sets of queries. |
|---|