Hashing Methods and Relational Algebra Operations


This paper present algorithms for relational algebra and set operations based on hashing. Execution times are computed and performance is compared to standard methods based on nested loop and sort-merge. The algorithms are intended for use on a monoprocessor computer with standard disks for data base storage. It is indicated however that hashing methods are… (More)


13 Figures and Tables


Citations per Year

210 Citations

Semantic Scholar estimates that this publication has 210 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics