Criss-Cross Hash Joins: Design and Analysis

Abstract

ÐJoin processing in relational database systems continues to be a difficult and challenging problem. In this research, we propose a criss-cross hash join strategy that draws from both hashing and indexing techniques, inheriting the advantages of each. To facilitate the criss-cross hash join, a simple data structure, termed page map, is introduced. The page… (More)
DOI: 10.1109/69.940737

Topics

10 Figures and Tables

Slides referencing similar topics