Abstract
A new form of database integrity constraint is introduced which describes the structure present in data when that structure takes the form of a graph, tree or list. This type of integrity constraint is of particular benefit in reducing the overhead when detecting termination in the case of recursive queries.
| Original language | English |
|---|---|
| Pages (from-to) | 282-285 |
| Number of pages | 4 |
| Journal | Computer Journal |
| Volume | 34 |
| Issue number | 3 |
| Publication status | Published - Jun 1991 |