-
sGrapp: Butterfly Approximation in Streaming Graphs
We study the fundamental problem of butterfly (i.e. (2,2)-bicliques) cou...
01/29/2021 ∙ by Aida Sheshbolouki, et al. ∙
0
∙
share
read it
-
Evaluating Complex Queries on Streaming Graphs
In this paper, we study the problem of evaluating persistent queries ove...
01/28/2021 ∙ by Anil Pacaci, et al. ∙
0
∙
share
read it
-
The Future is Big Graphs! A Community View on Graph Processing Systems
Graphs are by nature unifying abstractions that can leverage interconnec...
12/11/2020 ∙ by Sherif Sakr, et al. ∙
0
∙
share
read it
-
Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach
Given a user-specified minimum degree threshold γ, a γ-quasi-clique is a...
04/30/2020 ∙ by Guimu Guo, et al. ∙
0
∙
share
read it
-
Regular Path Query Evaluation on Streaming Graphs
We study persistent query evaluation over streaming graphs, which is bec...
04/04/2020 ∙ by Anil Pacaci, et al. ∙
0
∙
share
read it
-
GSI: GPU-friendly Subgraph Isomorphism
Subgraph isomorphism is a well-known NP-hard problem that is widely used...
06/08/2019 ∙ by Li Zeng, et al. ∙
0
∙
share
read it
-
Time Constrained Continuous Subgraph Search over Streaming Graphs
The growing popularity of dynamic applications such as social networks p...
01/28/2018 ∙ by Youhuan Li, et al. ∙
0
∙
share
read it
-
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing
Graph processing is becoming increasingly prevalent across many applicat...
09/10/2017 ∙ by Siddhartha Sahu, et al. ∙
0
∙
share
read it
-
Quegel: A General-Purpose Query-Centric Framework for Querying Big Graphs
Pioneered by Google's Pregel, many distributed systems have been develop...
01/25/2016 ∙ by Da Yan, et al. ∙
0
∙
share
read it
