Tractable database design and datalog abduction through bounded treewidth

Information Systems

Volumn 35, Issue 3, 2010, Pages 278-298

  Gottlob, Georg ^a   Pichler, Reinhard ^b   Wei, Fang ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Bounded treewidth; Database design; Datalog abduction; Fixed parameter tractability; Normal forms; Tree decomposition

Indexed keywords

BOUNDED TREEWIDTH; DATABASE DESIGN; DATALOG; FIXED-PARAMETER TRACTABILITY; NORMAL FORM; TREE DECOMPOSITION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DESIGN; GRAPH THEORY;

DATABASE SYSTEMS;

EID: 73249115279     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2009.09.003     Document Type: Article

References (52)

1. W. Armstrong, Dependency structures of data base relationships, in: IFIP Congress, 1974, pp. 580-583.
2. J. Balsa, V. Dahl, J.P. Lopes, Datalog grammars for abductive syntactic error diagnosis and repair, in: Proceedings of the NLULP'95, International Workshop on Natural Language Understanding and Logic Programming, 1995.
3. Beeri C., and Bernstein P.A. Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst. 4 1 (1979) 30-59
4. Beeri C., and Honeyman P. Preserving functional dependencies. SIAM J. Comput. 10 3 (1981) 647-656
5. Bernstein P.A. Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1 4 (1976) 277-298
6. D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer, DAG-width and parity games, in: Proceedings of the STACS'06, Lecture Notes in Computer Science, vol. 3884, Springer, Berlin, 2006. pp. 524-536.
7. D. Berwanger, E. Grädel, Entanglement-a measure for the complexity of directed graphs with applications to logic and games, in: Proceedings of the LPAR'04, Lecture Notes in Computer Science, vol. 3452, Springer, Berlin, 2005, pp. 209-223.
8. Bodlaender H.L. A tourist guide through treewidth. Acta Cybern. 11 1-2 (1993) 1-22
9. Bodlaender H.L. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 6 (1996) 1305-1317
10. Bodlaender H.L., and Koster A.M.C.A. Safe separators for treewidth. Discrete Math. 306 3 (2006) 337-350
11. Bodlaender H.L., and Koster A.M.C.A. Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51 3 (2008) 255-269
12. Bonatti P., and Samarati P. Regulating service access and information release on the web. Proceedings of the CCS '00: ACM conference on Computer and Communications Security (2000), ACM Press, New York 134-143
13. Borodin A., Cook S.A., Dymond P.W., Ruzzo W.L., and Tompa M. Two applications of inductive counting for complementation problems. SIAM J. Comput. 18 3 (1989) 559-578
14. Ceri S., Gottlob G., and Tanca L. Logic Programming and Databases (1990), Springer, New York, USA
15. Chandra A.K., Kozen D., and Stockmeyer L.J. Alternation. J. ACM 28 1 (1981) 114-133
16. Courcelle B. Graph rewriting: an algebraic and logic approach. Handbook of Theoretical Computer Science, vol. B (1990), Elsevier Science Publishers 193-242
17. de Kleer J., Mackworth A.K., and Reiter R. Characterizing diagnoses and systems. Artif. Intell. 56 2-3 (1992) 197-222
18. Dowling W.F., and Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Log. Program. 1 3 (1984) 267-284
19. Eiter T., and Gottlob G. The complexity of logic-based abduction. J. ACM 42 1 (1995) 3-42
20. Fischer P.C., Jou J.H., and Tsou D.-M. Succinctness in dependency systems. Theor. Comput. Sci. 24 (1983) 323-329
21. Flum J., Frick M., and Grohe M. Query evaluation via tree-decompositions. J. ACM 49 6 (2002) 716-752
22. Frick M., and Grohe M. The complexity of first-order and monadic second-order logic revisited. Proceedings of the LICS'02 (2002), IEEE Computer Society 215-224
23. G. Friedrich, G. Gottlob, W. Nejdl, Hypothesis classification, abductive diagnosis and therapy, in: Proceedings of the International Workshop on Expert Systems in Engineering: Principles and Applications, Lecture Notes in Computer Science, vol. 462, Springer, Berlin, 1990, pp. 69-78.
24. Gottlob G., Grädel E., and Veith H. Datalog lite: a deductive query language with linear time model checking. ACM Trans. Comput. Logic 3 1 (2002) 42-79
25. Gottlob G., Koch C., Pichler R., and Segoufin L. The complexity of XPath query evaluation and XML typing. J. ACM 52 2 (2005) 284-335
26. Gottlob G., Leone N., and Scarcello F. A comparison of structural CSP decomposition methods. Artif. Intell. 124 2 (2000) 243-282
27. Gottlob G., Leone N., and Scarcello F. The complexity of acyclic conjunctive queries. J. ACM 48 3 (2001) 431-498
28. Gottlob G., Leone N., and Scarcello F. Computing LOGCFL certificates. Theor. Comput. Sci. 270 1-2 (2002) 761-777
29. Gottlob G., Leone N., and Scarcello F. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64 3 (2002) 579-627
30. Gottlob G., Pichler R., and Wei F. Bounded treewidth as a key to tractability of knowledge representation and reasoning. Proceedings of the AAAI'06 (2006), AAAI Press, New York 250-256
31. Gottlob G., Pichler R., and Wei F. Tractable database design through bounded treewidth. Proceedings of the PODS'06 (2006), ACM Press, New York 124-133
32. Gottlob G., Pichler R., and Wei F. Efficient datalog abduction through bounded treewidth. Proceeings of the AAAI'07 (2007), AAAI Press, New York 1626-1631
33. Greibach S.A. The hardest context-free language. SIAM J. Comput. 2 4 (1973) 304-310
34. M. Grohe, Descriptive and parameterized complexity, in: Proceedigns of the CSL'99, Lecture Notes in Computer Science, vol. 1683, Springer, Berlin, 1999, pp. 14-31.
35. M. Hermann, R. Pichler, Counting complexity of propositional abduction, in: Proceedings of the IJCAI-07, 2007, pp. 417-422.
36. Hunter P., and Kreutzer S. Digraph measures: Kelly decompositions, games, and ordering. Theor. Comput. Sci. 399 (2008) 206-219
37. Johnson D.S. A catalog of complexity classes. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) (1990), Elsevier Science Publishers B.V., North-Holland 67-161
38. Karp R.M., and Ramachandran V. Parallel algorithms for shared-memory machines. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) (1990), Elsevier, MIT Press 869-942
39. H. Koshutanski, F. Massacci, An access control framework for business processes for web services, in: Proceedings of the XMLSEC '03: ACM Workshop on XML Security, 2003, pp. 15-24.
40. Koster A.M.C.A., Bodlaender H.L., and van Hoesel S.P.M. Treewidth: computational experiments. Electronic Notes Discrete Math. 8 (2001) 54-57
41. M. Lohrey, On the parallel complexity of tree automata, in: Proceedings of the RTA'01, Lecture Notes on Computer Science, vol. 2051, Springer, Berlin, 2001, pp. 201-215.
42. Lucchesi C.L., and Osborn S.L. Candidate keys for relations. J. Comput. Syst. Sci. 17 2 (1978) 270-279
43. Mannila H., and Räihä K.-J. The Design of Relational Databases (1992), Addison-Wesley, Reading, MA
44. H. Maryns, On the implementation of tree automata: limitations of the naive approach, in: Proceedings of the TLT'06: International Treebanks and Linguistic Theories Conference, 2006, pp. 235-246.
45. Minoux M. LTUR: a simplified linear-time unit resolution algorithm for horn formulae and computer implementation. Inf. Process. Lett. 29 1 (1988) 1-12
46. Nambiar K.K., Gopinath B., Nagaraj T., and Manjunath. Boyce-Codd normal form decomposition. J. Comput. Math. Appl. 33 4 (1997)
47. Obdržálek J. DAG-width: connectivity measure for directed graphs. Proceedings of the SODA'06 (2006), ACM Press, New York 814-821
48. Osborn S.L. Testing for existence of a covering Boyce-Codd normal form. Inf. Process. Lett. 8 1 (1979) 11-14
49. Ruzzo W.L. Tree-size bounded alternation. J. Comput. Syst. Sci. 21 2 (1980) 218-235
50. M. Samer, S. Szeider, Algorithms for propositional model counting, in: Proceedings of the LPAR'07, Lecture Notes in Computer Science, vol. 4790, 2007, pp. 484-498.
51. S. Szeider, On fixed-parameter tractable parameterizations of SAT, in: Proceedings of the SAT'03, Selected Revised Papers, Lecture Notes in Computer Science, vol. 2919, 2004, pp. 188-202.
52. van den Eijkhof F., Bodlaender H.L., and Koster A.M.C.A. Safe reduction rules for weighted treewidth. Algorithmica 47 2 (2007) 139-158