A New Algorithm for Page Access Sequencing in Join Processing

  • Andrew Lim
  • Oon Wee Chong
  • Chi -Hung Chi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1884)


One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which requires the minimum number of buffer pages if there are no page reaccesses, and 2) finding a page access sequence which requires the minimum number of page reaccesses given a fixed buffer size. In general, a heuristic for the first problem can be converted to a corresponding heuristic to the second problem.

In this paper, a new heuristic is proposed. The experimental results show that the new heuristic performs significantly better than existing heuristics for data which is modelled with geometric graphs, and no worse in others, for the first problem. It performs similarly better for the second problem if the fixed buffer size is not much less than the maximum buffer size generated in the first problem.


Bipartite Graph General Graph Maximum Match Geometric Graph Runtime Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. C. Desai, Performance of a composite attribute and join index, IEEE Trans. on Software Eng., 15 (1989), pp. 142–152.zbMATHCrossRefGoogle Scholar
  2. 2.
    P. Mishra and M. H. Eich, Join processing in relational databases, ACM Computing Surveys, 24 (1992), pp. 64–113.CrossRefGoogle Scholar
  3. 3.
    E. R. Omiecinski, Heuristics for join processing using nonclustered indexes, IEEE Trans. Knowledge and Data Eng., 15 (1989), pp. 19–25.MathSciNetGoogle Scholar
  4. 4.
    B. C. Ooi and C. Y. Chan, Efficient scheduling of page access in index-based join processing, IEEE Trans. Knowledge and Data Eng., 9 (1997), pp. 1005–1011.CrossRefGoogle Scholar
  5. 5.
    The Open University, Networks 3: Assignment and Transportation, walton Hall, Milton Keynes, MK7 6AA.Google Scholar
  6. 6.
    C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization-Algorithms and Complexity, Prentice Hall International, Inc, Englewood Cliffs, NJ 07632, USA, 1989.Google Scholar
  7. 7.
    P. Valduriez, Join indices, ACM Trans. on Database Systems, 12 (1987), pp. 218–246.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Andrew Lim
    • 1
  • Oon Wee Chong
    • 1
  • Chi -Hung Chi
    • 1
  1. 1.Department of Computer ScienceNational University of SingaporeSingapore

Personalised recommendations