Page access scheduling in join processing

Authors:
Andrew Lim;Jennifer Lai-Pheng Kwan;Wee-Chong Oon
Affiliations:
School of Computing, National University of Singapore, 10, Kent Ridge Crescent, Singapore 119260;DSO National Laboratories, 20 Science Park Drive, Singapore 118230;School of Computing, National University of Singapore, 10, Kent Ridge Crescent, Singapore 119260
Venue:
Proceedings of the eighth international conference on Information and knowledge management
Year:
1999

Citing 8
Cited 1

Use of graph-theoretic models for optimal relational database accesses to perform join

ACM Transactions on Database Systems (TODS)
Heuristics for Join Processing Using Nonclustered Indexes

IEEE Transactions on Software Engineering
Join processing in relational databases

ACM Computing Surveys (CSUR)
Query evaluation techniques for large databases

ACM Computing Surveys (CSUR)
A simple min-cut algorithm

Journal of the ACM (JACM)
Access path selection in a relational database management system

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Optimal Secondary Storage Access Sequence for Performing Relational Join

IEEE Transactions on Knowledge and Data Engineering
Efficient Scheduling of Page Access in Index-Based Join Processing

IEEE Transactions on Knowledge and Data Engineering

Page Access Sequencing in Join Processing with Limited Buffer Space

DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This raises two interesting problems: 1) determining a page access sequence that uses the minimum number of buffer pages without any page reaccesses, and 2) determining a page access sequence that minimizes the number of page reaccesses for a given buffer size. We use a graph model to represent the pages from the relations that contain tuples to be joined, and present new heuristics for the two problems based on the sort-merge join and the simple TID algorithm. Our experimental results show that the new heuristics perform well.