Scalable Cache Invalidation Algorithms for Mobile Data Access November/December 2003 (vol. 15 no. 6) pp. 1498-1511
Abstract—In this paper, we address the problem of cache invalidation in mobile and wireless client/server environments. We present cache invalidation techniques that can scale not only to a large number of mobile clients, but also to a large number of data items that can be cached in the mobile clients. We propose two scalable algorithms: the Multidimensional Bit-Sequence (MD-BS) algorithm and the Multilevel Bit-Sequence (ML-BS) algorithm. Both algorithms are based on our prior work on the Basic Bit-Sequences (BS) algorithm. Our study shows that the proposed algorithms are effective for a large number of cached data items with low update rates. The study also illustrates that the algorithms can be used with other complementary techniques to address the problem of cache invalidation for data items with varied update and access rates. [1] S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, “Broadcast Disks: Data Management for Asymmetric Communication Environments,” Proc. ACM SIGMOD, pp. 199-210, May 1995.
Index Terms:
Mobile data access, cache invalidation, disconnected operation, data broadcast.
Citation:
Ahmed Elmagarmid, Jin Jing, Abdelsalam (Sumi) Helal, Choonhwa Lee, "Scalable Cache Invalidation Algorithms for Mobile Data Access," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 6, pp. 1498-1511, Nov./Dec. 2003, doi:10.1109/TKDE.2003.1245288 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||