报告人： 王凯, 新南威尔士大学 计算机科学与工程学院 博士后

报告时间：2021年12月24日 (星期五) 下午15:00 - 16:00

报告地点：Zoom在线会议

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

会议号：281 001 9605

密码：HNU2021

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

报告摘要：Relationships between two different types of entities are modeled as bipartite graphs, such as customer-product networks, user-page networks, gene co-expression networks and collaboration networks. This talk focuses on two important problems on bipartite graphs, community search and reachability query. Firstly, a new model for discovering communities on bipartite graphs is introduced, which is based on the concept of (alpha, beta)-core. Indexes are devised according to the nested property of (alpha, beta)-cores for efficiently searching the communities. Secondly, the reachability problem on temporal bipartite graphs is studied. A 2-hop labeling-based index is proposed to improve the query performance. Extensive experiments on real-world bipartite graphs demonstrate the effectiveness and efficiency of the proposed techniques.

报告人简介：王凯，新南威尔士大学，计算机科学与工程学院，博士后。于2020年新南威尔士大学获得博士学位。 主要研究方向为大数据处理、管理和分析。已在数据库顶级会议(如SIGMOD、PVLDB和ICDE)和期刊(如VLDBJ和TKDE)发表论文20余篇。目前是KDD、ICDE、WSDM和CIKM等数据库权威会议的PC member，2022年PVLDB的web chair。  

邀请人：李肯立

联系人：周旭