Partial view selection for evolving social graphs

G Koloniari, E Pitoura - First International Workshop on Graph Data …, 2013 - dl.acm.org
First International Workshop on Graph Data Management Experiences and Systems, 2013dl.acm.org
In this paper, we deal with the problem of historical query evaluation over evolving social
graphs. Historical queries are queries about the social graph in the past. The straightforward
way of executing such a query is by first reconstructing the whole social graph at the given
time instance or interval, and then, evaluating the query on the reconstructed graph. Since
social graphs are large, the cost of a complete graph snapshot reconstruction would
dominate the cost of historical query execution. Given that many queries are user-centric, ie …
In this paper, we deal with the problem of historical query evaluation over evolving social graphs. Historical queries are queries about the social graph in the past. The straightforward way of executing such a query is by first reconstructing the whole social graph at the given time instance or interval, and then, evaluating the query on the reconstructed graph. Since social graphs are large, the cost of a complete graph snapshot reconstruction would dominate the cost of historical query execution. Given that many queries are user-centric, i.e., node-centric queries that require access only of a targeted subgraph, we propose deploying partial view instead of full snapshot construction and define conditions that determine when a partial view can be used to evaluate a query. We also propose using a cache of partial views to further reduce the query evaluation cost, and show how partial views can be extended to new views with reduced cost. Finally, we present a greedy solution for the static view selection problem and study its performance experimentally.
ACM Digital Library