Heuristics for join processing using nonclustered indexes

DOI10.1109/32.21722MaRDI QIDQ3814843zbMATH OpenOpenAlexWikidataFDO

Authors Edward Omiecinski

Publication date 1989

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/32.21722

zbMATH Keywords

bipartite graphheuristicsjoin operatorquery processingrelational databasesecondary indexes

Mathematics Subject Classification ID

Theory of operating systems (68N25) Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Page access scheduling in join processing
• 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
• Access Path Optimization in Relational Joins
• scientific article; zbMATH DE number 1755579

Cited in

(8)

• Join during merge: an improved sort based algorithm
• Page access scheduling in join processing
• Faster joins, self-joins and multi-way joins using join indices
• Avoiding Cartesian products for multiple joins
• Access Path Optimization in Relational Joins
• Use of graph-theoretic models for optimal relational database accesses to perform join
• Bipartite permutation graphs with application to the minimum buffer size problem
• An upper bound on buffer size for join operation using nonclustered indexes

This page was built for publication: Heuristics for join processing using nonclustered indexes

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