A search path selection algorithm for the Data Independent Accessing Model (DIAM)

  • Authors:
  • M. M. Astrahan;S. P. Ghosh

  • Affiliations:
  • -;-

  • Venue:
  • SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
  • Year:
  • 1974

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Data Independent Accessing Model (DIAM) provides great flexibility in specification of access paths to data. When a query is expressed in a Representation Independent Language (RIL), the problem arises of finding the relevant access paths and choosing the best ones for the query. A heuristic algorithm is described for finding the paths and making the choice.