We are the first to study the problem of refreshing a cache in a changed graph.
A bitmap-based cache structure is designed to store shortest paths.
Three algorithms are developed to detect affected shortest paths.
Four refreshment strategies are proposed to update a cache efficiently.
Extensive experiments on real data sets show the efficiency of our algorithms.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址:北京市海淀区学院路29号 邮编:100083 电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700 |