The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Caching multidimensional queries using chunks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Using semantic caching to manage location dependent data in mobile computing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Semantic query caching in a mobile environment
ACM SIGMOBILE Mobile Computing and Communications Review
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Semantic Caching and Query Processing
IEEE Transactions on Knowledge and Data Engineering
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Location Based Services
On semantic caching and query scheduling for mobile nearest-neighbor search
Wireless Networks - Special issue: Pervasive computing and communications
Proactive Caching for Spatial Queries in Mobile Environments
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
CS cache engine: data access accelerator for location-based service in mobile environments
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A hybrid cache and prefetch mechanism for scientific literature search engines
ICWE'07 Proceedings of the 7th international conference on Web engineering
Collaborative spatial data sharing among mobile lightweight devices
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Effective caching of shortest paths for location-based services
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
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.