Abstract
The use of constraints within logic programming and within database languages promises interesting new applications. We show that Datalog queries with simple integer order constraints can be evaluated bottom-up in closed form over generalized databases.
preliminary version
This work was supported in part by NSF grant IRI-8617344.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, V. Vianu. Procedural and Declarative Database Update Languages. Proc. 7th ACM Symposium on Principles of Database Systems, 240–250, 1988.
A.K. Aylamazyan, M.M. Gilula, A.P. Stolboushkin, G.F. Schwartz. Reduction of the Relational Model with Infinite Domain to the Case of Finite Domains. Proc. USSR Acad. of Science (Doklady), 286(2):308–311, 1986.
A. Colmerauer. An Introduction to Prolog III. Draft, 1987.
A.K. Chandra. Theory of Database Queries. 7th ACM Symposium on Principles of Database Systems, 1–9, 1988.
A.K. Chandra, D. Harel. Computable Queries for Relational Data Bases. Journal of Computer and Systems Sciences, 21:156–178, 1980.
J. Chomicki, T. Imielinski. Relational Specifications of Infinite Query Answers. Proc. ACM SIGMOD International Conference on Management of Data, 174–183, 1989.
M. Dincbas, et al. The Constraint Logic Programming Language CHIP. Proc. Fifth Generation Computer Systems, Tokyo Japan, 1988.
J. Ferrante, J.R. Geiser. An Efficient Decision Procedure for the Theory of Rational Order. Theoretical Computer Science, 4:227–233, 1977.
J. Ferrante, C.W. Rackoff. The Computational Complexity of Logical Theories, Springer-Verlag (No. 718), 1979.
R. Hull, J. Su. Domain Independence and the Relational Calculus. Technical Report 88-64, University of Southern California, submitted to IPL, 1989.
J. Jaffar, J-L. Lassez. Constraint Logic Programming. Proc. 14th ACM Symposium on Principles of Programming Languages, 111–119, 1987.
F. Kabanza, J-M. Stevenne, P. Wolper. Handling Infinite Temporal Data, 9th ACM Symposium on Principles of Database Systems, 392–403, 1990.
P.C. Kanellakis. Elements of Relational Database Theory. Handbook of Theoretical Computer Science, North-Holland, to appear.
P.C. Kanellakis, G.M. Kuper, P.Z. Revesz. Constraint Query Languages, 9th ACM Symposium on Principles of Database Systems, 299–313, 1990.
M. Kifer. On Safety, Domain Independence, and Capturability of Database Queries. Proc. International Conference on Databases and Knowledge Bases, Jerusalem Israel, 1988.
S.C. Kleene. General Recursive Functions on Natural Numbers. Matematische Annalen, 112:727–742, 1936.
P. Kolaitis, C.H. Papadimitriou. Why not Negation by Fixpoint? Proc. 7th ACM Symposium on Principles of Database Systems, 231–239, 1988.
H.R. Lewis, C.H. Papadimitriou. Elements of the Theory of Computation. Prentice-Hall, 1981.
J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.
R. Ramakrishnan. Magic Templates: A Spellbinding Approach to Logic Programs. Proc. 5th International Conference on Logic Programming, 141–159, 1988.
J.D. Ullman. Principles of Database Systems. Computer Science Press, 2nd Ed., 1982.
J.D. Ullman, A. Van Gelder. Parallel Complexity of Logical Query Programs. Algorithmica, 3:5–42, 1988.
M.Y. Vardi. The Complexity of Relational Query Languages. Proc. 14th ACM Symposium on Theory of Computing, 137–146, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Revesz, P.Z. (1990). A closed form for datalog queries with integer order. In: Abiteboul, S., Kanellakis, P.C. (eds) ICDT '90. ICDT 1990. Lecture Notes in Computer Science, vol 470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53507-1_77
Download citation
DOI: https://doi.org/10.1007/3-540-53507-1_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53507-2
Online ISBN: 978-3-540-46682-6
eBook Packages: Springer Book Archive