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

Keywords

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

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Information Systems and Management

Fingerprint Dive into the research topics of 'A cache invalidation scheme for continuous partial match queries in mobile computing environments'. Together they form a unique fingerprint.

  • Cite this