Point-to-Point Distance Querying in Massive Graphs

PhD Qualifying Examination


Title: "Point-to-Point Distance Querying in Massive Graphs"

by

Mr. Minhao JIANG


Abstract:

Shortest distance query problem is one of most basic problems in computer 
science. Its bountiful applications have given rise to extensive researches in 
the era of big data. In this survey, we report some recent works for 
point-to-point shortest distance querying in massive graphs. Most of the 
reviewed methods precompute an index for a large-scale network to support 
highly efficient querying. The key idea lies in the trade-off between indexing 
cost and querying efficiency. Different techniques adopted to balance the 
trade-off are compared to show the trend of the studies in this line.


Date:			Monday, 19 January 2015

Time:                  	3:00pm - 5:00pm

Venue:                  Room 3494
                         Lifts 25/26

Committee Members:	Dr. Raymond Wong (Supervisor)
 			Dr. Wilfred Ng (Chairperson)
 			Dr. Qiong Luo
 			Prof. Dimitris Papadias


**** ALL are Welcome ****