HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Mathematics >
MATH Master Theses  >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/5102
Title: Decomposition on relational databases
Authors: Du, Zilin
Issue Date: 2000
Abstract: Hypergraph has been proven to be a very useful structure in relational database theory. The family of relational schemes or join dependencies can be divided into acyclic and cyclic, according to their associated hypergraphs. The GYO Algorithm is an efficient algorithm to decompose an acyclic join dependency into a set of multivalued dependencies, but it fails on cyclic join dependencies. A new algorithm extended from the GYO Algorithm is given to decompose a cyclic join dependency into a set of smaller join dependencies. This algorithm also works for acyclic join dependencies.
Description: Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2000
vi, 51 leaves : ill. ; 30 cm
HKUST Call Number: Thesis MATH 2000 Du
URI: http://hdl.handle.net/1783.1/5102
Appears in Collections:MATH Master Theses

Files in This Item:

File Description SizeFormat
th_redirect.html0KbHTMLView/Open

All items in this Repository are protected by copyright, with all rights reserved.