Inherent complexity of recursive queries

Journal of Computer and System Sciences

Volumn 64, Issue 3, 2002, Pages 466-495

  Cosmadakis, Stavros ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; LINEAR EQUATIONS; LOGIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; QUEUEING THEORY; RECURSIVE FUNCTIONS;

DATALOG; INHERENT COMPLEXITY; PARALLEL COMPLEXITY; RECURSIVE QUERIES;

QUERY LANGUAGES;

EID: 10644266857     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1806     Document Type: Conference Paper

References (26)

1. [AHV95] S. Abiteboul, R. Hull, and V. Vianu, "Foundations of Databases," Addison-Wesley, Reading, MA, 1995.
2. [A97] F. Afrati, Bounded arity Datalog(≠) queries on graphs, J. Comput. System Sci. 55 (1997), 210-228.
3. [AC89] F. Afrati and S. Cosmadakis, Expressiveness of restricted recursive queries, in "Proc. 21st ACM Symp. on Theory of Computing," pp. 113-126, 1989.
4. [ACY95] F. Afrati, S. Cosmadakis, and M. Yannakakis, On Datalog vs. polynomial time, J. Comput. System Sci. 51 (1995), 177-196.
5. [AF99] F. Afrati and E. Foustoucos, Datalog program transformations and persistency numbers, manuscript, 1999.
6. [AG94] M. Ajtai and Y. Gurevich, Datalog vs first-order logic, J. Comput. System Sci. 49 (1994), 562-588.
7. [AP93] F. Afrati and C. H. Papadimitriou, The parallel complexity of simple logic programs, J. Assoc. Comput. Mach. 40 (1993).
8. [AU79] A. V. Aho and J. D. Ullman, Universality of data retrieval languages, in "Proc. 6th ACM Symp. on Principles of Programming Languages," pp. 110-117, 1979.
9. [BKBR90] C. Beeri, P. Kanellakis, F. Bancilhon, and R. Ramakrishnan, Bounds on the propagation of selection into logic programs, J. Comput. System Sci. 41 (1990), 157-180.
10. [BMSU86] F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, Magic sets and other strange ways to implement logic programs, in "Proc. 5th ACM Symp. on Principles of Database Systems," pp. 1-15, 1986.
11. [BR91 ] C. Beeri and R. Ramakrishnan, On the power of magic, J. Logic Program. 10 (1991).
12. [CFI92] Y. Cai, M. Furer, and N. Immerman, An optimal lower bound on the number of variables for graph identification, Combinatorica 12 (1992).
13. [Eh61] A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961), 129-141.
14. [EI95] K. Etessami and N. Immerman, Tree canonization and transitive closure, in "Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science," 1995.
15. [Fr54] R. Fraissé, Sur quelques classifications des systèmes de relations, Publ. Sci. Univ. Alg. Sér. A 1 (1954), 35-182.
16. [Gai82] H. Gaifman, On local and nonlocal properties, in "Logic Coloquium '81" (J. Stern, Ed.), pp. 105-135, North Holland, Amsterdam, 1982.
17. [GJ79] M. Garey and D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
18. [Imm81] N. Immerman, Number of quantifiers is better than number of tape cells, J. Comput. System Sci. 22 (1981), 384-406.
19. [Imm87] N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987), 760-778.
20. k) = VAR(k+1), in "Proceedings of the 6th Annual Conference on Structure in Complexity Theory," 1991.
21. [KV95] Ph. G. Kolaitis and M. Y. Vardi, On the expressive power of Datalog: tools and a case study, J. Comput. System Sci. 51 (1995), 110-134.
22. [LM89] V. S. Lakshmanan and A. O. Mendelzon, Inductive pebble games and the expressive power of Datalog, in "Proc. 8th ACM Symp. on Principles of Database Systems," pp. 301-310, 1989.
23. [LV98] S. Lifschitz and V. Vianu, A probabilistic view of Datalog parallelization, Theoret. Comput. Sci. 190 (1998), 211-239.
24. [SZ88] D. Sacca and C. Zaniolo, The generalized counting method for recursive logic queries, Theoret. Comput. Sci. 62 (1988).
25. [Ull89] J. D. Ullman, "Database and Knowledge-Base Systems," Vols. I and II, Computer Science Press, New York, 1989.
26. [UvG88] J. D. Ullman and A. Van Gelder, Parallel complexity of logical query programs, Algorithmica 3 (1988), 5-42.