A cache invalidation scheme for continuous partial match queries in mobile computing environments

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile clients are record ID-based. However, since the partial match query uses content-based retrieval, the conventional ID-based approaches cannot efficiently manage the cache consistency of mobile clients. In this paper, we propose a predicate-based cache invalidation scheme for continuous partial match queries in mobile computing environments. We represent the cache state of a mobile client as a predicate, and also construct a cache invalidation report (CIR), which the server broadcasts to clients for cache management, with predicates. In order to reduce the amount of information that is needed for cache management, we propose a set of methods for CIR construction (in the server) and identification of invalidated data (in the client). Through experiments, we show that the predicate-based approach is very effective for the cache management of mobile clients.

Original languageEnglish
Pages (from-to)207-234
Number of pages28
JournalDistributed and Parallel Databases
Volume23
Issue number3
DOIs
Publication statusPublished - 2008 Jun 1

Fingerprint

Mobile computing
Mobile Computing
Cache
Query
Partial
Servers
Content based retrieval
Predicate
Identity-based
Data storage equipment
Server
Content-based Retrieval
Experiments
Broadcast

Keywords

  • Cache invalidation
  • Continuous query
  • Data broadcasting
  • Mobile computing
  • Partial match query

ASJC Scopus subject areas

  • Information Systems
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

A cache invalidation scheme for continuous partial match queries in mobile computing environments. / Chung, Yon Dohn.

In: Distributed and Parallel Databases, Vol. 23, No. 3, 01.06.2008, p. 207-234.

Research output: Contribution to journalArticle

@article{779e265e9af74a42bbd024e460fb92d3,
title = "A cache invalidation scheme for continuous partial match queries in mobile computing environments",
abstract = "The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile clients are record ID-based. However, since the partial match query uses content-based retrieval, the conventional ID-based approaches cannot efficiently manage the cache consistency of mobile clients. In this paper, we propose a predicate-based cache invalidation scheme for continuous partial match queries in mobile computing environments. We represent the cache state of a mobile client as a predicate, and also construct a cache invalidation report (CIR), which the server broadcasts to clients for cache management, with predicates. In order to reduce the amount of information that is needed for cache management, we propose a set of methods for CIR construction (in the server) and identification of invalidated data (in the client). Through experiments, we show that the predicate-based approach is very effective for the cache management of mobile clients.",
keywords = "Cache invalidation, Continuous query, Data broadcasting, Mobile computing, Partial match query",
author = "Chung, {Yon Dohn}",
year = "2008",
month = "6",
day = "1",
doi = "10.1007/s10619-008-7027-2",
language = "English",
volume = "23",
pages = "207--234",
journal = "Distributed and Parallel Databases",
issn = "0926-8782",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - A cache invalidation scheme for continuous partial match queries in mobile computing environments

AU - Chung, Yon Dohn

PY - 2008/6/1

Y1 - 2008/6/1

N2 - The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile clients are record ID-based. However, since the partial match query uses content-based retrieval, the conventional ID-based approaches cannot efficiently manage the cache consistency of mobile clients. In this paper, we propose a predicate-based cache invalidation scheme for continuous partial match queries in mobile computing environments. We represent the cache state of a mobile client as a predicate, and also construct a cache invalidation report (CIR), which the server broadcasts to clients for cache management, with predicates. In order to reduce the amount of information that is needed for cache management, we propose a set of methods for CIR construction (in the server) and identification of invalidated data (in the client). Through experiments, we show that the predicate-based approach is very effective for the cache management of mobile clients.

AB - The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile clients are record ID-based. However, since the partial match query uses content-based retrieval, the conventional ID-based approaches cannot efficiently manage the cache consistency of mobile clients. In this paper, we propose a predicate-based cache invalidation scheme for continuous partial match queries in mobile computing environments. We represent the cache state of a mobile client as a predicate, and also construct a cache invalidation report (CIR), which the server broadcasts to clients for cache management, with predicates. In order to reduce the amount of information that is needed for cache management, we propose a set of methods for CIR construction (in the server) and identification of invalidated data (in the client). Through experiments, we show that the predicate-based approach is very effective for the cache management of mobile clients.

KW - Cache invalidation

KW - Continuous query

KW - Data broadcasting

KW - Mobile computing

KW - Partial match query

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

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

U2 - 10.1007/s10619-008-7027-2

DO - 10.1007/s10619-008-7027-2

M3 - Article

AN - SCOPUS:43349088297

VL - 23

SP - 207

EP - 234

JO - Distributed and Parallel Databases

JF - Distributed and Parallel Databases

SN - 0926-8782

IS - 3

ER -