Page access scheduling in join processing

DOI10.1016/S0169-023X(01)00009-XMaRDI QIDQ2734640zbMATH OpenWikidataFDO

Authors K. Lai Pheng, O. Wee Chong, Andrew Lim

Publication date 20 August 2001

Published in Data \& Knowledge Engineering (Search for Journal in Brave)

Full work available at URL http://scholarbank.nus.edu.sg/handle/10635/39095

zbMATH Keywords

scheduling page accesses

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Page access sequencing in join processing with limited buffer space
• Heuristics for join processing using nonclustered indexes
• Use of graph-theoretic models for optimal relational database accesses to perform join
• Access Path Optimization in Relational Joins
• Problem of optimizing the number of block accesses in performing relational join is NP-hard

Cited in

(6)

• Heuristics for join processing using nonclustered indexes
• A schedule of join operations to reduce I/O cost in spatial database systems
• Page access sequencing in join processing with limited buffer space
• Access Path Optimization in Relational Joins
• Use of graph-theoretic models for optimal relational database accesses to perform join
• An upper bound on buffer size for join operation using nonclustered indexes

This page was built for publication: Page access scheduling in join processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2734640)