Query Optimization for Dynamic Graphs

  title={Query Optimization for Dynamic Graphs},
  author={Sutanay Choudhury and Lawrence B. Holder and George Chin and Patrick Mackey and Khushbu Agarwal and John Feo},
Given a query graph that represents a pattern of interest, the emerging pattern detection problem can be viewed as a continuous query problem on a dynamic graph. We present an incremental algorithm for continuous query processing on dynamic graphs. The algorithm is based on the concept of query decomposition; we decompose a query graph into smaller subgraphs and assemble the result of subqueries to find complete matches with the specified query. The novelty of our work lies in using the… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
2 Citations
25 References
Similar Papers


Publications citing this paper.
Showing 1-2 of 2 extracted citations

Similar Papers

Loading similar papers…