Please use this identifier to cite or link to this item:
|Title:||Virtual-join: A query execution technique|
|Authors:||Sung, S.Y. |
|Citation:||Sung, S.Y.,Sun, P.,Li, Z.,Tan, C.L. (2002). Virtual-join: A query execution technique. IEEE International Performance, Computing and Communications Conference, Proceedings : 353-357. ScholarBank@NUS Repository.|
|Abstract:||Although communication cost is still a major cost for distributed databases, local cost in distributed query processing cannot be neglected. Observing the fact that almost all commercial database products employ Plan Enumeration with Dynamic Programming (PEDP) techniques, we find reducing the cost of both communication and local processing in 2-way join has potential benefits. Although many methods for reducing communication cost have been proposed, most of them employ a cost model that neglects local processing cost. This paper proposes a join execution method (called virtual join) that considers both of them. Virtual join has two desirable features: 1) Being adaptive to different values of selectivity. 2) Giving accurate cardinality of join result before it is materialized. Experiment results showed virtual join was both adaptive and efficient.|
|Source Title:||IEEE International Performance, Computing and Communications Conference, Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.