Abstract
We prove that boundedness is decidable for uniformly (and more generally strongly) connected Datalog programs. As for chain programs, which are a special case of uniformly connected programs, the proof is done by reducing the boundedness problem to context-free language finiteness. The same reduction technique could be used for containment problems.
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, Boundedness is undecidable for Datalog programs with a single recursive rule, IPL 32 (1989), 281–287.
M. Ajtai, Y. Gurevich, Datalog versus first order logic, Proc. 30th IEEE FOCS, (1989), 142–148.
C. Beeri, P. Kanellakis, F. Bancilhon, R. Ramakrishnan, Bounds on the propagation of selection into logic programs, Proc. 6th. ACM-PODS, San Diego (1987), 214–226.
F. Bancilhon, R. Ramakrishnan, Performance evaluation of Data Intensive Logic Programs, in Foundations of Deductive DataBases and Logic Programming, J. Minker Ed., Morgan-Kaufman, Los Altos (1988), 439–517.
S. Cosmadakis, H. Gaifman, P. Kanellakis, M. Vardi, Decidable optimizations for database logic programs, Proc. ACM-STOC, 1988.
H. Gaifman, H. Mairson, Y. Savig, and M. Vardi, Undecidable optimization problems for database logic programs, Proc of Logic in Comp. Sci. (1987).
Y.E. Ioannidis, A time bound on the materialization of some recursively defined views. In Proc. 11 th VLDB (1985), 219–226.
P. Kanellakis, Logic programming and parallel complexity, in Foundations of Deductive DataBases and Logic Programming, J. Minker Ed., Morgan-Kaufman, Los Altos (1987), 547–588.
P. Kanellakis, private communication.
P. Kanellakis and S. Abiteboul, Deciding bounded recursion in database logic programs, SIGACT News 20 (1989), 17–23.
J.F. Naughton and Y. Sagiv, A decidable class of bounded recursions. In Proc. 6th ACM-PODS (1986), 227–236.
J. Naughton, Data independent recursion in deductive databases, Jour. Comput. Sys. Sci. 38 (1989), 259–289.
Y. Sagiv, On computing restricted projections of representative instances, Proc. 4th ACM-PODS, (1985), 171–180.
K. Taghva, T. Wu, On the equivalence of a class of purely exponential logic queries to linear queries, to appear in RAIRO Inf. Théor..
J.D. Ullman, Data base and knowledge-base systems, 3rd ed. Computer Science Press, New York (1989).
M.Y. Vardi, Decidability and undecidability results for boundedness of linear recursive queries. In Proc. 7th ACM-PODS (1988).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guessarian, I. (1990). Deciding boundedness for uniformly connected Datalog programs. 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_91
Download citation
DOI: https://doi.org/10.1007/3-540-53507-1_91
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