Evaluation of queries based on the extended relational calculi

  • Isamu Kobayashi


An efficient database search algorithm is presented. Four major enhancements on the preceding works have been made. They are (1) relational calculus is extended to enable processing an arbitrary logical function defined on one or more relations, (2) a set of elementary operations which are similar to but are more efficient in processing compound search conditions than the relational algebra is used, (3) the target list processing is completely separated from the search process, and (4) sequential collation procedure is fully utilized to deal with conditions of a certain type defined on two or more relations. The algorithm is composed of two parts: syntactical transformation of the given extended relational calculus and the search execution. Various optimization issues are integrated into these two parts.

Key words

Database query evaluation query optimization relational algebra relational calculus search algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. M. Astrahan and D. D. Chamberlin, “Implementation of the Structured English Query Language,”Comm. ACM,18(10), 580–588 (1975).Google Scholar
  2. 2.
    Y. Chiba, “A Data Base Search Algorithm Based on Complicated Retrieval Algorithms,”The Soken Kiyo,5(1), Nippon Univac Sogo Kenkyusho, Inc., pp. 159–176 (1975).Google Scholar
  3. 3.
    E. F. Codd, “A Data Base Sublanguage Founded on the Relational Calculus,” InProceedings ACM SIGMOD ′71 Workshop on Data Description, Access and Control, 1971, pp. 35–68.Google Scholar
  4. 4.
    E. F. Cood, “Relational Completeness of Data Base Sublanguages,” inData Base Systems, Courant Computer Science Symposium, 6, R. Rustin, ed. (Prentice-Hall, Englewood Cliffs, New Jersey, 1972), pp. 65–98.Google Scholar
  5. 5.
    G. D. Held, M. R. Stonebraker, and E. Wong, “INGRES—A Relational Data Base System,” InProceedings of AFIPS ′75 NCC, (1975), pp. 409–416.Google Scholar
  6. 6.
    I. Kobayashi, “An Overview of Database Management Technology,” Sanno College of Management and Informatics, TRCS-4, also to appear inAdvances in Information Systems Science, 9, J. T. Tou, ed. (Plenum Press, New York, 1982).Google Scholar
  7. 7.
    I. Kobayashi, “Manipulating Database Relations,” Sanno College of Management and Informatics, TRCS-5, 1980.Google Scholar
  8. 8.
    K. Kohri and Y. Chiba, “FORMS Phase 2 Design Specification: A FORTRAN Oriented Information Management System,”The Soken Kiyo,5(10), Nippon Univac Sogo Kenkyusho, Inc. (1975), pp. 177–210.Google Scholar
  9. 9.
    D. E. Knuth,The Art of Computer Programming 3, Sorting and Searching (Addison-Wesley, Reading, Massachusetts, 1968).Google Scholar
  10. 10.
    J. Martin,Principles of Data-Base Management (Prentice-Hall, Englewood Cliffs, New Jersey, 1976).Google Scholar
  11. 11.
    F. P. Palermo, “A Data Base Search Problem,” InProceedings of the 4th International Symposium Computer Information Science (Plenum Press, New York, 1972), pp. 67–101.Google Scholar
  12. 12.
    R. Reiter, “Query Optimization for Question-Answering Systems,” inProceedings of the COLING Conference, Ottawa (1976).Google Scholar
  13. 13.
    J. B. Rothnie, “Evaluating Inter-Entry Retrieval Expressions in a Relational Database Management System,” inProceedings of the AFIPS ′75 NCC (1975), pp. 417–423.Google Scholar
  14. 14.
    J. M. Smith and P. Y. T. Chang, “Optimizing the Performance of Relational Algebra Database Interface,”Comm. ACM,18(10), 568–588 (1975).Google Scholar
  15. 15.
    G. Salton and A. Wong, “Generation and Search of Clustered Files,”ACM Trans. Database Sys. 3(4), 321–346 (1978).Google Scholar
  16. 16.
    S. Todd, “PRTV: An Efficient Implementation of Large Relational Data Bases,” inProceedings of the 1st International Conference on Very Large Data Bases (1975), pp. 544–556.Google Scholar
  17. 17.
    J. T. Tou, “Design of Medical Knowledge System for Diagnostic Consultation and Clinical Decision-Making,” inProceedings of the International Computer Symposium ′78 (1978), pp. 80–99.Google Scholar
  18. 18.
    G. Wiederhold,Database Design (McGraw-Hill, New York, 1977).Google Scholar
  19. 19.
    H. K. T. Wong and K. Youssefi, “Decomposition: A Strategy for Query Processing,”ACM Trans. Database Syst. 1(3), 233–241 (1976).Google Scholar
  20. 20.
    S. B. Yao, “Optimization of Query Evaluation Algorithms,”ACM Trans. Database Syst. 4(2), 133–155 (1979).Google Scholar

Copyright information

© Plenum Publishing Corporation 1981

Authors and Affiliations

  • Isamu Kobayashi
    • 1
  1. 1.SANNO Institute of Business AdministrationSchool of Management and InformaticsKanagawaJapan

Personalised recommendations