Abstract
In this paper we discuss the application of the deductive-tableau method for program synthesis to the generation of programs for computing the answers to the queries posed to a relational database. The input-output specification for the synthesis is directly extracted from the expressions of relational calculus. The synthesis is then divided into two steps: the first one produces programs implementing the operators of relational algebra in an applicative, side-effect free language; the second one translates the queries expressed in relational calculus into equivalent expressions of relational algebra. The syntheses have been machine checked using the Deductive Tableau System1. The work follows a previous application of the deductive-tableau method to the synthesis of programs for data base transactions and aims at developing a test of practical significance for program synthesis.
This is a preview of subscription content, log in via an institution to check access.
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
R. Burback, S.A. Frazer, H. McGuire, J. Smith, M. Winstandley. Using the Deductive Tableau System. Chariot Software Group, 1990.
J. Freytag, N. Goodman. On the translation of relational queries into iterative programs. ACM Transactions on Database Systems 14: 1, 1989, pp. 1–27.
G. Gardarin, P. Valduriez. Relational Databases and Knowledge Bases. Addison Wesley, 1989.
M. Jarke, J. Koch. Query optimization in Database Systems. ACM Computing Surveys, 16, 2 (June 1984), pp. 111–152.
D. Maier. The theory of relational databases. Computer Science Press, 1983.
Z. Manna, R. Waldinger. A deductive approach to program synthesis, ACM Transaction on Programming Languages and Systems, 2: 1980,pp. 90–121.
Z. Manna, R. Waldinger. The logical basis for computer programming. Vol. 1: Deductive reasoning. Addison Wesley, 1985.
Z. Manna, R. Waldinger. The logical basis for computer programming. Vol. 2: Deductive systems. Addison Wesley, 1990.
J.B. Morris. E-resolution: extension of resolution to include the equality relation. Proceedings of the 1st IJCAI, 1969, 394–402.
N.W. Murray. Completely nonclausal theorem proving. Art. Int. 18: pp. 67–85, 1982.
D. Nardi. Formal synthesis of a unification algorithm by the Deductive- Tableau method. Journal of Logic Programming, 1989: 7: pp. 1–43.
X. Qian. Synthesizing database transactions. Proc. of 16th VLDB Conf., Brisbane, Australia, 1990, 552–565.
X. Qian. The deductive synthesis of database transactions. Ph.D. dissertation, technical report STAN-CS-89–1291. Dept. of Computer Science, Stanford University, 1989.
R. Rosati. Sintesi di programmi con il metodo dei tableaux deduttivi per il calcolo della risposta ad una interrogazione ad una base di dati. Tesi di Laurea, Univ. Roma “La Sapienza”, (in Italian ) 1991.
J. Ullman. Principles of database and knowledge-base systems. Computer Science Press, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
The Deductive Tableau System is a Trademark of Tableau Deductive Systems.
Rights and permissions
Copyright information
© 1993 Springer-Verlag London
About this chapter
Cite this chapter
Nardi, D., Rosati, R. (1993). Deductive Synthesis of Programs for Query Answering. In: Lau, KK., Clement, T.P. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3560-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3560-9_2
Publisher Name: Springer, London
Print ISBN: 978-3-540-19806-2
Online ISBN: 978-1-4471-3560-9
eBook Packages: Springer Book Archive