Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Semantic Caching in Location-Dependent Query Processing
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Proactive Caching for Spatial Queries in Mobile Environments
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Three-level caching for efficient query processing in large Web search engines
WWW '05 Proceedings of the 14th international conference on World Wide Web
Distance indexing on road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
The impact of caching on search engines
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Static query result caching revisited
Proceedings of the 17th international conference on World Wide Web
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Improved techniques for result caching in web search engines
Proceedings of the 18th international conference on World wide web
Mining interesting locations and travel sequences from GPS trajectories
Proceedings of the 18th international conference on World wide web
A Cost-Aware Strategy for Query Result Caching in Web Search Engines
ECIR '09 Proceedings of the 31th European Conference on IR Research on Advances in Information Retrieval
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Caching complementary space for location-based services
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
On caching search engine query results
Computer Communications
A five-level static cache architecture for web search engines
Information Processing and Management: an International Journal
A group based approach for path queries in road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Mobility and social networking: a data management perspective
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
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.