TY - JOUR
T1 - Optimizing join index based join processing
T2 - a graph partitioning approach
AU - Ravada, Sivakumar
AU - Shekhar, Shashi
AU - Lu, Chang tien
AU - Chawla, Sanjay
PY - 1998/12/1
Y1 - 1998/12/1
N2 - The cost of join computation, which uses a join-index in a sequential system with limited buffer space, depends primarily on the page access sequence used to fetch the pages of the base relations. In this paper, we introduce a graph-partitioning model that will minimize the length of the page access sequence thus minimizes the redundant I/O, given a fixed buffer. Experiments with Sequoia 2000 data sets show that, the graph-partitioning method outperforms the existing methods based on sorting and online clustering, particularly for a small number of buffers and high join selectivity.
AB - The cost of join computation, which uses a join-index in a sequential system with limited buffer space, depends primarily on the page access sequence used to fetch the pages of the base relations. In this paper, we introduce a graph-partitioning model that will minimize the length of the page access sequence thus minimizes the redundant I/O, given a fixed buffer. Experiments with Sequoia 2000 data sets show that, the graph-partitioning method outperforms the existing methods based on sorting and online clustering, particularly for a small number of buffers and high join selectivity.
UR - http://www.scopus.com/inward/record.url?scp=0032313819&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032313819&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0032313819
SN - 1060-9857
SP - 302
EP - 308
JO - Proceedings of the IEEE Symposium on Reliable Distributed Systems
JF - Proceedings of the IEEE Symposium on Reliable Distributed Systems
ER -