报告时间：2018年3月30日（周五）上午10:00 -11:00
报告地点：浙江大学紫金港校区蒙民伟楼402室
报告题目：Query Processing in Massive Networks
报告人：Hong Cheng
主持人：蔡登 教授 

Abstract: Massive graphs are ubiquitous in various application domains, such as social networks, road networks, communication networks, biological networks, RDF graphs, and so on.  These graphs are massive and contain rich information on the nodes and edges.
In such massive graphs, an important type of problems is processing graph structure related queries.  However, the massive graph volume presents huge challenges for efficient query processing.  In this talk, I will introduce our recent research on query processing in massive networks, including graph reachability query, nearest keyword query, and community search query. 

Biography: Hong Cheng received her PhD degree from the University of Illinois at Urbana-Champaign.  She is an Associate professor in the Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong.  Her research interests include data mining, database systems, and machine learning.  She received research paper awards at ICDE’07, SIGKDD’06, and SIGKDD’05, and the certificate of recognition for the 2009 SIGKDD Doctoral Dissertation Award.  She received the 2010 Vice-Chancellor’s Exemplary Teaching Award at the Chinese University of Hong Kong.