Recursive query optimization in deductive databases via proof-tree transformations
Uses the proof-tree transformation technique to study two different recursive query optimization problems: 1-boundedness, and, stage preserving linearizability.
Main Author: | Ashraf, Karima |
---|---|
Format: | Others |
Published: |
1996
|
Online Access: | http://spectrum.library.concordia.ca/4086/1/MM10819.pdf Ashraf, Karima <http://spectrum.library.concordia.ca/view/creators/Ashraf=3AKarima=3A=3A.html> (1996) Recursive query optimization in deductive databases via proof-tree transformations. Masters thesis, Concordia University. |
Similar Items
-
Recursive query processing in deductive databases using graph traversal and rule compilation techniques
by: Cañabate, Estrella Pulido
Published: (1996) -
Studies on the Optimization of Query Processing in Deductive Databases
by: Uno, Yushi
Published: (2012) -
Temporal deductive databases : query finiteness and a query language
by: Nonen, Daniel A
Published: (1993) -
Toward an efficient query processor for a deductive database system
by: Yim, Chi Hang
Published: (1991) -
Access clause trees in disjunctive deductive databases
by: Obimbo, Charlie F.
Published: (2006)