Multipredicate Join Algorithms for Accelerating Relational Graph Processing on GPUs

@inproceedings{Wu2014MultipredicateJA,
  title={Multipredicate Join Algorithms for Accelerating Relational Graph Processing on GPUs},
  author={Haicheng Wu and Daniel Zinn and Molham Aref and Sudhakar Yalamanchili},
  booktitle={ADMS@VLDB},
  year={2014}
}
Recent work has demonstrated that the use of programmable GPUs can be advantageous during relational query processing on analytical workloads. In this paper, we take a closer look at graph problems such as finding all triangles and all four-cliques of a graph. In particular, we present two different join algorithms for the GPU. The first is an implementation of Leapfrog-Triejoin (LFTJ), a recently presented worst-case optimal multi-predicate join algorithm. The second is a novel approach… CONTINUE READING
7 Citations
29 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Leapfrog triejoin: A simple

  • T. L. Veldhuizen
  • worst-case optimal join algorithm. ICDT’14, pages…
  • 2014
Highly Influential
11 Excerpts

Similar Papers

Loading similar papers…