Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Codd, E.F.: Relational completeness of data base sublanguages. In Data base systems. / Ed: Rustin R. /, Prentice Hall, Englewood Cliffs, 1972, pp. 65–98
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–232
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sturc, J. (1977). A model for retrieval systems and some mathematical problems behind. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_171
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_171
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive