Abstract
We identify a number of simple, syntactic properties of recursive subgoals in linear single-rule and two-rule Datalog programs. These properties can be recognized in linear time and provide a sufficient condition for uniform 1-boundedness of single-rule programs. They can also be used to characterize both uniform 1-boundedness for single-rule programs and 1-boundedness for two-rule programs, when the programs belong to certain classes studied previously for the problem of boundedness. In addition, we provide an exact characterization for 1-boundedness of two-rule programs in which no EDB predicate is repeated in the recursive rule.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, “Boundedness is Undecidable for Datalog Programs with a Single Recursive Rule,” Inf. Proc. Letters 32, 1989, pp. 281–287.
A.V. Aho, Y. Sagiv and J.D. Ullman, “Equivalences among Relational Expressions,” SIAM J. Comput. 8, 2 (Apr. 1979), pp. 218–246.
S.S. Cosmadakis, H. Gaifman, P.C. Kanellakis, and M.Y. Vardi, “Decidable Optimization Problems for Database Logic Programs,” Proc. 12th Ann. ACM Symp. on Theory of Computing, 1988, pp. 477–490.
H. Gaifman, H. Mairson, Y. Sagiv, and M.Y. Vardi, “Undecidable Optimization Problems for Database Logic Programs,” Proc. 2nd IEEE Symp. on Logic in Computer Science, 1987, pp. 106–115.
I. Guessarian, “Deciding Boundedness for Uniformly Connected Datalog Programs,” Proc. 3rd Int. Conf. on Database Theory, Lecture Notes in Computer Science 470, Springer-Verlag, 1990, pp. 395–405.
Y.E. Ioannidis, “A Time Bound on the Materialization of Some Recursively Defined Views,” Proc. 11th Int. Conf. on Very Large Data Bases, 1985, pp. 219–226.
P.C. Kanellakis, “Logic Programming and Parallel Complexity,” in Foundations of Deductive Databases and Logic Programming, (J. Minker, ed), Morgan Kaufmann Publishers, Inc., 1988, pp. 547–585.
J.F. Naughton, “Data Independent Recursion in Deductive Databases,” Proc. 5th ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1986, pp. 267–279.
J.F. Naughton and Y. Sagiv, “A Decidable Class of Bounded Recursions,” Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1987, pp. 227–236.
R. Ramakrishnan, Y. Sagiv, J.D. Ullman, and M.Y. Vardi, “Proof-Tree Transformation Theorems and Their Applications,” Proc. 8th ACM SIGACT-SIGMOD-SIGACT Symp. on Principles of Database Systems, 1989, pp. 172–181.
Y.P. Saraiya, “Linearizing Nonlinear Recursions in Polynomial Time,” Proc. 8th ACM SIGACT-SIGMOD-SIGACT Symp. on Principles of Database Systems, 1989, pp. 182–189.
Y.P. Saraiya, “Polynomial-Time Program Transformations in Deductive Databases,” Proc. 9th ACM SIGACT-SIGMOD-SIGACT Symp. on Principles of Database Systems, 1990, pp. 132–144.
M.Y. Vardi, “Decidability and Undecidability Results for Boundedness of Linear Recursive Queries,” Proc. 7th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1988, pp. 341–351.
P.T. Wood, A.O. Mendelzon and P. Atzeni, “Idempotent Single-Predicate Horn Clauses,” Proc. 2nd Int. Conf. on Database Theory, Lecture Notes in Computer Science 326, Springer-Verlag, 1988, pp. 129–143.
P.T. Wood, “Syntactic Characterizations of 1-Bounded Datalog Programs,” Tech. Rep. CS-91-02-01, Univ. of Cape Town (Sept. 1991).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wood, P.T. (1991). Syntactic characterizations of 1-bounded Datalog programs. In: Delobel, C., Kifer, M., Masunaga, Y. (eds) Deductive and Object-Oriented Databases. DOOD 1991. Lecture Notes in Computer Science, vol 566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55015-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-55015-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55015-0
Online ISBN: 978-3-540-46646-8
eBook Packages: Springer Book Archive