scientific article; zbMATH DE number 1755579

zbMATH Open0988.68727MaRDI QIDQ4535467FDOQ4535467

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

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

query processingheuristic designJoin processing

Mathematics Subject Classification ID

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

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)