Refreshment Strategies for the Shortest Path Caching Problem with Changing Edge Weight

The problem of caching shortest paths which aims at reducing the computational time of servers has been widely studied. All the existing methods addressing this problem assume that the graph status does not change with time. Based on this assumption, they analyze shortest paths query logs and prefer to load paths with the most query frequency into the cache. However, the graph status is actually affected by many factors and undoubtedly changes with time in the real work. As the existing approaches ignore the change of graph status, they cannot guarantee the efficient use of caches. In this paper, we first exploit properties related with changing graphs. Then we develop an algorithm to detect shortest paths affected by weight change of edges. After detection affected paths in a cache, several heuristic based refreshment strategies are proposed to update the cache. In the experimental section, performances of proposed refreshment strategies are compared.

[1]  Fang Wei.  TEDI: efficient shortest path query answering on graphs , 2010, SIGMOD 2010.

[2]  Yuan Tian,et al.  Monitoring minimum cost paths on road networks , 2009, GIS.

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Özgür Ulusoy,et al.  A Cost-Aware Strategy for Query Result Caching in Web Search Engines , 2009, ECIR.

[5]  Peter Ingwersen,et al.  Developing a Test Collection for the Evaluation of Integrated Search , 2010, ECIR.

[6]  Hans-Peter Kriegel,et al.  Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks , 2008, SSDBM.

[7]  Arbee L. P. Chen,et al.  Continuous Evaluation of Fastest Path Queries on Road Networks , 2007, SSTD.

[8]  Shuigeng Zhou,et al.  Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation , 2012, Proc. VLDB Endow..

[9]  Evangelos P. Markatos,et al.  On caching search engine query results , 2001, Comput. Commun..

[10]  Ge Yu,et al.  An Improved Algorithm to Enhance the Utilization of Shortest Path Caches , 2013, 2013 10th Web Information System and Application Conference.

[11]  Aristides Gionis,et al.  Fast shortest path distance estimation in large networks , 2009, CIKM.

[12]  Torsten Suel,et al.  Three-level caching for efficient query processing in large Web search engines , 2005, WWW.

[13]  Christian S. Jensen,et al.  Effective caching of shortest paths for location-based services , 2012, SIGMOD Conference.

[14]  James Cheng,et al.  Efficient processing of distance queries in large graphs: a vertex cover approach , 2012, SIGMOD Conference.

[15]  Xiangyu Liu,et al.  A Generalization Based Approach for Anonymizing Weighted Social Network Graphs , 2011, WAIM.

[16]  Torsten Suel,et al.  Improved techniques for result caching in web search engines , 2009, WWW '09.

[17]  Aristides Gionis,et al.  The impact of caching on search engines , 2007, SIGIR.

[18]  Chengyang Zhang,et al.  Advances in Spatial and Temporal Databases , 2015, Lecture Notes in Computer Science.