An efficient algorithm for processing multi-relation queries in relational databases (Q2277842)
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 4197414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for processing multi-relation queries in relational databases |
scientific article; zbMATH DE number 4197414 |
Statements
An efficient algorithm for processing multi-relation queries in relational databases (English)
0 references
1990
0 references
multi-relation queries
0 references
relational databases
0 references
NP-complete
0 references
polynomial- bounded approximation algorithm
0 references
0.7986818552017212
0 references
0.7944064140319824
0 references
0.7724108695983887
0 references
