On acyclic conjunctive queries and constant delay enumeration

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4646 LNCS, Issue , 2007, Pages 208-222

  Bagan, Guillaume ^a   Durand, Arnaud ^b   Grandjean, Etienne ^a  

^a UNIVERSITÉ DE CAEN   (France)

^b INSTITUT DE MATHÉMATIQUES DE JUSSIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; MATRIX ALGEBRA; PROBLEM SOLVING;

ACYCLIC CONJUNCTIVE QUERIES; ENUMERATION COMPLEXITY; LINEAR PRECOMPUTATION; POLYNOMIAL TIME;

QUERY PROCESSING;

EID: 38049091433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74915-8_18     Document Type: Conference Paper

References (17)

1. Bagan, G.: MSO queries on tree decomposable structures are computable with linear delay. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 167-181. Springer, Heidelberg (2006)
2. Bagan, G., Durand, A., Grandjean, E., Olive, F.: Computing the jth element of a first-order query (submitted 2007)
3. Berge, C.: Graphs and hypergraphs, 2nd edn. Amsterdam (1973)
4. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1-21 (1993)
5. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305-1317 (1996)
6. Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. Theor. Comput. Sci. 239(2), 211-229 (2000)
7. Cohn, H., Kleinberg, R., Szegedy, B., Umans, C.: Group-theoretic algorithms for matrix multiplication. In: FOCS, pp. 379-388 (2005)
8. Courcelle, B.: Linear delay enumeration and monadic second-order logic. Discrete Applied Maths (to appear, 2006)
9. Courcelle, B., Mosbah, M.: Monadic second-order evaluations on treedecomposable graphs. Theor. Comput. Sci., 109(1&2), 49-82 (1993)
10. Durand, A., Grandjean, E.: First-order queries on structures of bounded degree are computable with constant delay. Transactions on Computational Logic (to appear)
11. Durand, A., Olive, F.: First-order queries over one unary function. In: Esik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 334-348. Springer, Heidelberg (2006)
12. Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. J. ACM 49(6), 716-752 (2002)
13. Grandjean, E., Schwentick, T.: Machine-independent characterizations and complete problems for deterministic linear time. SIAM J. Comput., 32(1), 196-230 (2002)
14. Grohe, M., Schwentick, T., Segoufin, L.: When is the evaluation of conjunctive queries tractable? In: STOC, pp. 657-666 (2001)
15. Libkin, L.: Elements of finite model theory. Springer, Heidelberg (2004)
16. Papadimitriou, C.H., Yannakakis, M.: On the complexity of database queries. J. Comput. Syst. Sci. 58(3), 407-427 (1999)
17. Yannakakis, M.: Algorithms for acyclic database schemes, 82-94 (1981)