Efficient evaluation for a subset of recursive queries (Q3210148)
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: Efficient evaluation for a subset of recursive queries |
scientific article; zbMATH DE number 4191088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient evaluation for a subset of recursive queries |
scientific article; zbMATH DE number 4191088 |
Statements
Efficient evaluation for a subset of recursive queries (English)
0 references
1991
0 references
evaluation
0 references
recursive queries
0 references
logic databases
0 references
Datalog program
0 references
binary- chain program
0 references
0.8292722105979919
0 references
0.8279779553413391
0 references
0.8248595595359802
0 references
