Join processing heuristics in relational database systems
Due to its direct impact on the performance of relational database management systems (DBMS), query processing algorithms have been the subject of considerable study. Typical processing strategies involve the calculation of elaborate cost functions to find an “optimum” one. The topic of this paper i...
Gespeichert in:
Veröffentlicht in: | Information systems (Oxford) 1990, Vol.15 (4), p.429-444 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Due to its direct impact on the performance of relational database management systems (DBMS), query processing algorithms have been the subject of considerable study. Typical processing strategies involve the calculation of elaborate cost functions to find an “optimum” one. The topic of this paper is to develop optimization heuristics to complement (and sometimes replace) these elaborate cost functions with emphasis on the optimization of join queries. The heuristics are identified by means of detailed simulations of a particular DBMS model under various environmental conditions. The system model is based on System R. |
---|---|
ISSN: | 0306-4379 1873-6076 |
DOI: | 10.1016/0306-4379(90)90046-R |