Title:

Towards Big Graph Search: Challenges and Techniques

Abstract:

Graphs have more expressive power and are widely used today, and various applications of social computing trigger the pressing need of a new search paradigm. In this talk, we argue that graph search is the one filling this gap. We first introduce the application of graph search in various scenarios. We then formalize the graph search problem and briefly discuss its challenges. Finally, we introduce several useful query and data techniques towards efficient and effective big graph search.

Bio:

Shuai Ma, BSc, MSc, PhD, is a full professor in the School of Computer Science and Engineering, Beihang University, China. He obtained two PhD degrees in data quality from University of Edinburgh in 2010 and in data mining from Peking University in 2004, respectively. From 2005 to 2010, he worked as a post-doctoral research fellow in the database group, University of Edinburgh. He also worked as a summer consultant at Bell labs, Murray Hill, USA in the summer of 2008, and as a visiting researcher at Microsoft Research Asia, Beijing, China in 2012. Since 2011, he has been working at Beihang University as a full processor. His research interests include database theory and systems. He has published a number of papers in top conferences (SIMGOD, VLDB, ICDE, WWW, MobiCom, USENIX ATC) and journals (TODS, VLDB J, TKDE, TCS). He is a recipient of the best paper award of VLDB 2010, the best challenge paper award of WISE 2013, the National Science Fund of China for Excellent Young Scholars in 2013, and the second place in the final ranking of WSDM CUP 2016.

« Go Back