Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Efficient Database Access from Prolog
Ceri S., Gottlob G., Wiederhold G. IEEE Transactions on Software Engineering15 (2):153-164,1989.Type:Article
Date Reviewed: Jul 1 1989

This paper presents a new approach to handling large fact bases for artificial intelligence and applies it to the design of an interface between databases and Prolog. It extends a previous paper by the authors, which was based on preanalysis. The interface acts as a loading mechanism. The authors introduce tracers in order to formalize the meta-knowledge about the structure of formulas and handle the loading of data from secondary storage during program execution more efficiently. Tracers can be partially ordered and this ordering can be used both to load the subsumed (i.e., the common) part first and, later on, to handle exceptions like negative facts. The authors implement the method as a prototype and show its effectiveness by means of comparisons. The method is new and seems to be applicable to general query and transaction handling in databases and knowledge bases as well, especially in Prolog-like environments.

Reviewer:  B. Thalheim Review #: CR113272
Bookmark and Share
 
Prolog (H.2.3 ... )
 
 
Access Methods (H.2.2 ... )
 
 
Data Models (H.2.1 ... )
 
 
Logic And Constraint Programming (F.4.1 ... )
 
 
Logic Programming (I.2.3 ... )
 
 
Modules And Interfaces (D.2.2 ... )
 
  more  
Would you recommend this review?
yes
no

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy