Big temporal graph processing in the Cloud

该项目旨在开发高效且可扩展的算法来处理云中的大型时间图。特别是，我们将研究大型时态图上三种最具代表性的查询类型，包括基于顶点的查询、基于路径的查询和基于子图的查询。该项目的预期成果包括处理大时间图的理论基础和可扩展算法，以及用于评估和展示实用价值的系统原型。该项目的成功将为网络安全、电子商务、卫生和道路网络等许多重要应用带来重大好处。

This project aims to develop efficient and scalable algorithms to process big temporal graphs in the Cloud. In particular, we will investigate three most representative types of queries over big temporal graphs including vertex-based queries, path-based queries, and subgraph-based queries. Expected outcomes of this project include theoretical foundations and scalable algorithms to process big temporal graphs as well as a system prototype for evaluation and to demonstrate the practical value. Success in this project should see significant benefits for many important applications such as cybersecurity, e-commerce, health and road networks.