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
Worst-case complexity analysis of methods for logic query implementation
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Logic programming and databases
Logic programming and databases
Journal of Logic Programming
Comparison of methods for logic-query implementation
Journal of Logic Programming
Efficient bottom-up computation of queries on stratified databases
Journal of Logic Programming
An optimal graph traversal algorithm for evaluating linear binary-chain programs
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Counting methods for cyclic relations
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
IEEE Transactions on Knowledge and Data Engineering
First-Order Logic Characterization of Program Properties
IEEE Transactions on Knowledge and Data Engineering
Chain-Split Evaluation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the Fifth International Conference on Data Engineering
A Bottom-up Query Evaluation Method for Stratified Databases
Proceedings of the Ninth International Conference on Data Engineering
On the Optimal Top-down Evaluation of Recursive Queries
DEXA '94 Proceedings of the 5th International Conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
In this paper, an optimal method for evaluating linear recursive datalog queries is proposed. The method is based on the concepts of so-called heritage appearance function and heritage selection function. By computing such functions in topological order, a counting-like strategy can be implemented, which requires only linear time for non-cyclic data.