About bypassing of multivalued dependency in the relational data model
New approach to analyze of multivalued dependencies of attributes of relational relations is offered in this work. The theorem about bypassing of multivalued dependency that allows to not decompositionse relation is proved. The conclusion about possibility of modeling Nlinks with cardinality “many-t...
Saved in:
| Date: | 2026 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | Russian |
| Published: |
PROBLEMS IN PROGRAMMING
2026
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/933 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: |  |
Institution
Problems in programming| Summary: | New approach to analyze of multivalued dependencies of attributes of relational relations is offered in this work. The theorem about bypassing of multivalued dependency that allows to not decompositionse relation is proved. The conclusion about possibility of modeling Nlinks with cardinality “many-to-many” with help of by-passed relations is drawn.Problems in programming 2010; 2-3: 428-433 |
|---|