By Topic

Predicate caching for data-intensive autonomous systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
N. N. Kamel ; City Univ. of Hong Kong, Hong Kong

Predicate caching is a powerful memory caching technique especially suitable for a class of applications called autonomous systems. These systems can act according to presupplied logic that defines predictable, repetitive data access requests. This class includes rule-based systems, expert systems, logic programs, active database systems, database integrity constraints, triggers, alerters, and autonomous intelligent agents. Some of these systems are data-intensive. Predicate caching improves memory utilization and response time of repetitive queries by prestoring partial results in primary memory, which results in minimizing secondary storage access. With predicate caching, a system applies a predicate to the data on its way from one memory device to another. A predicate, in this context, is any predetermined calculation made by a program. I describe the predicate caching technique and, specifically, the page-predicate approach that I developed to resolve problems of cache partitioning, management, and optimization. The work discussed is based on simulation experiments I devised, programmed, and conducted

Published in:

Computer  (Volume:30 ,  Issue: 11 )