Hu H，Lee D L，Lee V.Distance indexing on road networks［C］//Proceedings of the 32nd International Conference on Very Large Data Bases.Seoul，2006:894/905.
[2]
Kriegel H P，Kriger P，Renz M，et al.Hierarchical graph embedding for efficient query processing in very large traffic networks［M］//Scientific and Statistical Database Management.Berlin:Springer Berlin Heidelberg，2008:150/167.
[3]
Yang X，Wang B，Wang G，et al.RSearch:enhancing keyword search in relational databases using nearly duplicate records［J］.Bulletin of the IEEE Computer Society Technical Committee on Data Engineering，2010:60/66.
[4]
Liu X，Yang X.A generalization based approach for anonymizing weighted social network graphs［M］//WebAge Information Management.Berlin:Springer Berlin Heidelberg，2011:118/130.
[5]
Wu L，Xiao X，Deng D，et al.Shortest path and distance queries on road networks:an experimental evaluation［J］.Proceedings of the VLDB Endowment，2012，5(5):406/417.
[6]
Potamias M，Bonchi F，Castillo C，et al.Fast shortest path distance estimation in large networks［C］//Proceedings of the 18th ACM Conference on Information and Knowledge Management.New York:ACM，2009:867/876.
[7]
Wei F.TEDI:efficient shortest path query answering on graphs［C］//Proceedings of the 2010 International Conference on Management of Data.New York:ACM，2010:99/110.
[8]
Cheng J，Ke Y，Chu S，et al.Efficient processing of distance queries in large graphs:a vertex cover approach［C］//Proceedings of the 2012 International Conference on Management of Data.New York:ACM，2012:457/468.
[9]
Markatos E P.On caching search engine query results［J］.Computer Communications，2001，24(2):137/143.
[10]
Thomsen J R，Yiu M L，Jensen C S.Effective caching of shortest paths for locationbased services［C］//Proceedings of the 2012 International Conference on Management of Data.New York:ACM，2012:313/324.
