Caching complementary space for location-based services

Ken C.K. Lee, Wang-chien Lee, Baihua Zheng, Jianliang Xu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationAdvances in Database Technology - EDBT 2006 - 10th International Conference on Extending Database Technology, Proceedings
Pages1020-1038
Number of pages19
StatePublished - Jul 10 2006
Event10th International Conference on Extending Database Technology, EDBT 2006 - Munich, Germany
Duration: Mar 26 2006Mar 31 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3896 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Extending Database Technology, EDBT 2006
CountryGermany
CityMunich
Period3/26/063/31/06

Fingerprint

Location based services
Caching
Storage allocation (computer)
Cache memory
Granularity
Coalescence
Query
Cache
Replacement
Performance Evaluation
Likely
Object

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Lee, K. C. K., Lee, W., Zheng, B., & Xu, J. (2006). Caching complementary space for location-based services. In Advances in Database Technology - EDBT 2006 - 10th International Conference on Extending Database Technology, Proceedings (pp. 1020-1038). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3896 LNCS).
Lee, Ken C.K. ; Lee, Wang-chien ; Zheng, Baihua ; Xu, Jianliang. / Caching complementary space for location-based services. Advances in Database Technology - EDBT 2006 - 10th International Conference on Extending Database Technology, Proceedings. 2006. pp. 1020-1038 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2c6ea9b2b4594981a921f7e07ae2cafb,
title = "Caching complementary space for location-based services",
abstract = "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.",
author = "Lee, {Ken C.K.} and Wang-chien Lee and Baihua Zheng and Jianliang Xu",
year = "2006",
month = "7",
day = "10",
language = "English (US)",
isbn = "3540329609",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1020--1038",
booktitle = "Advances in Database Technology - EDBT 2006 - 10th International Conference on Extending Database Technology, Proceedings",

}

Lee, KCK, Lee, W, Zheng, B & Xu, J 2006, Caching complementary space for location-based services. in Advances in Database Technology - EDBT 2006 - 10th International Conference on Extending Database Technology, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3896 LNCS, pp. 1020-1038, 10th International Conference on Extending Database Technology, EDBT 2006, Munich, Germany, 3/26/06.

Caching complementary space for location-based services. / Lee, Ken C.K.; Lee, Wang-chien; Zheng, Baihua; Xu, Jianliang.

Advances in Database Technology - EDBT 2006 - 10th International Conference on Extending Database Technology, Proceedings. 2006. p. 1020-1038 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3896 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Caching complementary space for location-based services

AU - Lee, Ken C.K.

AU - Lee, Wang-chien

AU - Zheng, Baihua

AU - Xu, Jianliang

PY - 2006/7/10

Y1 - 2006/7/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745633042&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745633042&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540329609

SN - 9783540329602

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1020

EP - 1038

BT - Advances in Database Technology - EDBT 2006 - 10th International Conference on Extending Database Technology, Proceedings

ER -

Lee KCK, Lee W, Zheng B, Xu J. Caching complementary space for location-based services. In Advances in Database Technology - EDBT 2006 - 10th International Conference on Extending Database Technology, Proceedings. 2006. p. 1020-1038. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).