Skip to main content
Article thumbnail
Location of Repository

The VLDB Journal c ○ Springer-Verlag 1997 SEEKing the truth about ad hoc join costs

By Laura M. Haas, Michael J. Carey, Miron Livny and Amit Shukla

Abstract

Abstract. In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom ” about join algorithm performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive optimal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations can lead to large performance improvements, e.g., as much as a 400 % improvement in some cases. We also validate our cost model’s predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly useful to implementors of relational query optimizers and query processing systems

Topics: Key words, Optimization – Cost models – Join methods – Buffer allocation – Performance
Year: 1993
OAI identifier: oai:CiteSeerX.psu:10.1.1.412.1887
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.vldb.org/journal/VL... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.