On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
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
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Traversal recursion: a practical approach to supporting recursive applications
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Bounds on the propagation of selection into logic programs
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Safety of recursive Horn clauses with infinite relations
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Intelligent query answering in rule based systems
Journal of Logic Programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computing with logic: logic programming with Prolog
Computing with logic: logic programming with Prolog
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
A framework for testing safety and effective computability of extended datalog
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Safety of datalog queries over infinite databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic-based approach to semantic query optimization
ACM Transactions on Database Systems (TODS)
Evaluation of functions linear recursions: a compilation approach
Information Systems
Automatic generation of compiled forms for linear recursions
Information Systems
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
IEEE Transactions on Knowledge and Data Engineering
Compilation-Based List Processing in Deductive Databases
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
Semantic Query Optimization in Recursive Databases
Proceedings of the Fourth International Conference on Data Engineering
A Suitable Algorithm for Computing Partial Transitive Closures in Databases
Proceedings of the Sixth International Conference on Data Engineering
Chain-Split Evaluation in Deductive Databases
Proceedings of the Eighth International Conference on Data Engineering
On Semantic Query Optimization in Deductive Databases
Proceedings of the Eighth International Conference on Data Engineering
CORAL - Control, Relations and Logic
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
LogicBase: a deductive database system prototype
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Chain-Split Evaluation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Expert Systems with Applications: An International Journal
| Hi-index | 0.02 |
Constraints play an important role in the efficient query evaluation in deductive databases. Constraint-based query evaluation in deductive databases is investigated, with emphasis on linear recursions with function symbols. Constraints are grouped into three classes: rule constraints, integrity constraints, and query constraints. Techniques are developed for the maximal use of different kinds of constraints in rule compilation and query evaluation. The study on the roles of different classes of constraints in set-oriented evaluation of linear recursions shows the following: rule constraints should be integrated with their corresponding deduction rules in the compilation of recursions; integrity constraints, including finiteness constraints and monotonicity constraints, should be used in the analysis of finite evaluability and termination for specific queries; and query constraints, which are often useful in search space reduction and termination, should be transformed, when necessary, and should be pushed into the compiled chains as deeply as possible for efficient evaluation. The constraint-based query-processing technique integrates query-independent compilation and chain-based query evaluation methods and demonstrates its great promise in deductive query evaluation.