Abstract
In this chapter we combine the advantages of two possible logical interpretations of databases — the so-called proof theoretic and model theoretic approaches. These advantages are: computability of the answer for queries by means of relational algebra in the model theoretic approach and generality of the proof theoretic approach. We claim that although database systems should be supplied with inference rules for automatic reasoning, the core of the query answering process should be algebraic, if possible, in the relational algebra-like style.
Certainly any proposed algebraic system for computing answers to queries must be proved correct with respect to the underlying first order theory (i.e., by using algebraic tools we obtain only valid and all valid conclusions which could be derived). Such a correctness criterion is proposed and applied in this chapter.
A new general notion of an answer to a query is defined, and two types of tables (extended relations), previously introduced in order to represent incomplete information are examined from the point of view of their application for algebratization of the query answering process. We show also how techniques introduced here could be useful in approximating answers to queries leading to a two-phase technique incorporating both algebraic and theorem-proving methods.
Keywords
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Beeri, C., Ullman, J.D. [1979] “The Theory of Joins in Relational Databases, ACM TODS 4 (1979) 297–314.
Codd, E.F., [1972] “Relational Completeness of Database Sublanguages,” In: Database Systems (R. Rustin, ed.), Prentice-Hall, Englewood Cliffs, N.J. 33–64.
Enderton, H.B. [1972] A Mathematical Introduction to Logic ,Academic Press, Inc., New York, N.Y.
Imielinski, T. [1981] “Problems of Representing Information in Relational Databases,” (in Polish), Ph.D. Thesis, Institute of Computer Science, Polish Academy of Sciences, Warsaw.
Imielinski, T. and Lipski, W., [1981] “On Representing Incomplete Information in a Relational Database,” Proceedings of the 7th International Conf. on Very Large Databases ,Cannes, France (September 1981) 388–397.
Imielinski, T. and Lipski, W. [1983] “Incomplete Information and Dependencies in Relational Databases,” Proceedings of the ACM SIGMOD Conference of Data Management ,San Jose (May 1983).
Reiter, R. [1981] “Towards a Logical Reconstruction of Relational Database Theory,” unpublished manuscript (May 1981).
Reiter, R. [1978] “On Closed World Databases,” In: Logic and Databases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York (1978) 58–76.
Warren, D. [1977] “Implementing Prolog,” Report 39, Dept. of Artificial Intelligence, Edinburgh (1977).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Plenum Press, New York
About this chapter
Cite this chapter
Imielinski, T. (1984). On Algebraic Query Processing in Logical Databases. In: Gallaire, H., Minker, J., Nicolas, J.M. (eds) Advances in Data Base Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-9385-0_10
Download citation
DOI: https://doi.org/10.1007/978-1-4615-9385-0_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-9387-4
Online ISBN: 978-1-4615-9385-0
eBook Packages: Springer Book Archive