Skip to content

Commit c91be6d

Browse files
Update docs/relational-databases/tables/graph-edge-constraints.md
Co-authored-by: Arvind Shyamsundar <arvindsh@microsoft.com>
1 parent 396ba61 commit c91be6d

1 file changed

Lines changed: 1 addition & 1 deletion

File tree

docs/relational-databases/tables/graph-edge-constraints.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -44,7 +44,7 @@ CONSTRAINT constraint_name CONNECTION (cause1[, clause2...])
4444
- As stated previously, an edge constraint can contain one or more edge constraint clauses.
4545

4646
#### Multiple constraints and clauses
47-
- Multiple edge constraints are enforced with an `AND` operator.
47+
- Multiple edge constraints defined for the same edge table, are enforced with an `AND` operator.
4848
- Multiple edge constraint _clauses_ are enforced with an `OR` operator.
4949

5050
Consider the `Supplier` and `Customer` nodes in your graph. Each can be related to the `Product` node by a single, shared edge table: `bought`. This supports `Customer -(bought)-> Product` and `Supplier -(bought)-> Product`. This is accomplished using a single edge constraint with multiple edge constraint clauses.

0 commit comments

Comments
 (0)