F. Mary Magdalene Jane
ABSTRACT
This paper proposes a cache management method that manages the cache content by pre-fetching data items with maximum prefetch score and evicting cache data items with minimum replacement score. The strategy is to pre-fetch the most probable secondary services based on user's query pattern. The client cache is partitioned into three sections to place and replace the items. Association rule mining is used for determining the items that should be pre-fetched. Dual Valid Scopes are used to invalidate the prefetched items based on their age. A replacement policy is designed which takes into account the age of the items, access probability and distance between the mobile client and the service item which suits a pre-fetching environment. The experimental evaluations using synthetic datasets show the cache pre-fetch and replacement policy are effective in improving the system performance in terms of the cache hit ratio of mobile clients.
- S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, "Broadcast Disks: Data Management for Asymmetric Communications Environments", Proc. ACM SIGMOD Conf. Management of Data, pp. 199--210, 1995. Google Scholar
Digital Library
- R Agrawal and Ramakrishnan Srikant, "Mining Sequential Patterns", Proceedings of International Conference on Data Engineering, pp. 3--14 (1995). Google ScholarDigital Library
- R Agrawal, TomaszImielinski, and ArunSqami, "Mining Association Rules Between Sets of Items in Large Databases", Proceedings of the International Conference on Management of Data(SIGMOD), pp. 207--216 (1993)Google Scholar
- A. Balamash and M. Krunz, "An Overview of Web Caching Replacement Algorithms", IEEE Communications Surveys & Tutorials, 6(2), 2004. Google ScholarDigital Library
- D. Barbara and T. Imielinski, "Sleepers and Workaholics: Caching Strategies in Mobile Environments", In Proc. of SIGMOD, pp. 1--12, 1994.Google ScholarDigital Library
- M. H. Dunham and V. Kumar, "Location Dependent Data and Its Management in Mobile Databases", Proc. Ninth Int'l Workshop Database and Expert Systems Applications, pp. 414--419, 1998. Google ScholarDigital Library
- Geoffrey H, Kuenning and Gerald J. Popek, "Automated Hoarding for Mobile computers", ACM SIGOPS Operating Systems Review, 31(5), pp. 264--275, 1997 Google ScholarDigital Library
- H. Kim and Hwan-Seung Yong, "Association Based Prefetching Algorithm in Mobile Environments", SpringerVerlag, pp. 243--250, 2005. Google ScholarDigital Library
- H Kirchner, Reto Krummenacherl, David Edwards-May2 and Thomas Rissel, "A Location-aware Pre-fetching Mechanism", Fourth International Network Conference: Plymouth, UK, 6--9 July 2004. Plymouth: University Plymouth, pp. 453--460, 2004Google Scholar
- Mary Madgalene Jane. F, Ilayaraja. N, Maytham Safar and Nadarajan R, "Cache Pre-fetching and Replacement strategies for location dependent data in mobile environments", Journal of Digital Information management, Vol(3), 9, June09Google Scholar
- E. O'Neil and P. O'Neil, "The LRU-k page replacement algorithm for database disk buffering", Proceedings of the ACM SIGMOD, pp. 296--306, 1993Google ScholarDigital Library
- Q. Ren and M. H. Dunham, "Using Semantic Caching to Manage Location Dependent Data in Mobile Computing", Proc. Sixth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom 2000), pp. 210--221, Aug. 2000. Google ScholarDigital Library
- Sang-Won Kang, Joon-Min Gil, SangKeun, "Considering a User's Mobility and Query Patterns in Location-Based Services", Proc. Of the ACM conf Mobility'07 conf, 2007. Google ScholarDigital Library
- R. Seidel, "A Randomized Planar Point Location Structure", ftp://ftp.geom.umn.edu/pub/contrib/comp_geom, 2002.Google Scholar
- J. R. Shewchuk, "Triangle: Engineering, 2D Quality Mesh Generator and Delaunay Triangulator", Proc. First Workshop Applied Computational Geometry, pp. 124--133, May 1996. Google ScholarDigital Library
- Y Saygin, Ozgur Ulusoy and Ahmed K. Elmagarmid, "Association rules for supporting hoarding in mobile Computing environments", Proc. Tenth International Workshop on Research Issues in Data Engineering, Page(s): 71--78, 2000. Google ScholarDigital Library
- H. Song and Guohong Cao, "Cache-miss-initiated pre-fetch in mobile environments", Elsevier on Computer Communications, vol. 28, pp. 741--753, October 2005. Google ScholarDigital Library
- L. Yin, G. Cao and Y. Cai, "A generalized Target-Driven Cache Replacement Policy for Mobile Environments", In Proceedings of the IEEE Symposium on Applications and the Internet, pp. 14--21, 2003 Google ScholarDigital Library
- B. Zheng and D. L. Lee, "Semantic Caching in Location-Dependent Query Processing", Proc. Seventh Int'l Symp. Spatial and Temporal Databases (SSTD'01), pp. 97--116, July 2001. Google ScholarDigital Library
- B. Zheng, J. Xu and D. L. Lee, "Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments", IEEE Trans. on Comp., 51(10), 2002 Google ScholarDigital Library
- G. K. Zipf, "Human Behaviour and the Principle of Least Effort", Addison-Wesley, 1949.Google Scholar
Index Terms
- Cache prefetch and replacement with dual valid scopes for location dependent data in mobile environments
Recommendations
Entry and exit probabilities based cache replacement policy for location dependent data in mobile environments
MoMM '09: Proceedings of the 7th International Conference on Advances in Mobile Computing and MultimediaData caching in mobile clients is an important technique to enhance data availability and to improve data access time. Due to cache size limitations, cache replacement policies are used to find a suitable subset of items for eviction from the cache. In ...
Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments
Mobile location-dependent information services (LDISs) have become increasingly popular in recent years. However, data caching strategies for LDISs have thus far received little attention. In this paper, we study the issues of cache invalidation and ...
Counter-Based Cache Replacement and Bypassing Algorithms
Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large, motivating the design of alternative replacement algorithms to improve ...
Comments