Back to results

University of Victoria (Canada)

Estimating the cost of graphlog queries

Abstract

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.

Degree

thesis:*
Level thesis:degree_level
Doctor of Philosophy Ph.D.
Department thesis:degree_department
Department of Computer Science
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Escalante Osuna, Carlos
Advisor dc:contributor.supervisor
  • Horspool, R. Nigel

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • Available to the World Wide Web
Language dc:language.iso
en, English

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1828/9850

Chain of custody

source
Harvested from
University of Victoria (Canada)
Base URL
dspace.library.uvic.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Escalante Osuna, Carlos. Estimating the cost of graphlog queries. Doctor of Philosophy Ph.D. thesis, 2018. http://hdl.handle.net/1828/9850