DataQuest: A comparative analysis of heuristic query optimization algorithms

The thesis is an implementation and study on query optimization for a single-user database system. The general objective is to show whether applying query optimization in a single-user interpretative relational DBMS is justifiable. The specific objectives are: to implement a prototype relational dat...

Full description

Saved in:
Bibliographic Details
Main Authors: Lanuza, Michael L., Motas, Aristeo Gil R., Nerona, Leah Francisca V., Zalatar, William F.
Format: text
Language:English
Published: Animo Repository 1994
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_bachelors/6899
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
id oai:animorepository.dlsu.edu.ph:etd_bachelors-7543
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_bachelors-75432022-08-14T06:22:45Z DataQuest: A comparative analysis of heuristic query optimization algorithms Lanuza, Michael L. Motas, Aristeo Gil R. Nerona, Leah Francisca V. Zalatar, William F. The thesis is an implementation and study on query optimization for a single-user database system. The general objective is to show whether applying query optimization in a single-user interpretative relational DBMS is justifiable. The specific objectives are: to implement a prototype relational database management system, and to implement and analyze two query optimization algorithms. The prototype DBMS is an interpretative system and is based on the relational model. Its main function is to process ad-hoc queries. An SQL interface provides commands for data definition (CREATE, DROP, COPY and SORT) and data manipulation (INSERT and SELECT). Database information and statistics are stored and maintained by the system catalog manager. The system uses two storage structures: heap files, hash files and b+tree indices. Relational operations using different kinds of access paths are implemented. Two query optimization algorithms are implemented for the study. The algebraic manipulation technique is a heuristic algorithm and is based on the relational algebra tree. It applies transformation rules to optimize the tree. The optimized tree is then submitted to a relational algebra tree processor which performs the query. The decomposition technique is a heuristic algorithm which applies detachment and tuple substitution strategies to optimize the query. It dynamically processes the query during optimization. Aside from these algorithms, a query processing strategy without optimization is also implemented. A sample database is created for the analysis. Query response time is the parameter used for comparison. 1994-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/6899 Bachelor's Theses English Animo Repository Database management Mathematical optimization Query (Information retrieval system) System analysis--Data processing Computer Sciences
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Database management
Mathematical optimization
Query (Information retrieval system)
System analysis--Data processing
Computer Sciences
spellingShingle Database management
Mathematical optimization
Query (Information retrieval system)
System analysis--Data processing
Computer Sciences
Lanuza, Michael L.
Motas, Aristeo Gil R.
Nerona, Leah Francisca V.
Zalatar, William F.
DataQuest: A comparative analysis of heuristic query optimization algorithms
description The thesis is an implementation and study on query optimization for a single-user database system. The general objective is to show whether applying query optimization in a single-user interpretative relational DBMS is justifiable. The specific objectives are: to implement a prototype relational database management system, and to implement and analyze two query optimization algorithms. The prototype DBMS is an interpretative system and is based on the relational model. Its main function is to process ad-hoc queries. An SQL interface provides commands for data definition (CREATE, DROP, COPY and SORT) and data manipulation (INSERT and SELECT). Database information and statistics are stored and maintained by the system catalog manager. The system uses two storage structures: heap files, hash files and b+tree indices. Relational operations using different kinds of access paths are implemented. Two query optimization algorithms are implemented for the study. The algebraic manipulation technique is a heuristic algorithm and is based on the relational algebra tree. It applies transformation rules to optimize the tree. The optimized tree is then submitted to a relational algebra tree processor which performs the query. The decomposition technique is a heuristic algorithm which applies detachment and tuple substitution strategies to optimize the query. It dynamically processes the query during optimization. Aside from these algorithms, a query processing strategy without optimization is also implemented. A sample database is created for the analysis. Query response time is the parameter used for comparison.
format text
author Lanuza, Michael L.
Motas, Aristeo Gil R.
Nerona, Leah Francisca V.
Zalatar, William F.
author_facet Lanuza, Michael L.
Motas, Aristeo Gil R.
Nerona, Leah Francisca V.
Zalatar, William F.
author_sort Lanuza, Michael L.
title DataQuest: A comparative analysis of heuristic query optimization algorithms
title_short DataQuest: A comparative analysis of heuristic query optimization algorithms
title_full DataQuest: A comparative analysis of heuristic query optimization algorithms
title_fullStr DataQuest: A comparative analysis of heuristic query optimization algorithms
title_full_unstemmed DataQuest: A comparative analysis of heuristic query optimization algorithms
title_sort dataquest: a comparative analysis of heuristic query optimization algorithms
publisher Animo Repository
publishDate 1994
url https://animorepository.dlsu.edu.ph/etd_bachelors/6899
_version_ 1743177697113145344