University of Illinois Urbana-Champaign

Query Optimization for Relational Database Systems

Kim, Won

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/66446

Description

Title
Query Optimization for Relational Database Systems
Author(s)
Kim, Won
Issue Date
1980
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
Language
eng
Abstract
  • This report develops a new algorithm for computing the Cartesian product and join of large relations which attempts to take maximum advantage of available main-memory buffer space.
  • It also proposes a new sorting technique for application in query processing which attempts to exploit the query and database characteristics as well as the available main-memory buffer space.
  • This report then analyzes the syntactical structure of a block-structured query language to expose the basic structures which constitute a general nested query of arbitrary complexity. It develops algorithms for efficiently processing each of the basic structures and constructs a coherent strategy for processing a general nested query by merging the basic algorithms.
  • Next, it takes a first cut at the problem of optimizing a set of queries and data manipulation statements which makes use of global knowledge of query and database characteristics. The strategy proposed is based on a compile-time analysis of queries embedded in some algorithmic programming language to determine those queries that can be simultaneously processed.
  • Finally, this report identifies the essential functional components of a database machine that can support all the major techniques for implementing database operations and proposes designs for them that are thought to be amenable to LSI (VLSI) implementation using existing and near-term technology.
Graduation Semester
1980
Type of Resource
text
Permalink
http://hdl.handle.net/2142/66446

Owning Collections

Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at Illinois
Dissertations and Theses - Computer Science
Dissertations and Theses from the Dept. of Computer Science