Abstract
We define the class of syntactically safe queries in first order languages with function symbols. We prove using ideas from model theory that every model independent query is equivalent to a safe query. This answers a question raised by Topor in [Topor 1987].
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Avron and J. Hirshfeld, On first order database query languages. Proceeding of the sixth symposium on Logic in Computer Sciences (1991) 226–231.
R. Demolombe, Syntactical characterization of a subset of domain independent formulas. Technical report, ONERA-CERT, Toulouse (1982).
R.A. Di Paola, The recursive unsolvability of the decision problem for the class of definite formulas. J. ACM 16(2) (1969) 324–327.
M. Kifer, On safely, domain independence and capturability of database queries. Proc. International Conference on database and knowledge bases. Jerusalem (1988) 405–415.
R.W. Topor, Domain independence formulas and databases. Theoretical Computer Science 52 (1987) 281–306.
R.W. Topor and E.A. Sonenberg, On domain independent databases, In Foundation of deductive database and logic programming. Editor J. Minker.(1987) 217–240.
J.D. Ullman, Principles of database and knowledge base systems Volume 1. Computer Science Press (1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirshfeld, J. (1992). Safe queries in relational databases with functions. In: Börger, E., Jäger, G., Kleine Büning, H., Richter, M.M. (eds) Computer Science Logic. CSL 1991. Lecture Notes in Computer Science, vol 626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023766
Download citation
DOI: https://doi.org/10.1007/BFb0023766
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55789-0
Online ISBN: 978-3-540-47285-8
eBook Packages: Springer Book Archive