Efficient and Scalable Processing of Dynamic Heterogeneous Graphs

该项目旨在开发高效和可扩展的算法来处理大规模动态异构图，其中图节点和边具有多种类型，并且图结构动态更新。关键的挑战，预计将得到解决，包括复杂的结构，高速，和大量的动态异构图形。预期成果包括新颖的计算范式、算法、索引、增量计算、分布式算法以及展示实用价值的系统原型。该项目的成功将开辟一个新的研究方向，丰富前沿技术，并使澳大利亚的许多关键应用受益，包括网络安全，电子商务，健康和社交网络。

This project aims to develop efficient and scalable algorithms to process large-scale dynamic heterogeneous graphs where graph nodes and edges are of multiple types and the graph structure updates dynamically. Key challenges are expected to be addressed including complex structure, high speed, and large volume of dynamic heterogeneous graphs. The anticipated outcomes include novel computing paradigms, algorithms, indexing, incremental computation, distributed algorithms as well as a system prototype to demonstrate the practical value. Success of this project will open up a new research direction to enrich frontier technologies and benefit many key applications in Australia including cybersecurity, e-commerce, health and social networks.