A simple characterization of uniform boundedness for a class of recursions

The Journal of Logic Programming - Tập 10 - Trang 233-253 - 1991
Jeffrey F. Naughton, Yehoshua Sagiv

Tài liệu tham khảo

Aho, 1979, Equivalence of Relational Expressions, SIAM J. Comput., 8, 218, 10.1137/0208017 Cosmadakis, 1986, Parallel Evaluation of Recursive Rule Queries, Proceedings of the ACM Symposium on Principles of Database Systems, 280 Chandra, 1977, Optimal Implementation of Conjunctive Queries in Relational Data Bases, Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, 77, 10.1145/800105.803397 Gaifman, 1987, Undecidable Optimization Problems for Database Logic Programs, Proceedings of the Second IEEE Symposium on Logic in Computer Science, 106 Ioannidis, 1985, A Time Bound on the Materialization of Some Recursively Defined Views, Proceedings of the 11th International VLDB Conference, 219 Ioannidis, 1986, Bounded Recursion in Deductive Databases, Algorithmica, 1, 361, 10.1007/BF01840452 Kanellakis, 1988, Logic Programs and Parallel Complexity, 547 Maher, 1988, Equivalences of Logic Programs, 627 Naughton, 1989, Data Independent Recursion in Deductive Databases, J. Comput. System Sci., 38, 259, 10.1016/0022-0000(89)90003-2 Naughton, 1989, Minimizing Function-Free Recursive Definitions, J. Assoc. Comput. Mach., 36, 69, 10.1145/58562.59303 Sagiv, 1988, On Bounded Database Schemes and Bounded Horn-Clause Programs, SIAM J. Comput., 17, 1, 10.1137/0217001 Sagiv, 1988, Optimizing Datalog Programs, 659 Sagiv, 1980, Equivalences Among Relational Expressions with the Union and Difference Operators, J. Assoc. Comput. Mach., 27, 633, 10.1145/322217.322221 van Emden, 1976, The Semantics of Predicate Logic as a Programming Language, J. Assoc. Comput. Mach., 23, 733, 10.1145/321978.321991