Representation of directed ultra- and hypergraphs with constraints in a relational database
A method for the formal mathematical description of directed ultra- and hypergraphs with constraints in a convenient form for their representation in relational databases is suggested, which is characterized by introduction of constraints represented in terms of set theory into graph description. Th...
Gespeichert in:
| Veröffentlicht in: | Automatic documentation and mathematical linguistics 2011-04, Vol.45 (2), p.64-73 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | A method for the formal mathematical description of directed ultra- and hypergraphs with constraints in a convenient form for their representation in relational databases is suggested, which is characterized by introduction of constraints represented in terms of set theory into graph description. The structure of a relational database, which makes it possible to describe ultragraphs and hypergraphs with constraints provided by the referential and domain integrity of a database, is proposed. |
|---|---|
| ISSN: | 0005-1055 1934-8371 |
| DOI: | 10.3103/S0005105511020026 |