Title:
Symbolic Reasoning for Query Verification and Optimization
Symbolic Reasoning for Query Verification and Optimization
| dc.contributor.advisor | Harris, William | |
| dc.contributor.advisor | Arulraj, Joy | |
| dc.contributor.author | Zhou, Qi | |
| dc.contributor.committeeMember | Orso, Alex | |
| dc.contributor.committeeMember | Regehr, John | |
| dc.contributor.committeeMember | Navathe, Shamkant B. | |
| dc.contributor.department | Computer Science | |
| dc.date.accessioned | 2021-01-11T17:14:48Z | |
| dc.date.available | 2021-01-11T17:14:48Z | |
| dc.date.created | 2020-12 | |
| dc.date.issued | 2020-12-10 | |
| dc.date.submitted | December 2020 | |
| dc.date.updated | 2021-01-11T17:14:48Z | |
| dc.description.abstract | Structured Query Language (SQL) is the most widely used language for interacting with many database management systems (DBMS). Thus, the problems of optimizing and verifying SQL queries are two of the most studied problems in the DBMS community. Traditional techniques for optimizing and verifying SQL queries are based on syntax-driven approaches, which suffer many limitations in terms of effectiveness and efficiency. In this dissertation, I investigate two important problems in query verification and optimization to demonstrate the limitations of syntax-driven techniques: (1) proving query equivalence under set and bag semantics; (2) optimizing queries with learned predicates. I propose to use symbolic reasoning to address the limitations of syntax-driven approaches in these two problems. I first present two techniques for proving query equivalence under set and bag semantics based on symbolic representation. Both approaches are significantly more efficient and effective than the previous state-of-the-art syntax-driven techniques. I then present a novel algorithm that combines symbolic reasoning with machine learning to synthesize new predicates for optimizing queries. This algorithm enables the query optimizer to leverage more optimization rules that it cannot previously apply. This technique significantly speeds up the execution of queries with complex predicates. In conclusion, this thesis proved that using symbolic reasoning can significantly improve the efficiency and effectiveness of techniques for query equivalence verification and query optimization. | |
| dc.description.degree | Ph.D. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/64222 | |
| dc.language.iso | en_US | |
| dc.publisher | Georgia Institute of Technology | |
| dc.subject | Symbolic Reasoning Query Verification | |
| dc.title | Symbolic Reasoning for Query Verification and Optimization | |
| dc.type | Text | |
| dc.type.genre | Dissertation | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | College of Computing | |
| local.contributor.corporatename | School of Computer Science | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isOrgUnitOfPublication | 6b42174a-e0e1-40e3-a581-47bed0470a1e | |
| thesis.degree.level | Doctoral |