On November 15th, 2020, Professor Wenfei Fan from University of Edinburgh visited Center on Frontiers of Computing Studies (CFCS) and delivered a lecture titled " Big Graphs: Challenges and Opportunities ". Professor Baoquan Chen, executive director of CFCS, hosted the lecture.

Abstract
Big data is typically characterized with 4V's: Volume, Velocity, Veracity and Value. When it comes to big graphs, these challenges become more staggering. A number of questions remain open. Does parallel processing suffice to cope with the volume of big graphs? Can it guarantee to reduce runtime when more machines are used? If not, is it possible to query big graphs under limited resources at all? Is there a systematic method for developing effective incremental algorithms in response to frequent updates? Is it possible to uniformly query relational databases and graphs using, e.g., SQL? How can we unify logic rules and machine learning models, to improve the quality of graph-structured data? This talk aims to incite interest in these topics, and raises as many questions as it answers.