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

Description

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.. Scheme: ARC Future Fellowships. Field: 0806 - Information Systems. Lead: Prof Wenjie Zhang