62 citations · 101 across the 15 of their papers we have counts for
4 papers · 1 filter
Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach
Guimu Guo, Da Yan, M. Tamer Özsu +2
Given a user-specified minimum degree threshold , a -quasi-clique is a subgraph where each vertex connects to at least fraction of the other vert…
Experimental Analysis of Distributed Graph Systems
Khaled Ammar, Tamer Ozsu
This paper evaluates eight parallel graph processing systems: Hadoop, HaLoop, Vertica, Giraph, GraphLab (PowerGraph), Blogel, Flink Gelly, and GraphX (SPARK) over four very large d…
G-thinker: Big Graph Mining Made Easier and Faster
Da Yan, Hongzhi Chen, James Cheng +3
This paper proposes a general system for compute-intensive graph mining tasks that find from a big graph all subgraphs that satisfy certain requirements (e.g., graph matching and c…
Quegel: A General-Purpose Query-Centric Framework for Querying Big Graphs
Da Yan, James Cheng, M. Tamer Özsu +5
Pioneered by Google's Pregel, many distributed systems have been developed for large-scale graph analytics. These systems expose the user-friendly "think like a vertex" programming…