Caching Complementary Space for Location-Based Services
In this paper, we propose a novel client-side, multi-granularity caching scheme, called “Complementary Space Caching” (CS caching), for location-based services in mobile environments. Different from conventional data caching schemes that only cache a portion of dataset, CS caching maintains a global view of the whole dataset. Different portions of this view are cached in varied granularity based on the probabilities of being accessed in the future queries. The data objects with very high access probabilities are cached in the finest granularity, i.e., the data objects themselves. The data objects which are less likely to be accessed in the near future are abstracted and logically cached in the form of complementary regions (CRs) in a coarse granularity. CS caching naturally supports all types of location-based queries. In this paper, we explore several design and system issues of CS caching, including cache memory allocation between objects and CRs, and CR coalescence. We develop algorithms for location-based queries and a cache replacement mechanism. Through an extensive performance evaluation, we show that CS caching is superior to existing caching schemes for location-based services.
KeywordsQuery Processing Near Neighbor Cache Size Cache Scheme Cache Replacement
Unable to display preview. Download preview PDF.
- 1.Schiller, J.H., Voisard, A. (eds.): Location-Based Services. Morgan Kaufmann, San Francisco (2004)Google Scholar
- 2.Dar, S., Franklin, M.J., Jónsson, B.T., Srivastava, D., Tan, M.: Semantic data caching and replacement. In: Proc. of 22th International Conference on Very Large Data Bases (VLDB), Bombay, India, , pp. 330–341 (September 3-6, 1996)Google Scholar
- 5.Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of the ACM SIGMOD International Conference on Management of Data, Boston, MA, June 18-21, pp. 47–57 (1984)Google Scholar
- 6.Roussopoulos, N., Kelly, S., Vincent, F.: Nearest Neighbor Queries. In: Proc. Of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, CA, USA, May 22-25, pp. 71–79 (1995)Google Scholar
- 7.Deshpande, P.M., Ramasamy, K., Shukla, A., Naughton, J.F.: Caching Multidimensional Queries Using Chunks. In: Proc. of the ACM SIGMOD International Conference on Management of Data, San Diego, CA, USA, pp. 259–270 (June 9-12, 1998)Google Scholar
- 8.Hu, H., Xu, J., Wong, W.S., Zheng, B., Lee, D.L., Lee, W.C.: Proactive Caching for Spatial Queries in Mobile Environments. In: Proc. of the 21st International Conference on Data Engineering (ICDE), Tokyo, Japan, April 5-8, pp. 403–414 (2005)Google Scholar
- 9.Ren, Q., Dunham, M.H.: Using Semantic Caching to Manage Location Dependent Data in Mobile Computing. In: Proc. of the International Conference on Mobile Computing and Networking (Mobicom), Boston, MA, USA, pp. 210–221 (August 6-11, 2000)Google Scholar
- 10.Backmann, N., Kriegel, H.P., Schneider, R., Seegar, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of the ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, USA, May 23-25, pp. 322–331 (1990)Google Scholar
- 11.BonnMotion, A.: mobility scenario generation and analysis tool, http://web.informatik.uni-bonn.de/IV/Mitarbeiter/dewaal/BonnMotion/