The proliferation of RDF datasets has resulted in studies focusing on
op...
There has been an increasing recognition of the value of data and of
dat...
Differential computation (DC) is a highly general incremental
computatio...
Memory disaggregation (MD) allows for scalable and elastic data center d...
Bipartite graphs are rich data structures with prevalent applications an...
Efficient execution of SPARQL queries over large RDF datasets is a topic...
We study the fundamental problem of butterfly (i.e. (2,2)-bicliques) cou...
In this paper, we study the problem of evaluating persistent queries ove...
Graphs are by nature unifying abstractions that can leverage
interconnec...
Given a user-specified minimum degree threshold γ, a
γ-quasi-clique is a...
We study persistent query evaluation over streaming graphs, which is bec...
Subgraph isomorphism is a well-known NP-hard problem that is widely used...
The growing popularity of dynamic applications such as social networks
p...
Graph processing is becoming increasingly prevalent across many applicat...
Pioneered by Google's Pregel, many distributed systems have been develop...