Access Path Optimization for Network Database Retrieval (Query, Relational, Codasyl)

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}.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2014

Author dc:creator

• Chen, Huei-Huang

• Computer Science

Identifier

(UMI)AAI8502102

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/69535