Estimating the cost of graphlog queries
| dc.contributor.author | Escalante Osuna, Carlos | |
| dc.contributor.supervisor | Horspool, R. Nigel | |
| dc.date.accessioned | 2018-08-02T18:50:43Z | |
| dc.date.available | 2018-08-02T18:50:43Z | |
| dc.date.copyright | 1997 | en_US |
| dc.date.issued | 2018-08-02 | |
| dc.degree.department | Department of Computer Science | en_US |
| dc.degree.level | Doctor of Philosophy Ph.D. | en_US |
| dc.description.abstract | This dissertation develops a cost model for a particular implementation of the database query language GraphLog. The order in which the subgoals of a GraphLog query are executed has a major effect on the total processing time. Our model may be used to compare the expected execution costs for different orderings of the same general query, thus, allowing us to select an efficient execution plan. We describe two cost models: one that is tailored to a specific architecture and another that is more general. Both models assume a top-down evaluation strategy. In particular, we address the issue of how to handle recursive predicates. We also provide some experimental results that confirm the validity of our work. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/9850 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | SQL (Computer program language) | en_US |
| dc.subject | Graph theory | en_US |
| dc.subject | Data processing | en_US |
| dc.title | Estimating the cost of graphlog queries | en_US |
| dc.type | Thesis | en_US |