报告题目：Subgraph Matching: Past and Present
报 告 人：林学民 澳大利亚新南威尔士大学 教授
报告地点：计算机楼313会议室
报告华体会网页版登陆入口：2021年5月11日（星期二）下午4:00
报告简介：Graph data are key parts of Big Data and widely used for modelling complex structured data with a broad spectrum of applications. Over the last decade, tremendous research efforts have been devoted to many fundamental problems in managing and analysing graph data. In this talk, I will focus on a fundamental problem, subgraph matching. I will cover solutions for single computer, as well as distributed solutions.
讲者简介：Xuemin Lin is a UNSW distinguished Professor - Scientia Professor, and the head of database and knowledge research group in the school of computer science and engineering at UNSW. Xuemin is a distinguished visiting Professor at Tsinghua University and visiting Chair Professor at Fudan University. He is a fellow of IEEE. Xuemin's research interests lie in databases, data mining, algorithms, and complexities. Specifically, he is working in the areas of scalable processing and mining of large scale data, including graph, spatial-temporal, streaming, text and uncertain data.
Xuemin currently serves as the editor-in-Chief of IEEE Transactions on Knowledge and Data Engineering (Jan 2017 - now). He was an associate editor of ACM Transactions Database Systems (2008-2014) and IEEE Transactions on Knowledge and Data Engineering (Feb 2013- Jan 2015), and an associate editor-in-Chief of IEEE Transactions on Knowledge and Data Engineering (2015-2016), respectively. He has been regularly serving as a PC member and area chairs/SPC in SIGMOD, VLDB, ICDE, ICDM, KDD, CIKM, and EDBT. He is a PC co-chair of ICDE2019 and VLDB2022.
