Intelligent caching and indexing techniques for relational database systems

  • Sellis T
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 32

    Citations

    Citations of this article.

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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free