An Adaptable Distributed Query Processing Architecture

@misc{citeulike:173635, abstract = {Traditionally, distributed query optimization techniques generate static query plans at compile time. However, the optimality of these plans depends on many parameters (such as the selectivities of operations, the transmission speeds and workloads of servers) that are not only di\#cult to estimate but are also often unpredictable and fluctuant at runtime. As the query processor cannot dynamically adjust the plans at runtime, the system performance is often less than satisfactory. In this paper,...}, author = {Zhou, Yongluan and Ooi, Beng C. and Tan, Kian-Lee and Tok, Wee H. }, citeulike-article-id = {173635}, keywords = {distributed, processing, query}, posted-at = {2007-10-10 01:57:39}, priority = {2}, title = {An Adaptable Distributed Query Processing Architecture}, url = {http://citeseer.ist.psu.edu/714038.html} }

TY - GEN ID - citeulike:173635 L3 - citeulike-article-id:173635 N2 - Traditionally, distributed query optimization techniques generate static query plans at compile time. However, the optimality of these plans depends on many parameters (such as the selectivities of operations, the transmission speeds and workloads of servers) that are not only di#cult to estimate but are also often unpredictable and fluctuant at runtime. As the query processor cannot dynamically adjust the plans at runtime, the system performance is often less than satisfactory. In this paper,... TI - An Adaptable Distributed Query Processing Architecture KW - distributed KW - processing KW - query AU - Zhou, Yongluan AU - Ooi, Beng AU - Tan, Kian-Lee AU - Tok, Wee UR - http://citeseer.ist.psu.edu/714038.html ER -