报告人：张文杰, 新南威尔士大学，计算机科学与工程学院 教授, ARC Future Fellow

报告时间：2021年12月24日 (星期五) 上午9:30 - 10:30

报告地点：Zoom在线会议

https://us02web.zoom.us/j/2810019605?pwd=ZzlqRU4zOGZ5TkJYUm9KQlBDcDZwUT09

会议号：281 001 9605

密码：HNU2021

欢迎广大师生参加！烦请大家提前安装Zoom会议软件，软件下载地址：https://zoom.us/download

报告摘要：With the advent of a wide spectrum of recent applications, processing heterogeneous graphs has received a great deal of attention from both academic and industry societies. Heterogeneous graphs involve objects (vertices) and links (edges) that are classified into multiple types; examples include bibliography networks, knowledge networks, and user-item networks in E-business.  Structure-based analysis reveals the underlying connections and is an important task in processing heterogeneous graphs.  However, the large scale and dynamic nature pose great challenges for efficient and scalable processing.  This talk will focus on representative path-based and subgraph-based search models over large-scale dynamic heterogeneous graph processing, and discuss the applications, challenges and solutions.

报告人简介：张文杰, 新南威尔士大学，计算机科学与工程学院， 教授,  ARC Future Fellow，计算机科学与工程学院副院长。主要从事数据密集型应用的高效和可扩展技术研究。 目前在国际顶级期刊和会议共发表论文180余篇。担任IEEE TKDE 副主编、VLDB 2022、CIKM 2021 / 2019 / 2015、ICDE 2019等国际权威会议的Senior PC 或 track chair. 2019年CORE Chris Wallace研究奖的获得者, 多次获得数据库顶级会议SIGMOD的最佳论文奖。  

邀请人：李肯立

联系人：周旭