ASAP: Fast, Approximate Graph Pattern Mining at Scale

@inproceedings{Iyer2018ASAPFA,
  title={ASAP: Fast, Approximate Graph Pattern Mining at Scale},
  author={Anand Padmanabha Iyer and Zaoxing Liu and Xin Jin and Shivaram Venkataraman and Vladimir Braverman and Ion Stoica},
  booktitle={OSDI},
  year={2018}
}
While there has been a tremendous interest in processing data that has an underlying graph structure, existing distributed graph processing systems take several minutes or even hours to mine simple patterns on graphs. This paper presents ASAP, a fast, approximate computation engine for graph pattern mining. ASAP leverages state-of-the-art results in graph approximation theory, and extends it to general graph patterns in distributed settings. To enable the users to navigate the tradeoff between… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 59 REFERENCES