Skip Navigation

The Computer Journal 1990 33(1):2-10; doi:10.1093/comjnl/33.1.2
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Baik, K. H.
Right arrow Articles by Miller, L. L.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Topological Approach for Testing Equivalence in Heterogenous Relational Databases

K. H. Baik1 * and L. L. Miller2 §

1 Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin 53201, USA, 2 Department of Computer Science, Iowa State University, Ames, Iowa 50011, USA

The concept of equivalence of heterogeneous relational database schemes is discussed. The use of a topological space defined over the attribute set is shown as a useful intermediate step in the process of establishing the equivalence of two heterogeneous database schemes. A means of selecting an optimal topology is given. The algorithms necessary to test for topological equivalence and the equivalence of two heterogeneous relational database schemes are given.


Received October 1986. revised March 1988.

* Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin 53201, USA

§ Department of Computer Science, Iowa State University, Ames, Iowa 50011, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.