Abstract
Two relational databases are considered as equivalent, if a reply to an arbitrary query to the first database can be obtained by the means of the second one, and vice versa. The problem is to formalize this idea and to develop an algorithm of verification of relational databases equivalence. In the paper this problem is solved for relational databases with finite data algebras.
| Original language | American English |
|---|---|
| Title of host publication | Advances in Databases and Information Systems |
| Editors | Johann Eder, Leonid A. Kalinichenko |
| Publisher | Springer London |
| State | Published - 1996 |