Problem of optimizing the number of block accesses in performing relational join is NP-hard (Q808230)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4209568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Problem of optimizing the number of block accesses in performing relational join is NP-hard |
scientific article; zbMATH DE number 4209568 |
Statements
Problem of optimizing the number of block accesses in performing relational join is NP-hard (English)
0 references
1991
0 references
NP-complete problems
0 references
database access
0 references
relational join
0 references
0.85351694
0 references
0 references
0.82948697
0 references
0.82873046
0 references
0.82692724
0 references
0.8225496
0 references
