Selection of Indexes to Memory-Resident Entities for Semantic Data

  • Authors:

  • G. E. Weddell

  • Affiliations:

  • -

  • Venue:
  • IEEE Transactions on Knowledge and Data Engineering
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

A variation of the index selection problem for an extended relational model when all encoding of information is memory resident is discussed. The data model is the relational model extended in two ways that are common with semantic data models. One consequence of memory residence is that the search space of possible indexes is enlarged to the extent that previous methods requiring some consideration of each possibility are no longer possible. An instance of the index selection problem that includes a set of partial match queries in addition to the input schema is given. It is assumed that the set is determined by an initial phase of query optimization when applied to a fixed set of more general forms of queries that characterize the way in which information is accessed for an application. An initial choice of indexes is made, only considering their suitability for answering the partial match queries.