Caching Complementary Space for Location-Based Services
Conference Proceeding Article
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.
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
Advances in Database Technology - EDBT 2006: 10th International Conference on Extending Database Technology, Munich, Germany, March 26-31, 2006
City or Country
LEE, Ken C. K.; LEE, Wang-chien; ZHENG, Baihua; and XU, Jianliang.
Caching Complementary Space for Location-Based Services. (2006). Advances in Database Technology - EDBT 2006: 10th International Conference on Extending Database Technology, Munich, Germany, March 26-31, 2006. 3896, 1020-1038. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/595