The problem of multiple paths in a database schema

Authors:
Peter Buneman
Affiliations:
-
Venue:
VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
Year:
1979

Citing 5
Cited 0

The entity-relationship model—toward a unified view of data

ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Database abstractions: aggregation and generalization

ACM Transactions on Database Systems (TODS)
Database abstractions: aggregation

Communications of the ACM
FQL: a functional query language

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
The functional data model and the data language DAPLEX

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

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.