Seminar: Reachability Query Processing


    Department of Systems Engineering and Engineering Management
            The Chinese University of Hong Kong


Title     : Reachability Query Processing

Speaker    : Prof. Jeffrey Xu Yu          
Date       : Nov. 2nd, 2012 (Friday)
Time       : 4:30 p.m. - 5:30 p.m.
Venue      : Room 513
             William M.W. Mong Engineering Building

There are numerous applications that need to deal with a large graph,
including bioinformatics, social science, link analysis, citation
analysis, and collaborative networks. A fundamental task is to query
whether a node is reachable from another node in a large graph, which
is called a reachability query. In this talk, we discuss how to
precompute graph labeling for a large graph efficiently, in order to
process reachability queries online.

Dr Jeffrey Xu Yu is a Professor in the Department of Systems
Engineering and Engineering Management, the Chinese University of Hong
Kong. His current main research interests include graph mining, graph
query processing, graph pattern matching, and keywords search in
relational databases. Dr. Yu served as an Information Director and a
member in ACM SIGMOD executive committee (2007-2011), and an associate
editor of IEEE Transactions on Knowledge and Data Engineering
(2004-2008). Currently he servers as an associate editor in VLDB
Journal, WWW Journal, the International Journal of Cooperative
Information Systems, and the Journal of Information Processing.
Dr. Yu served/serves in many organization committees and program
committees in international conferences/workshops including PC
Co-chair of APWeb'04, WAIM'06, APWeb/WAIM'07, WISE'09, PAKDD'10,
DASFAA'11, and ICDM'12.

************************* ALL ARE WELCOME ************************

Host         : Prof. Hong Cheng
Tel          : (852) 3943-8300
Email        :
Enquiries    : Prof. Hong Cheng
               Department of Systems Engineering and Engineering Management
Website      :
Email        :

Friday, November 2, 2012 - 08:30 to 09:30