Please use this identifier to cite or link to this item:
|Title:||An adaptable distributed query processing architecture|
|Keywords:||Adaptive query processing|
|Citation:||Zhou, Y., Ooi, B.C., Tan, K.-L., Tok, W.H. (2005). An adaptable distributed query processing architecture. Data and Knowledge Engineering 53 (3) : 283-309. ScholarBank@NUS Repository. https://doi.org/10.1016/j.datak.2004.08.004|
|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 difficult 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, we introduce a new highly adaptive distributed query processing architecture. Our architecture can quickly detect fluctuations in selectivities of operations, as well as transmission speeds and workloads of servers, and accordingly change the operation order of a distributed query plan during execution. We have implemented a prototype based on the Telegraph system [Telegragraph project. Available from <http://telegraph.cs.berkeley.edu/>]. Our experimental study shows that our mechanism can adapt itself to the changes in the environment and hence approach to an optimal plan during execution. © 2004 Elsevier B.V. All rights reserved.|
|Source Title:||Data and Knowledge Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 23, 2018
WEB OF SCIENCETM
checked on May 8, 2018
checked on May 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.