Query optimization by predicate move-around

Details Query optimization by predicate move-around Query optimization by predicate move-around

G - Physics

06

F

G06F 17/30 (2006.01) G06F 7/10 (2006.01)

Patent

CA 2147678

Query optimization which is done by making a graph of the query and moving predicates around in the graph so that they will be applied early in the optimized query generated from the graph. Predicates are first propagated up from child nodes of the graph to parent nodes and then down into different child nodes. After thepredicates have been moved, redundant predicates are detected and removed. Predicates are moved through aggregation operations and new predicates are deduced from aggregation operations and from functional dependencies. The optimization is not dependent on join order and works where nodes of the graph cannot be merged.

Affiliated with

Also associated with

Rating

Query optimization by predicate move-around does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Query optimization by predicate move-around, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Query optimization by predicate move-around will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1605424