Optimizing select-project-join queries

An optimal retrieval algorithm for relational database queries is a highly sought after ideal. A great amount of research has been applied in the quest for a better, faster, and cheaper universal retrieval scheme. Unfortunately there is no panacea, no single "optimal" method. With the many different database languages we find a variety of retrieval algorithms. This thesis explores heuristic methods for optimizing relational database query algorithms. It combines individual works on heuristics, cost modeling, decomposition, and join optimization. Lastly it assesses these optimization methods.

Name thesis:degree_name

Master of Science (MS)

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor dc:publisher

University of Nevada, Las Vegas

Year

1990

Author dc:creator

• Miller, Rebecca Anne

Contributors dc:contributor

• Kazam Taghva

Statement dc:rights

• IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/

Language dc:language

English

Identifier

https://oasis.library.unlv.edu/rtds/106

OAI identifier oai:identifier

oai:oasis.library.unlv.edu:rtds-1105