Award Date

1-1-1990

Degree Type

Thesis

Degree Name

Master of Science (MS)

First Committee Member

Kazam Taghva

Number of Pages

104

Abstract

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.

Keywords

Join; Optimizing; Project; Queries; Select

Controlled Subject

Computer science

File Format

pdf

File Size

2.10 MB

Degree Grantor

University of Nevada, Las Vegas

Language

English

Permissions

If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.


Share

COinS