Back to index

Query Evaluation Techniques for Large Databases (7)

Goetz Graefe

Summary by: Steve Gribble and Armando Fox

One-line summary: A comparison of techniques, costs, and implications of sort and hashed based query processing algorithms is presented in section 7 of this paper.

Overview/Main Points

Relevance

Points out a large number of similarities and contrasts between sort and hash based query processing algorithms. Situations in one is better than another, and situations in which care must be taken for either to work well are detailed, which is helpful.

Flaws


Back to index