An efficient framework for order optimization
Published • Sep 28, 2004
Authors:,
Thomas Neumann
Guido Moerkotte
Abstract
Since the introduction of cost-based query optimization, the performance-critical role of interesting orders has been recognized. Some algebraic operators change interesting orders (e.g. sort and select), while others exploit interesting orders (e.g. merge join). The two operations performed by any ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!