Paper Info
Title
Improving Join Reorderability with Compensation Operators.
Abstract
A critical task in query optimization is the join reordering problem which is to find an efficient evaluation order for the join operators in a query plan. While the join reordering problem is well studied for queries with only inner-joins, the problem becomes considerably harder when outerjoins/antijoins are involved as such operators are generally not associative. The existing solutions for this problem do not enumerate the complete space of join orderings due to various restrictions on the query rewriting rules considered. In this paper, we present a novel approach for this problem for the class of queries involving inner-joins, single-sided outerjoins, and/or antijoins. Our work is able to support complete join reorderability for this class of queries which supersedes the state-of-the-art approaches.
Year
DOI
Venue
2018
10.1145/3183713.3183731
SIGMOD/PODS '18: International Conference on Management of Data Houston TX USA June, 2018
Keywords
Field
DocType
Query optimization,join reordering
Query optimization,Query Rewriting,Data mining,Associative property,Complete metric space,Computer science,Theoretical computer science,Operator (computer programming),Query plan
Conference
ISSN
ISBN
Citations 
0730-8078
978-1-4503-4703-7
0
PageRank 
References 
Authors
0.34
10
2
Name
Order
Citations
PageRank
TaiNing Wang100.68
Chee Yong Chan2643199.24