16 citations · 28 across the 4 of their papers we have counts for
8 papers
sGrapp: Butterfly Approximation in Streaming Graphs
Aida Sheshbolouki, M. Tamer Özsu
We study the fundamental problem of butterfly (i.e. (2,2)-bicliques) counting in bipartite streaming graphs. Similar to triangles in unipartite graphs, enumerating butterflies is c…
Evaluating Complex Queries on Streaming Graphs
Anil Pacaci, Angela Bonifati, M. Tamer Özsu
We study the problem of evaluating persistent queries over streaming graphs in a principled fashion. These queries need to be evaluated over unbounded and very high speed graph str…
Regular Path Query Evaluation on Streaming Graphs
Anil Pacaci, Angela Bonifati, M. Tamer Özsu
We study persistent query evaluation over streaming graphs, which is becoming increasingly important. We focus on navigational queries that determine if there exists a path between…
GSI: GPU-friendly Subgraph Isomorphism
Li Zeng, Lei Zou, M. Tamer Özsu +2
Subgraph isomorphism is a well-known NP-hard problem that is widely used in many applications, such as social network analysis and query over the knowledge graph. Due to the inhere…
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…