@Article{Kosch2000, author = {Kosch, Harald}, journal = {Future Generation Computer Systems}, title = {Managing the operator ordering problem in parallel data-Bases}, year = {2000}, month = may, number = {No 3}, pages = {665-676}, volume = {Vol 16}, abstract = {This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-oriented Bushy Trees (LBT). Compared to the related approach of the General Bushy Trees (GBT) a significant complexity reduction of the operator ordering problem can be derived theoretically and demonstrated experimentally (e.g. compared with GBTs, LBTs authorize optimization time improvement that can reach up to 49%) without losing quality. Finally we demonstrate that existing commercial parallel query optimizers need little extension mod ifications in order to handle LBTs.}, address = {Langford Lane, Kidlington, Oxford OX5 1GB, United Kingdom}, keywords = {Parallel databases, Parallel query optimization, Linear-oriented Bushy Trees, Extending existing optimizers}, language = {EN}, pdf = {https://www.itec.aau.at/bib/files/1998-0039-Kosc.pdf}, publisher = {Elsevier} }