Prolog: a database query language for all seasons
Proceedings from the first international workshop on Expert database systems
Towards an integrated database-Prolog system
Proceedings from the first international workshop on Expert database systems
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Rule management for heterogeneous knowledge-based systems
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
A deductive database architecture based on partial evaluation
ACM SIGMOD Record
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deductive databases: achievements and future directions
ACM SIGMOD Record - Directions for future database research & development
Semantics for update rule programs and implementation in a relational database management system
ACM Transactions on Database Systems (TODS)
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
The Design, Implementation, and Performance Evaluation of BERMUDA
IEEE Transactions on Knowledge and Data Engineering
LDL: A Logic-Based Data Language
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Building knowledge base management systems
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Educe is a logic programming system for handling large knowledge bases. It was constructed by fully integrating the logic programming language Prolog and the relational data base management system Ingres. Educe uses a hybrid strategy for the evaluation of queries. This strategy is based on two contrasting strategies. The strategy known as sets retrieval, transforms recursive and non-recursive queries into a form suitable for evaluation by a relational data base management system. The other strategy, known as one-tuple-at-a time, evaluates queries by imitating the evaluation strategy of the programming language Prolog. In earlier versions of Educe, users selected the strategy by using two different query languages. In order to remove this responsibility from the user, algorithms to map expressions from either of the languages into the other were implemented and added to Educe. This paper briefly reviews the implementation of both evaluators and the mappings compares the basic strategies of evaluation, and then proceeds to explain Educe's own strategy.