Access Path Optimization in Relational Joins

DOI10.1287/IJOC.7.3.257MaRDI QIDQ4896430zbMATH OpenOpenAlexFDO

Authors

Publication date 20 October 1996

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.7.3.257

zbMATH Keywords

access path optimizationrelational joins

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Optimizing the cost of relational queries using partial-relation schemes
• Page access scheduling in join processing
• Heuristics for join processing using nonclustered indexes
• Problem of optimizing the number of block accesses in performing relational join is NP-hard
• Use of graph-theoretic models for optimal relational database accesses to perform join

Cited in

(7)

• Optimizing the cost of relational queries using partial-relation schemes
• Page access scheduling in join processing
• Heuristics for join processing using nonclustered indexes
• scientific article; zbMATH DE number 1945884 (Why is no real title available?)
• Use of graph-theoretic models for optimal relational database accesses to perform join
• scientific article; zbMATH DE number 7650999 (Why is no real title available?)
• Problem of optimizing the number of block accesses in performing relational join is NP-hard

This page was built for publication: Access Path Optimization in Relational Joins

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