A Data Base Search Problem

  • Frank P. Palermo


The problem of constructing an efficient retrieval algorithm for responding to queries of arbitrary complexity on a relational data base is considered. A query, represented by a relation-defining expression in the relational calculus, is translated into a retrieval algorithm.


Response Relation Reduction Algorithm Relational Algebra Retrieval Algorithm Target Relation 
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.


  1. 1.
    E. F. Codd, A Relational Model of Data for Large Shared Data Banks,Commun. ACM 13(6), 377–387 (1970).CrossRefGoogle Scholar
  2. 2.
    E. F. Codd, Further Normalization of the Data Base Relational Model, inCourant Computer Science Symposia, No. 6, Data Base Systems (New York City, May 1971 ), Prentice Hall.Google Scholar
  3. 3.
    E. F. Codd, A Data Base Sublanguage Founded on the Relational Calculus, PROC. ACM-SIGFIDET workshop on Data Description, Access, and Control (San Diego, 1971 ), ACM, New York.Google Scholar
  4. 4.
    E. F. Codd, Relational Completeness of Data Base Sublanguages, inCourant Computer Science Symposia, No. 6, Data Base Systems ( New York City, May 1971 ), Prentice-Hall.Google Scholar
  5. 5.
    APL Users Manual, SH20-0906-0, IBM.Google Scholar
  6. 6.
    J. B. Rosser,Logic for Mathematicians, McGraw-Hill, New York (1953).Google Scholar

Copyright information

© Plenum Press, New York 1974

Authors and Affiliations

  • Frank P. Palermo
    • 1
  1. 1.IBM Research LaboratorySan JoseUSA

Personalised recommendations