PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Asirelli P., Inverardi P., Raffaelli V. Recursive query optimization and partial evaluation. Internal note IEI-B4-09, 1990.
 
 
Abstract
(English)
The paper presents an approach to recursive query optimization based upon the integration of partial evaluation and already existing rule transformation based, optimization methods such as Magic Set, Minimagic and Counting. The basic idea is to partially evaluate a logic program with respect to a query (goal), thus eliminating unnecessary intermediate (IDB) predicates and then further optimize the program, with respect to evaluation, by using one of the mentioned optimization methods. The advantage of the proposal is twofold: on one hand to give the user freedom of using all the power of a logical language to define the query program and, on the other, to keep efficiency into reasonable range.
Subject Logic programming
Partial evaluation
Deductive database
Recursive query optimization


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional