ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Binary decompositions and acyclic schemes

Lakshmanan, VS and Madhavan, Veni CE (1986) Binary decompositions and acyclic schemes. In: Lecture Notes in Computer Science, 241 . pp. 214-238.

Full text not available from this repository. (Request a copy)
Official URL: http://springerlink.metapress.com/content/ph420jg2...


It is well known that the notions of normal forms and acyclicity capture many practical desirable properties for database schemes. The basic schema design problem is to develop design methodologies that strive toward these ideals. The usual approach is to first normalize the database scheme as far as possible. If the resulting scheme is cyclic, then one tries to transform it into an acyclic scheme. In this paper, we argue in favor of carrying out these two phases of design concurrently. In order to do this efficiently, we need to be able to incrementally analyze the acyclicity status of a database scheme as it is being designed. To this end, we propose the formalism of "binary decompositions". Using this, we characterize design sequences that exactly generate theta-acyclic schemes, for theta = agr,beta. We then show how our results can be put to use in database design. Finally, we also show that our formalism above can be effectively used as a proof tool in dependency theory. We demonstrate its power by showing that it leads to a significant simplification of the proofs of some previous results connecting sets of multivalued dependencies and acyclic join dependencies.

Item Type: Journal Article
Publication: Lecture Notes in Computer Science
Publisher: Springer
Additional Information: Copyright of this article belongs to Springer.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 29 Jul 2009 03:09
Last Modified: 29 Jul 2009 03:09
URI: http://eprints.iisc.ac.in/id/eprint/21758

Actions (login required)

View Item View Item