Continuous Graph Querying and Graph OLAP Using Differential Computation

点击翻译按钮获取中文摘要

Differential computation (DC) is a recent approach for maintaining computations that can beexpressed as a dataflow of operators under input changes. In this project, we propose to investigatetwo applications of DC to graph processing:1. Continuous queries: To continuously evaluate several graph queries, such as single-sourceshortest paths, single- pair shortest path, variable-length path, and arbitrary-length cyclequeries, over dynamic graphs.2. Graph OLAP queries: To evaluate queries over multiple snapshots or graph views of astatic graph, where the views defined as a multidimensional cube of attributes.These queries can support several important applications in financial fraud, transportation, cybersecurity and others but are currently not supported by existing graph processing software. We planto explore the feasibility of developing a software infrastructure using DC to support these queries.