On the expected size of recursive datalog queries (Q1900920)
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: On the expected size of recursive datalog queries |
scientific article; zbMATH DE number 809411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the expected size of recursive datalog queries |
scientific article; zbMATH DE number 809411 |
Statements
On the expected size of recursive datalog queries (English)
0 references
25 October 1995
0 references
datalog
0 references
magic sets
0 references
factoring rewriting algorithms
0 references
0.7934305667877197
0 references
0.7911579012870789
0 references
0.7819533944129944
0 references
0.7773001790046692
0 references
0.7760583162307739
0 references
