General-Purpose Join Algorithms for Listing Triangles in Large Graphs

@article{Zinn2015GeneralPurposeJA,
  title={General-Purpose Join Algorithms for Listing Triangles in Large Graphs},
  author={Daniel Zinn},
  journal={CoRR},
  year={2015},
  volume={abs/1501.06689}
}
We investigate applying general-purpose join algorithms to the triangle listing problem in an out-of-core context. In particular, we focus on Leapfrog Triejoin (LFTJ) by Veldhuizen[36], a recently proposed, worst-case optimal algorithm. We present “boxing”: a novel, yet conceptually simple, approach for feeding input data to LFTJ. Our extensive analysis shows that this approach is I/O efficient, being worst-case optimal (in a certain sense). Furthermore, if input data is only a constant factor… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

References

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

SNAP Datasets: Stanford large network dataset collection

  • J. Leskovec, A. Krevl
  • http://snap.stanford.edu/data, June
  • 2014
Highly Influential
4 Excerpts

Decomposition of finite graphs into forests

  • C.S.A. Nash-Williams
  • Journal of the London Mathematical Society, s1-39…
  • 1964
Highly Influential
3 Excerpts

A resolution-based framework for joins: Worst-case and beyond

  • M. A. Khamis, H. Q. Ngo, C. Ré, A. Rudra
  • CoRR, abs/1404.0703,
  • 2014
1 Excerpt

Similar Papers

Loading similar papers…