{"id":{"repo_id":"unlv","oai_identifier":"oai:oasis.library.unlv.edu:rtds-1105"},"canonical_url":"https://search.dev.ndltd.org/etd/unlv/oai:oasis.library.unlv.edu:rtds-1105","repository":{"repo_id":"unlv","name":"University of Nevada - Las Vegas","base_url":"https://oasis.library.unlv.edu/do/oai/"},"display":{"title":"Optimizing select-project-join queries","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Miller, Rebecca Anne"],"institution":"University of Nevada, Las Vegas","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kazam Taghva"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1990,"date_issued":"1990-01-01T08:00:00Z","date_published":"1990-01-01T08:00:00Z","updated_at":"2026-07-24T05:24:07Z","subjects":[],"languages":["English"],"rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://oasis.library.unlv.edu/rtds/106"],"render_values":[{"text":"https://oasis.library.unlv.edu/rtds/106","href":"https://oasis.library.unlv.edu/rtds/106","code":true}]}]},"links":{"outbound_url":"https://doi.org/10.25669/jqko-lgum","outbound_label":"DOI","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kazam Taghva"]},{"key":"dc:creator","label":"Author","values":["Miller, Rebecca Anne"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["University of Nevada, Las Vegas"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.25669/jqko-lgum","https://oasis.library.unlv.edu/rtds/106","https://oasis.library.unlv.edu/context/rtds/article/1105/viewcontent/uc.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:format","label":"Dc Format","values":["pdf"]},{"key":"dc:title","label":"Title","values":["Optimizing select-project-join queries"]}]}],"canonical_facts":{"dc:contributor":["Kazam Taghva"],"dc:creator":["Miller, Rebecca Anne"],"dc:description.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."],"dc:format":["pdf"],"dc:identifier":["10.25669/jqko-lgum","https://oasis.library.unlv.edu/rtds/106","https://oasis.library.unlv.edu/context/rtds/article/1105/viewcontent/uc.pdf"],"dc:language":["English"],"dc:publisher":["University of Nevada, Las Vegas"],"dc:rights":["IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Optimizing select-project-join queries"],"dc:type":["Text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-07-24T05:24:07Z"}