论文信息 - A search path selection algorithm for the Data Independent Accessing Model (DIAM)

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

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.

Sakti P. Ghosh | Morton M. Astrahan

[1] Sakti P. Ghosh,et al. A Translator Optimizer for Obtaining Answers to Entity Set Queries from an Arbitrary Access Path in Network , 1974, IFIP Congress.

[2] Michael E. Senko,et al. Specifications in a Data Independent Accessing Model , 1972, SIGFIDET '72.

[3] E. SenkoM.,et al. Data structures and accessing in data-base systems , 1973 .

[4] Michael E. Senko,et al. Concepts of a Data Independent Accessing Model , 1972, SIGFIDET '72.

[5] A. Metaxides,et al. Data base task group report to the CODASYL programming language committee , 1969, DATB.