A model for retrieval systems and some mathematical problems behind

  • Ján Sturc
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


We presented here a more formal alternative of the relational model. The advantages of this model as we see them lie in the fact that the more detailed formalization allows formal treatment of the equivalence problem and the rich algebraic structure gives a good possibility to exploit algebraical laws for the expression optimization. Moreover, the existing experience with the minimization of boolean expressions and optimization of arithmetical expressions may be utilized.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Codd, E.F.: Relational completeness of data base sublanguages. In Data base systems. / Ed: Rustin R. /, Prentice Hall, Englewood Cliffs, 1972, pp. 65–98Google Scholar
  2. 2.
    Hall, P.; Hitchcock, P.; Todd, S.: An algebra for machine computation. Proceedings of the Second symposium on principles of programming languages, Palo Alto, 1975, pp. 225–232Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Ján Sturc
    • 1
  1. 1.Computing Research CentreBratislavaCzechoslovakia

Personalised recommendations