Finding compact scheme forests in nested normal form is NP-hard (Q1322463)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding compact scheme forests in nested normal form is NP-hard |
scientific article; zbMATH DE number 563070
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding compact scheme forests in nested normal form is NP-hard |
scientific article; zbMATH DE number 563070 |
Statements
Finding compact scheme forests in nested normal form is NP-hard (English)
0 references
12 January 1995
0 references
query processing performance
0 references
relational databases
0 references
nested normal form
0 references
multivalued dependencies
0 references
0.92229605
0 references
0.82915395
0 references
0.8219528
0 references
0.8143641
0 references
0.8107152
0 references
0.8082841
0 references
0.80418974
0 references
0.80248237
0 references
0.8023293
0 references
