Querying Large Graph Databases: Jeffrey Xu Yu
Abstract: Graph structured data is enjoying an increasing popularity. Numerous emerging applications that deal with graphs include social networks, Web analysis, biological network analysis for life science. Also, users may want to view/access XML documents, a major standard for representing data on the World-Wide-Web, as a graph by unifying two different XML links, namely parent-child link and reference link. It is worth noting that XLink (XML Linking Language) and XPointer (XML Pointer Language) provide more facilities for users to manage their complex data as graphs and integrate data effectively. The dominance of graphs in real-world applications demands new graph query processing techniques to assist users to access graph data effectively and efficiently. In this talk, we will discuss several research topics on graph query processing including graph reachability query processing, subgraph isomorphism query processing, and top-k keyword query processing over large graphs.
Short Biography: Jeffrey Xu Yu received his B.E., M.E. and Ph.D. in computer science, from the University of Tsukuba, Japan, in 1985, 1987 and 1990, respectively. Dr. Yu held teaching positions in the Institute of Information Sciences and Electronics, University of Tsukuba, Japan, and the Department of Computer Science, The Australian National University. Currently, he is a Professor in the Department of Systems Engineering and Engineering Management, the Chinese University of Hong Kong. Dr. Yu's current main research interest includes graph database, XML database, data mining, Web-technology, and query processing and query optimization. He has published over 160 papers including papers published in TKDE, VLDBJ, TODS, SIGMOD, SIGKDD, VLDB, ICDE, and EDBT. He is a member of ACM SIGMOD Executive Committee, an associate editor of IEEE Transactions on Knowledge and Data Engineering, and a VLDB Journal editorial board member.
