Name
Abstract | ||
|---|---|---|
Query compilation in a deductive database refers to the process of continually replacing defined literals in rule bodies by their definitions until rules with references only to stored relations are obtained. The compiled forms generate the same tuples for the head literal in a database as do the original sets of rules. Previously, the rules were assumed to be function free. However, the use of universal quantifiers (corresponding to the division operator in a database) adds a new degree of flexibility in defining views. We propose a new inference rule, the substitution rule, to replace resolution in the compilation process. The substitution rule handles the embedded universal quantifiers correctly so that the compiled forms again derive all proper instances of the head literals. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/3-540-52885-7_79 | CADE |
Keywords | Field | DocType |
deductive databases,extended rule,substitution-based compilation,extended rules,inference rule | Deductive database,Tuple,Computer science,Operator (computer programming),Rule of inference,Integration by substitution,Database | Conference |
Volume | ISBN | Citations |
449 | 0-387-52885-7 | 3 |
PageRank | References | Authors |
7.08 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sang Ho Lee | 1 | 182 | 102.61 |
| Lawrence J. Henschen | 2 | 478 | 280.94 |