Skip to main content
SpringerLink
Log in

Page Access Sequencing in Join Processing with Limited Buffer Space

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2113))

Included in the following conference series:

  • 533 Accesses

Abstract

When performing the join operation in relational databases, one problem involves finding the optimal page access sequence such that the number of page re-accesses is minimized, given a fixed buffer size. This paper presents a new heuristic for this problem (known as OPAS2) that generally outperforms existing heuristics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.W. Blasgen and K.P. Eswaran, Storage and access in relational databases, IBM Systems Journal, 16 (1977), pp. 363–377.

    Article  Google Scholar 

  2. B.C. Desai, Performance of a composite attribute and join index, IEEE Trans. On Software Eng., 15 (1989), pp. 142–152.

    Article  MATH  Google Scholar 

  3. A. Lim, J. Kwan, and W.C. Oon, Page access sequencing for join processing, in International Conference on Information and Knowledge Management, 1999, pp. 276–283.

    Google Scholar 

  4. P. Mishra and M.H. Eich, Join processing in relational databases, ACM Computing Surveys, 24 (1992), pp. 64–113.

    Article  Google Scholar 

  5. E.R. Omiecinski, Heuristics for join processing using nonclustered indexes, IEEE Trans. Knowledge and Data Eng., 15 (1989), pp. 19–25.

    MathSciNet  Google Scholar 

  6. 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.

    Article  Google Scholar 

  7. P. Velduriez, Join indices, ACM Trans. on Database Systems, 12 (1987), pp. 218–246.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National University of Singapore, Lower Kent Ridge Road, Singapore, 119260

    Chen Qun, Andrew Lim & Oon Wee Chong

Authors
  1. Chen Qun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Oon Wee Chong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Klagenfurt, IFI -IWAS Universitaetsstr. 65, 9020, Klagenfurt, Austria

    Heinrich C. Mayr

  2. Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 166 27, Prague 6, Czech Republic

    Jiri Lazansky

  3. School of Computer and Information Science, University of South Australia, Mawson Lakes Campus, Mawson Lakes, SA, 5095

    Gerald Quirchmayr

  4. Department of Information Systems, Technical University of Munich, Orleanstr. 34, 81667, Munich, Germany

    Pavel Vogel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Qun, C., Lim, A., Wee Chong, O. (2001). Page Access Sequencing in Join Processing with Limited Buffer Space. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-44759-8_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42527-4

  • Online ISBN: 978-3-540-44759-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation