The Community for Technology Leaders
2016 IEEE 32nd International Conference on Data Engineering (ICDE) (2016)
Helsinki, Finland
May 16, 2016 to May 20, 2016
ISBN: 978-1-5090-2020-1
pp: 145-156
Huanhuan Wu , Department of Computer Science and Engineering, The Chinese University of Hong Kong, China
Yuzhen Huang , Department of Computer Science and Engineering, The Chinese University of Hong Kong, China
James Cheng , Department of Computer Science and Engineering, The Chinese University of Hong Kong, China
Jinfeng Li , Department of Computer Science and Engineering, The Chinese University of Hong Kong, China
Yiping Ke , School of Computer Engineering, Nanyang Technological University, Singapore
ABSTRACT
A temporal graph is a graph in which vertices communicate with each other at specific time, e.g., A calls B at 11 a.m. and talks for 7 minutes, which is modeled by an edge from A to B with starting time "11 a.m." and duration "7 mins". Temporal graphs can be used to model many networks with time-related activities, but efficient algorithms for analyzing temporal graphs are severely inadequate. We study fundamental problems such as answering reachability and time-based path queries in a temporal graph, and propose an efficient indexing technique specifically designed for processing these queries in a temporal graph. Our results show that our method is efficient and scalable in both index construction and query processing.
INDEX TERMS
Indexing, Algorithm design and analysis, Electronic mail, Query processing, Labeling, Social network services
CITATION

H. Wu, Y. Huang, J. Cheng, J. Li and Y. Ke, "Reachability and time-based path queries in temporal graphs," 2016 IEEE 32nd International Conference on Data Engineering (ICDE), Helsinki, Finland, 2016, pp. 145-156.
doi:10.1109/ICDE.2016.7498236
98 ms
(Ver 3.3 (11022016))