scientific article; zbMATH DE number 1755579

MaRDI QIDQ4535467zbMATH OpenFDO

Authors Chen Qun, Andrew Lim, Oon Wee Chong

Publication date 16 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2113/21130380

zbMATH Keywords

query processingheuristic designJoin processing

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Database theory (68P15)

Recommendations

• Page access scheduling in join processing
• On the separation and equivalence of paging strategies
• Relative interval analysis of paging algorithms on access graphs
• Relative interval analysis of paging algorithms on access graphs
• An upper bound on buffer size for join operation using nonclustered indexes
• scientific article; zbMATH DE number 1379109

Cited in

(2)

• Page access scheduling in join processing
• Heuristics for join processing using nonclustered indexes

This page was built for publication:

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