Abstract
Some problems concerned with the presence of multiple paths between two entities in a database schema are examined. A notion of equivalent paths is described and used to define a "natural" subschema. The presence of natural subschemata gives rise to an integrity constraint for which simple graph-theoretic results are obtained. These results are also used to suggest path finding methods for high-level query systems in which paths between entities need not be specified.
Original language | English |
---|---|
Title of host publication | Fifth International Conference on Very Large Data Bases, October 3-5, 1979, Rio de Janeiro, Brazil, Proceedings |
Editors | Antonio L. Furtado, Howard L. Morgan |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 368-372 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 1979 |