2026-09-19T03:39:18Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/66446 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

eng Computer Science Query Optimization for Relational Database Systems text Kim, Won 2014-12-13T18:02:19Z 2014-12-13T18:02:19Z 10000-01-01 1980 1980 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. Made available in DSpace on 2014-12-13T18:02:19Z (GMT). No. of bitstreams: 1 8108563.pdf: 5412054 bytes, checksum: 1c0a1f06bb9b3e4bf85ad5afc716a30a (MD5) Previous issue date: 1980 Embargo set by: Seth Robbins for item 66624 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 161 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980. http://hdl.handle.net/2142/66446 (UMI)AAI8108563 Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.