Abstract
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, with an effective construction of equivalent non-recursive programs. (2) A generalized chain program, which allow IDB predicates of arbitrary arity and remove the uniqueness condition of chain variables, is bounded if and only if it is a unit recursion. (3) The characterization of uniform unboundedness for linear sirups in [NS] is extended to a substantial superclass called class C +. (4) Boundedness for class C + with multiple exit rules is decidable in polynomial space. (5) Predicate boundedness is decidable in doubly exponential time for a large class of Datalog programs that properly contains all connected monadic programs. (6) For binary linear programs, program boundedness is decidable if each recursive predicate is defined by at most one recursive rule; predicate boundedness is also decidable if each recursive predicate is mutually recursive with one another.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S.: Boundedness is undecidable for Datalog programs with a single recursive rules. IPL 32 (1989), pp. 281–287
Afrati, F., Papadimitriou, C.H.: The parallel complexity of simple chain queries. ACM PODS, 1987, pp. 210–213
Beeri, C., Kanellakis, P.C., Bancilhon, F., Ramakrishnan, R.: Bounds on the propagation of selection into logic programs. ACM PODS, 1987, pp. 214–226
Cosmadakis, S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimizations for datalog logic programs. ACM Symp. on Theory of Computing, 1988, pp. 477–490
Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational databases. ACM Symp. on Theory of Computing, 1977, pp. 77–90
Gaifman, H., Mairson, H., Sagiv, Y., Vardi, M.Y.: Undecidable optimization problems for database logic programs. Proc. of 2nd IEEE Symposium on Logic in Computer Science, 1987, pp. 106–115
Guessarian, I.: Deciding boundedness for uniformly connected Datalog programs. Lecture Notes in Computer Science 470, ICDT 1990, pp. 395–405
Hillebrand, G.G., Kanellakis, P.C., Mairson, H.G., Vardi, M.Y.: Tools for datalog boundedness. ACM PODS, 1991, pp. 1–12
Ioanidis, Y.E.: A time bound on the materialization of some recursively defined views. VLDB, 1985, pp. 219–226
Naughton, J., Sagiv, Y.: A decidable class of bounded recursions. ACM PODS, 1986, pp. 227–236
Naughton, J.: Data independent recursion in deductive databases. JCSS 38 (1989), pp. 259–289
Sagiv, Y.: On computing restricted projections of representative instances. ACM PODS, 1985, pp. 171–180
Vardi, M.Y.: Decidability and undecidability results for boundedness of linear recursive queries. ACM PODS, 1988, pp. 341–351
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, K. (1995). Some positive results for boundedness of multiple recursive rules. In: Gottlob, G., Vardi, M.Y. (eds) Database Theory — ICDT '95. ICDT 1995. Lecture Notes in Computer Science, vol 893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58907-4_29
Download citation
DOI: https://doi.org/10.1007/3-540-58907-4_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58907-5
Online ISBN: 978-3-540-49136-1
eBook Packages: Springer Book Archive