Virtual-join: a query execution technique
Sung, S.Y.
Peng Sun
Zhao Li
Tan, C.L.
Dept. of Comput. Sci., Nat. Univ. of Singapore ;
This paper appears in: Performance, Computing, and Communications Conference, 2002. 21st IEEE International
Publication Date: 2002
On page(s): 353-357
Meeting Date: 04/03/2002 - 04/05/2002
Location: Phoenix, AZ, USA
ISBN: 0-7803-7371-5
References Cited: 11
INSPEC Accession Number: 7342250
Digital Object Identifier: 10.1109/IPCCC.2002.995170
Current Version Published: 2002-08-07
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
