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

Abstract

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.