Access Path Optimization for Network Database Retrieval (Query, Relational, Codasyl)
Chen, Huei-Huang
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/69535
Description
Title
Access Path Optimization for Network Database Retrieval (Query, Relational, Codasyl)
Author(s)
Chen, Huei-Huang
Issue Date
1984
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Abstract
In evaluating a query using a network database, the links need to either be followed or be saved. Most of the previous approaches follow the links in evaluating a query using a network database. Actually, it is not always necessary to follow the links in answering a query using a network database, nor does it always result in the fewest disk page accesses. Two new data retrieval methods are presented so that the links are saved in a database relation for later use. The methods proposed combine traditional relational and network retrieval methods. In many cases, these new methods show substantial performance improvement in evaluating queries using network databases {CK84a}. The proposed methods are useful for database retrieval from network databases as well as from relational databases implemented with links {CK84b}.
A network database system without a high-level query interface is very difficult for naive users to use. Therefore, a high-level query interface is usually provided to translate a user's queries into efficient network queries. The query optimization algorithms for such a system are presented in a stepwise fashion by beginning with finding an optimal access path for a given access tree using the proposed methods as well as the traditional method of database retrieval. The algorithm for enumerating all possible access trees to answer a query is then presented. A heuristic method is also presented for processing more complex queries that can only be answered by joining the results of two or more access trees.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
