Title :
Estimating the cost of GraphLog queries
Author :
Escalante, Carlos ; Horspool, R. Nigel
Author_Institution :
Dept. of Comput. Sci., Victoria Univ., BC, Canada
Abstract :
The efficiency of query execution in a logic program depends very strongly on the order in which subgoals are evaluated. If a suitable evaluation order is chosen, the number of alternatives to be explored is reduced, and the overall efficiency may be improved. We present a cost model that estimates the number of solutions associated with GraphLog queries, based on a probabilistic approach. The inclusion of transitive closure and recursion is also discussed
Keywords :
logic programming; probability; query languages; query processing; software cost estimation; GraphLog queries; cost estimation; efficiency; logic program; probabilistic approach; query execution; recursion; transitive closure; Computer science; Costs; Database languages; Deductive databases; Logic programming; Operating systems; Performance evaluation; Predictive models; Probability; Query processing;
Conference_Titel :
Communications, Computers, and Signal Processing, 1995. Proceedings., IEEE Pacific Rim Conference on
Conference_Location :
Victoria, BC
Print_ISBN :
0-7803-2553-2
DOI :
10.1109/PACRIM.1995.519429
