Change search
ReferencesLink to record
Permanent link

Direct link
Estimating Query Containment by querying a single database instance
KTH, School of Computer Science and Communication (CSC).
2016 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

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.

Place, publisher, year, edition, pages
National Category
Computer Science
URN: urn:nbn:se:kth:diva-187257OAI: diva2:929483
Available from: 2016-05-18 Created: 2016-05-18 Last updated: 2016-05-18Bibliographically approved

Open Access in DiVA

fulltext(651 kB)11 downloads
File information
File name FULLTEXT01.pdfFile size 651 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 11 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 31 hits
ReferencesLink to record
Permanent link

Direct link