X-Join Project

X-Join and the Benefits of Free Work

Authors: Justin Forrester and Jonathan Ledlie
Contact: {jforrest, ledlie}@cs.wisc.edu

We report here on our experience implementing a new join algorithm called XJoin. XJoin improves the performance of the standard Hybrid Hash Join algorithm by allowing the joining of tuples that had been flushed to disk during otherwise idle periods. It is fairly straightforward to implement from the descriptions in the literature, with the exception of a few important neglected details. Our performance study shows the XJoin algorithm performs quite well when given tuple inputs that are bursty and/or slow.

Paper
Source Code
Related Work
- Tolga Urhan and Michael J. Franklin. Xjoin: Getting fast answers from slow and bursty networks.
  Technical Report CS-TR-3994, UMIACS-TR-99-13, University of Maryland, February 1999.

@unpublished{ forrester00xjoin,
        author = "Justin Forrester and Jonathan Ledlie",
        title = "X-Join and the Benefits of Free Work",
        institution = "University of Wisconsin - Madison",
        type = "Research Report",
        year = "2000",
        month = "May"
}

Last update: