Key Laboratory of High Confidence Software Technologies / Peking University / Chinese University of Hong Kong / building T / /
IndustryTerm
graph management / shortest path search / batch node processing / representative graph search algorithms / generic graph search framework / shortest path algorithm / large search space / batch processing / increase search space / bi-directional breadth-first-search / graph search query / data mining / enlarged search space / graph search queries / transportation networks / generic graph processing framework / promising infrastructure / Graph search / greedy algorithms / data processing / graph search tasks / data management / graph search methods / minimal spanning tree algorithm / social networks / graph data management / web graphs / social network / larger search space / generic iterative processing structure / generic processing structure / graph search algorithms / search space / less search space / bi-directional search strategy / shortest path discovery algorithm / /
OperatingSystem
Windows server 2003 / /
Organization
Chinese University of Hong Kong / Peking University / VLDB Endowment / Department of Computer Science / Kent State University Department of Systems Engineering & Engineering Management / Laboratory of High Confidence Software Technologies / Stanford / /
Person
Ak / Jeffrey Xu Yu‡ Xiao / Jun Gao† Ruoming Jin / /
Relational Approach for Shortest Path Discovery over Large Graphs Jun Gao† Ruoming Jin§ Jiashuai Zhou† Jeffrey Xu Yu‡ Xiao Jiang† Tengjiao Wang† † ‡