Effective caching of shortest paths for location-based services

Web search is ubiquitous in our daily lives. Caching has been extensively used to reduce the computation time of the search engine and reduce the network traffic beyond a proxy server. Another form of web search, known as online shortest path search, is popular due to advances in geo-positioning. However, existing caching techniques are ineffective for shortest path queries. This is due to several crucial differences between web search results and shortest path results, in relation to query matching, cache item overlapping, and query cost variation. Motivated by this, we identify several properties that are essential to the success of effective caching for shortest path search. Our cache exploits the optimal subpath property, which allows a cached shortest path to answer any query with source and target nodes on the path. We utilize statistics from query logs to estimate the benefit of caching a specific shortest path, and we employ a greedy algorithm for placing beneficial paths in the cache. Also, we design a compact cache structure that supports efficient query matching at runtime. Empirical results on real datasets confirm the effectiveness of our proposed techniques.

[1]  Christian S. Jensen,et al.  The Infati Data , 2004, ArXiv.

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

[3]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[4]  Jianliang Xu,et al.  Proactive caching for spatial queries in mobile environments , 2005, 21st International Conference on Data Engineering (ICDE'05).

[5]  Jianliang Xu,et al.  Caching Complementary Space for Location-Based Services , 2006, EDBT.

[6]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

[7]  Ricardo A. Baeza-Yates,et al.  A Three Level Search Engine Index Based in Query Log Distribution , 2003, SPIRE.

[8]  Victor C. S. Lee,et al.  Distance indexing on road networks , 2006, VLDB.

[9]  Divesh Srivastava,et al.  Semantic Data Caching and Replacement , 1996, VLDB.

[10]  Albert-László Barabási,et al.  Understanding individual human mobility patterns , 2008, Nature.

[11]  Fang Wei-Kleiner,et al.  TEDI: Efficient Shortest Path Query Answering on Graphs , 2010, Graph Data Management.

[12]  Özgür Ulusoy,et al.  Static query result caching revisited , 2008, WWW.

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

[14]  Özgür Ulusoy,et al.  A five-level static cache architecture for web search engines , 2012, Inf. Process. Manag..

[15]  Dik Lun Lee,et al.  Semantic Caching in Location-Dependent Query Processing , 2001, SSTD.

[16]  Xing Xie,et al.  Mining interesting locations and travel sequences from GPS trajectories , 2009, WWW '09.

[17]  Sakti Pramanik,et al.  An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps , 2002, IEEE Trans. Knowl. Data Eng..

[18]  Markus Cadonau,et al.  Scalable Network Distance Browsing in Spatial Databases , 2010 .

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

[20]  Jeffrey D. Ullman,et al.  Implementing data cubes efficiently , 1996, SIGMOD '96.

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

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

[23]  Torsten Suel,et al.  Three-Level Caching for Efficient Query Processing in Large Web Search Engines , 2005, WWW '05.

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