By Topic

A semantic caching method based on linear constraints

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
$31 $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

2 Author(s)
Ishikawa, Y. ; Inst. of Inf. Sci. & Electron., Tsukuba Univ., Ibaraki, Japan ; Kitagawa, H.

Because performance is a crucial issue in database systems, data caching techniques have been studied in the database research field, especially in client-server databases and distributed databases. Recently, the idea of semantic caching has been proposed. The approach uses semantic information to describe cached data items so that it tries to exploit not only temporal locality but also semantic locality to improve query response time. We propose linear constraint-based semantic caching as a new approach to semantic caching. Based on the idea of constraint databases, we describe the semantic information about the cached relational tuples as compact constraint tuples. The main focus is the representation method of cache information and the cache examination algorithm

Published in:

Database Applications in Non-Traditional Environments, 1999. (DANTE '99) Proceedings. 1999 International Symposium on

Date of Conference: