Date of Award
Master of Science
Relational databases have been utilized in a variety of applications, such as airline reservation systems, healthcare systems, accounting systems, etc. In relational databases, data are spread among interrelated relations. Relationships among tuples in different relations can be reconstructed by matching join attribute values, namely performing the (equi-)join operations. Unfortunately, the join operation is arguably the most important but expensive operation in query processing. Unlike conventional approaches, in this thesis, we propose to reorganize tuples in relations so that joins can be performed easily and efficiently. We attempt to place tuples in different relations that have the matching join attribute values at corresponding positions in their respective relations, called relation co-clustering. In this thesis, we discuss how to co-clustering relations, perform joins on co-clustered relations on Microsoft SQL server 2017.
This thesis is only available for download to the SIUC community. Current SIUC affiliates may also access this paper off campus by searching Dissertations & Theses @ Southern Illinois University Carbondale from ProQuest. Others should contact the interlibrary loan department of your local library or contact ProQuest's Dissertation Express service.