An upper bound on buffer size for join operation using nonclustered indexes

DOI10.1016/0020-0190(90)90102-4zbMath0704.68033OpenAlexW2021223098MaRDI QIDQ917280

Jong Soo Park, Jae Moon Lee, Myunghwan Kim

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90102-4

zbMATH Keywords

upper boundjoinvertex coverdata managementrelational data modelnonclustered indexes

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Hybrid join: An improved sort-based join algorithm
• Heuristics for join processing using nonclustered indexes
• Use of graph-theoretic models for optimal relational database accesses to perform join

This page was built for publication: An upper bound on buffer size for join operation using nonclustered indexes