A Comparison of Access Path Strategies

  • Hideko S. Kunii


This chapter compares the performances of a database management system based upon GDM and a DBMS based on the relational data model in terms of effective use of access paths in query processing. Performance evaluation requires the specification of storage structures, query-processing algorithms, states of schemas, and the workload of queries to be processed. The specification of storage structures is given in terms of definitions for record, index, and link storage. The state of the schema is given in terms of a set of parameters such as number of occurrences, index selection, and selectivity on attributes. The workload is a set of one-, two-, and three-variable queries. Yao’s [80] cost model has embedded definition of query-processing algorithms and establishes the relationships between storage structures, schema states, and query specifications. Yao’s cost model uses accesses to external storage as its cost metric. We have extended Yao’s cost model to include the algorithms necessary for processing queries against GDM.


Query Processing Query Evaluation Link Type Record Type Storage Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Tokyo 1990

Authors and Affiliations

  • Hideko S. Kunii
    • 1
  1. 1.Software Division Ricoh Co, Ltd.TokyoJapan

Personalised recommendations