Advertisement

On finding the optimal access path to resolve a relational data base query

  • P. Degano
  • A. Lomanto
  • F. Sirovich
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 88)

Abstract

The paper presents a formal model to specify a data base, a query and the access path which must be followed to obtain the ansewer. The model is based on the problem reduction hypergraphs, for which an admissible and optimal search algorithm is known. An effective method is given to map the data base and the query into a problem reduction hypergraph, which the known search algorithm can be applied to. The optimal solution to the problem reduction hypergraph provides an optimal (and possibly parallel) program to obtain the answer to the given query. Since the model allows to determine the correct answer, if any, without modifications of the data base nor requiring further information, it is an improvement over the models presented in the literature.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. /CK/.
    Carlson, C.R., and Kaplan, R.S. A generalized access path model and its application to a relational data base system. Proc. ACM-SIGMOD Int. Conf. on Management of Data 1976, Washington, D.C., USA, pp. 143–154.Google Scholar
  2. /TL/.
    Tsichritzis, D.C., and Lochovski, F.H. Data Base Management Systems. Academic Press, New York (1977).Google Scholar
  3. /LS1/.
    Levi, G., and Sirovich, F. A problem reduction model for non independent subproblems. Proc. 4th Int. Joint Conf. on Artif. Intel. 1975, Tbilisi, GSSR, USSR, pp. 340–344.Google Scholar
  4. /LS2/.
    Levi, G., and Sirovich, F. Generalized And/Or graphs. Artificial Intelligence, 7 (1976), pp. 243–259.Google Scholar
  5. /BE/.
    Berge, C. Graphes et Hypergraphes. Dunod, Paris (1970).Google Scholar
  6. /CB/.
    Chamberlin, D.D., and Boyce, R.F. SEQUEL: A structured English query language, Proc. ACM-SIGMOD Workshop on Data Description, Access and Control 1974, pp. 249–264.Google Scholar
  7. /HA/.
    Hanani, M.Z. An optimal evaluation of boolean expressions in an online query system, CACM 20, 5 (1977), pp. 344–347.Google Scholar
  8. /ES/.
    Eisner, M.J., and Severance, D.G. Mathematical techniques for efficient record segmentation in large shared data bases, J. ACM 23, 4 (1976), pp. 619–635.Google Scholar
  9. /KL/.
    Klar, P. Conditional answer in question-answering systems, 6th Proc. Int. Conf. on Artif. Intel. (1979). Tokyo.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • P. Degano
    • 1
  • A. Lomanto
    • 1
  • F. Sirovich
    • 2
  1. 1.Istituto di Scienze della InformazioneUniversità degli Studi C/so ItaliaPisa
  2. 2.Istituto di Elaborazione della Informazione — C.N.R.Pisa

Personalised recommendations