Page Access Sequencing in Join Processing with Limited Buffer Space

Authors:
Chen Qun;Andrew Lim;Wee-Chong Oon
Affiliations:
-;-;-
Venue:
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Year:
2001

Citing 7
Cited 0

Join indices

ACM Transactions on Database Systems (TODS)
Performance of a Composite Attribute and Join Index

IEEE Transactions on Software Engineering
Heuristics for Join Processing Using Nonclustered Indexes

IEEE Transactions on Software Engineering
Join processing in relational databases

ACM Computing Surveys (CSUR)
Page access scheduling in join processing

Proceedings of the eighth international conference on Information and knowledge management
Efficient Scheduling of Page Access in Index-Based Join Processing

IEEE Transactions on Knowledge and Data Engineering
Storage and access in relational data bases

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

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.