DocumentCode
2737373
Title
An optimization of disjunctive queries: union-pushdown
Author
Chang, Jae-young ; Lee, Sang-goo
Author_Institution
Dept. of Comput. Sci., Seoul Nat. Univ., South Korea
fYear
1997
fDate
11-15 Aug 1997
Firstpage
356
Lastpage
361
Abstract
Most previous works on query optimization techniques deal with conjunctive queries only because the queries with disjunctive predicates are complex to optimize. Hence, for disjunctive queries, query optimizers based on these techniques generate plans using rather simple methods such as CNF- and DNF-based optimization. However, the plans generated by these methods perform extremely poorly for certain types of queries. The authors propose new query optimization method, union-pushdown, for disjunctive queries. This method is composed of four phases, and each phase utilizes some advantageous techniques of CNF- and DNF-based methods. They analyze the performance of the union-pushdown plan against those of conventional plans and show that union-pushdown can be applied to various disjunctive query types without performance degradation
Keywords
planning; query processing; software performance evaluation; disjunctive predicates; disjunctive query optimization; performance analysis; plan generation; query optimizers; union-pushdown; Computer science; Costs; Data engineering; Degradation; Optimization methods; Performance analysis; Proposals; Query processing; Sections;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1997. COMPSAC '97. Proceedings., The Twenty-First Annual International
Conference_Location
Washington, DC
ISSN
0730-3157
Print_ISBN
0-8186-8105-5
Type
conf
DOI
10.1109/CMPSAC.1997.624993
Filename
624993
Link To Document