Testing unboundedness of database schemes and functional dependencies (Q1115211)
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: Testing unboundedness of database schemes and functional dependencies |
scientific article; zbMATH DE number 4085078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing unboundedness of database schemes and functional dependencies |
scientific article; zbMATH DE number 4085078 |
Statements
Testing unboundedness of database schemes and functional dependencies (English)
0 references
1988
0 references
The paper shows that there is a general and sufficient condition for unboundedness of database schemes and functional dependencies. It is also shown that though the condition can be tested effectively, the corresponding probability cannot be calculated in polynomial time.
0 references
weak instances
0 references
database schemes
0 references
functional dependencies
0 references
0.8782092
0 references
0 references
0.8591266
0 references
0.8577536
0 references
0.8526692
0 references
0.84917235
0 references
0 references
