This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Scheduling of Page Access in Index-Based Join Processing
November-December 1997 (vol. 9 no. 6)
pp. 1005-1011

Abstract—This paper examines the issue of scheduling page accesses in join processing, and proposes new heuristics for the following scheduling problems: 1) an optimal page access sequence for a join such that there are no page reaccesses using the minimum number of buffer pages, and 2) an optimal page access sequence for a join such that the number of page reaccesses for a given number of buffer pages is minimum. Our experimental performance results show that the new heuristics perform better than existing heuristics for the first problem and also perform better for the second problem, provided that the number of available buffer pages is not much less than the optimal buffer size.

[1] E. Bertino and W. Kim, “Indexing Technique for Queries on Nested Objects,” IEEE Trans. Knowledge and Data Eng., vol. 1, no. 2, pp. 196-214, 1989.
[2] C.Y. Chan and B.C. Ooi, "Efficient Scheduling of Page Access in Join Processing," unpublished manuscript, http://www.iscs.nus.sg/ooibc/papersjoin.ps , Apr. 1995.
[3] B.C. Desai, “Performance of a Composite Attribute and Join Index,” IEEE Trans. Software Eng., vol. 15, no. 2, Feb. 1989.
[4] F. Fotouhi and S. Pramanik, "Optimal Secondary Storage Access Sequence for Performing Relational Join," IEEE Trans. Knowledge and Data Eng., vol. 1, no. 3, pp. 318-328, Sept. 1989.
[5] G. Graefe, "Query Evaluation Techniques for Large Databases," ACM Computing Surveys, vol. 25, no. 2, pp. 73-170, June 1993.
[6] A. Kemper and G. Moerkotte, “Access Support in Object Bases,” Proc. ACM-SIGMOD Int'l Conf. Management of Data, pp. 364-374, 1990.
[7] H. Lu, R. Luo, and B.C. Ooi, "Spatial Query Processing by Approximations," J. Australian Computer Science Comm., vol. 17, no. 2, pp. 132-142, 1995.
[8] T. Merrett, Y. Kambayashi, and H. Yasuura, "Scheduling of Page Fetches in Join Operations," Proc. Seventh VLDB, pp. 488-498,Cannes, France, Sept. 1981.
[9] P. Mishra and M.H. Eich, "Join Processing in Relational Databases," ACM Computing Surveys, vol. 24, no. 1, pp. 64-113, Mar. 1992.
[10] E.R. Omiecinski, "Heuristics for Join Processing Using Nonclustered Indexes," IEEE Trans. Software Eng., vol. 15, no. 1, pp. 18-25, Jan. 1989.
[11] S. Pramanik and D. Ittner, "Use of Graph-Theoretic Models for Optimal Relational Database Accesses to Perform Join," ACM Trans. Database Systems, vol. 10, no. 1, pp. 57-74, Mar. 1985.
[12] P. Valduriez, “Join Indices,” ACM Trans. Database Systems, vol. 12, no. 2, 1987.

Index Terms:
Heuristics, join index, join processing, page access scheduling, page access sequence.
Citation:
Chee Yong Chan, Beng Chin Ooi, "Efficient Scheduling of Page Access in Index-Based Join Processing," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 6, pp. 1005-1011, Nov.-Dec. 1997, doi:10.1109/69.649322
Usage of this product signifies your acceptance of the Terms of Use.