Intelligent caching and indexing techniques for relational database systems

34Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recent developments in the design of database systems include proposals for several extensions to the basic model of relational database systems. In this paper we present some ideas on the design of intelligent support mechanisms for large databases where procedures in the form of database commands are stored in relation fields. First, we examine the idea of storing results of previously processed procedures in secondary storage (caching). Problems associated with cache organizations, such as replacement policies and validation schemes, are examined in depth. Another means for reducing the execution cost of queries is indexing. Conventional indexing techniques assume that all values are known, such schemes cannot be used effectively. As a solution to that problem, a new indexing scheme, Partial Indexing, is proposed and analyzed. Uses of partial indexes in conventional database systems are also described. © 1988.

Cite

CITATION STYLE

APA

Sellis, T. K. (1988). Intelligent caching and indexing techniques for relational database systems. Information Systems, 13(2), 175–185. https://doi.org/10.1016/0306-4379(88)90014-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free