Datalog programs and their persistency numbers

ACM Transactions on Computational Logic

Volumn 6, Issue 3, 2005, Pages 481-518

  Afrati, Foto ^a   Cosmadakis, Stavros ^b   Foustoucos, Eugénie ^c  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

^c UNIVERSITY OF ATHENS   (Greece)

Author keywords

Bounded tree width hypergraphs; Boundedness; Datalog; Finite automata; Persistency numbers; Persistent variables; Program transformations

Indexed keywords

BOUNDED-TREE WIDTH HYPERGRAPHS; BOUNDEDNESS; DATALOG; DECISION PROBLEMS; LANGUAGES; MODELS OF COMPUTATION; PERSISTENCY NUMBERS; PERSISTENT VARIABLES; PROGRAM TRANSFORMATIONS; RESOURCE-BOUNDED;

ALGORITHMS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; FINITE AUTOMATA; FORMAL LANGUAGES; GRAPH THEORY; LOGIC PROGRAMMING; QUERY LANGUAGES;

COMPUTER PROGRAMMING;

EID: 23244464795     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1071596.1071597     Document Type: Article

References (25)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, MA.
2. ABITEBOUL, S. AND VIANU, V. 1991. Expressive power of query languages. In Theoretical Studies in Computer Science, J. D. Ullman, ed. Academic Press, New York, NY, 207-251.
3. AFRATI, P. 1997. Bounded arity Datalog(≠) queries on graphs. J. Comput. Syst. Sci. 55, 2, 210-228. (Special issue on 1997 ACM Conference on Principles of Database Systems.)
4. AFRATI, F. AND COSMADAKIS, S. 1989. Expressiveness of restricted recursive queries. In Proceedings of the 21st ACM Symposium on Theory of Computing. 113-126.
5. CERI, S., GOTTLOB, G., AND TANCA, L. 1990. Logic Programming and Databases. Springer-Verlag, Berlin, Germany.
6. COSMADAKIS, S. S., GAIFMAN, H., KANELLAKIS, P. C., AND VARDI, M. Y. 1988. Decidable optimization problems for database logic programs. In Proceedings of the 20th ACM Symposium on Theory of Computing. (Chicago, IL), 477-490.
7. COSMADAKIS, S. S. 1989. On the first-order expressibility of recursive queries. In Proceedings of the 8th ACM Symposium on Principles of Database Systems (Mar.). 311-323.
8. COSMADAKIS, S. S. 2002. Inherent complexity of recursive queries. J. Comput. Syst. Sci. 64, 3, 466-495.
9. COSMADAKIS, S. S. AND FOUSTOUCOS, E. 2002. Undecidability results concerning Datalog programs and their persistency numbers. Technical rep. No. TR2002/12/03. Research Academic Computer Technology Institute (CTI), Patras, Greece.
10. COSMADAKIS, S. S., FOUSTOUCOS, E., AND SIDIROPOULOS, A. 2003. Undecidability and intractability results concerning Datalog programs and their persistency numbers. Unpublished manuscript, submitted for publication July 2004.
11. COURCELLE, B. 1990. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, ed. Elsevier, Amsterdam, The Netherlands, 193-242.
12. GAIFMAN, H., MAIRSON, H., SAGIV, Y., AND VARDI M. Y. 1993. Undecidable optimization problems for database logic programs. J. ACM 40, 3, 683-713.
13. Earlier published in Proceedings of the 2nd IEEE Symposium on Logic in Computer Science, (Ithaca, NY). 106-115.
14. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2001. Hypertree decompositions: A survey. In Mathematical Foundations of Computer Science (MFCS 2001). Lecture Notes in Computer Science, vol. 2136. Springer, Berlin, Germany, 37-57.
15. GROHE, M. 1994. Bounded-arity hierarchies in fixed-point logics. In CSL'93: Computer Science Logic, E. Boerger, Y. Gurevich, and K. Meinke, ed. Lecture Notes in Computer Science, Vol. 832, Springer, Berlin, Germany, 150-164.
16. GROHE, M. AND MARINO, J. 1999. Definability and descriptive complexity on databases of bounded tree-width. In Proceedings of the 7th International Conference on Database Theory, C. Beeri and P. Buneman, eds. Lecture Notes in Computer Science, vol. 1540, Springer, Berline, Germany, 70-82.
17. GROHE, M., SCHWENTICK, T., AND SEGOUFIN, L. 2001. When is the evaluation of Conjunctive queries tractable? In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC'01). 657-666.
18. HILLEBRAND, G. G., KANELLAKIS, P. C., MAIRSON, H. G., AND VARDI, M. Y. 1995. Undecidable boundedness problems for Datalog programs. J. Logic Programm. 25, 2, 163-190.
19. (Expanded version of a paper that appeared in Proceedings of the 10th ACM Symposium on Principles of Database Systems (1991), pp. 1-12.)
20. MARCINKOWSKI, J. 1999. Achilles, Turtle, and undecidable boundedness problems for small Datalog programs. SIAM J. Computat. 29, 1, 231-257.
21. KOLAITIS, PH. AND VARDI, M. 1998. Conjunctive-query containment and constraint satisfaction. In Proceedings of the 17th ACM Symposium on Principles of Database Systems.
22. PAPADIMITRIOU, C. H. AND YANNAKAKIS, M. 1999. On the complexity of database queries. J. Comput. Syst. Sci. 58, 3, 407-427.
23. (Expanded version of a paper that appeared in Proceedings of the 16th ACM Symposium on Principles of Database Systems (1997)).
24. ULLMAN, J. D. 1989. Principles of Database and Knowledge-Base Systems, vols. I and II. Computer Science Press, Rockville, MD.
25. VARDI, M. Y 1988. Decidability and undecidability results for boundedness of linear recursive queries. In Proceedings of the 7th ACM Symposium on Principles of Database Systems. (Austin, TX). 341-351.