On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Filtering data flow in deductive databases
Proceedings on International conference on database theory
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming and databases
Logic programming and databases
Bottom-up method for processing recursive sets of rules
CompSysTech '03 Proceedings of the 4th international conference conference on Computer systems and technologies: e-Learning
Bottom-up method for processing recursive sets of rules
CompSysTech '03 Proceedings of the 4th international conference conference on Computer systems and technologies: e-Learning
| Hi-index | 0.00 |
The paper proposes a semi-naive method for processing recursive loops in the dependency graph for a given query. The process goes through two phases. During the expand phase answers are generated using translation to base conjunctions. Entries in recursive predicates with undistinguished arguments are also stored in the database for further processing. During the shrink phase the occurrences of recursive predicates in rule-bodies are replaced with the answers already generated during the expand phase. Thus, the whole rule-body becomes a base conjunction, which generates new answers. The proposed method is suitable for queries with bound arguments, it reduces unnecessary computations and generates only facts relevant to the given query.