Files in this item
|(no description provided)|
|Title:||Query Optimization for Relational Database Systems|
|Department / Program:||Computer Science|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|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.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980.
|Date Available in IDEALS:||2014-12-13|