Welcome to the InfoSci Platform
Reference Hub5
Rule-Based Data Mining Cache Replacement Strategy

Rule-Based Data Mining Cache Replacement Strategy

Ramzi A. Haraty, Joe Zeitouny
Copyright: © 2013 |Volume: 9 |Issue: 1 |Pages: 14
ISSN: 1548-3924|EISSN: 1548-3932|EISBN13: 9781466631755|DOI: 10.4018/jdwm.2013010103
Cite Article Cite Article

MLA

Haraty, Ramzi A., and Joe Zeitouny. "Rule-Based Data Mining Cache Replacement Strategy." IJDWM vol.9, no.1 2013: pp.56-69. http://doi.org/10.4018/jdwm.2013010103

APA

Haraty, R. A. & Zeitouny, J. (2013). Rule-Based Data Mining Cache Replacement Strategy. International Journal of Data Warehousing and Mining (IJDWM), 9(1), 56-69. http://doi.org/10.4018/jdwm.2013010103

Chicago

Haraty, Ramzi A., and Joe Zeitouny. "Rule-Based Data Mining Cache Replacement Strategy," International Journal of Data Warehousing and Mining (IJDWM) 9, no.1: 56-69. http://doi.org/10.4018/jdwm.2013010103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Caching in mobile environments is used for improving bandwidth usage and reducing query delays among resource constrained devices. It is used in multitudes of approaches. Some rely on the server occasionally broadcasting reports to inform clients of updated data while others permit clients to access data whenever they need it. Caching can be constrained by size and bandwidth; thus, coming up with a good invalidation scheme is critical in improving cache consistency solutions. In this work, the authors propose a new hybrid cache invalidation scheme that makes use of data mining concepts. They also compare their scheme with other related strategies.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.