The price of query rewriting in ontology-based data access

Artificial Intelligence

Volumn 213, Issue , 2014, Pages 42-59

  Gottlob, Georg ^a   Kikot, Stanislav ^b   Kontchakov, Roman ^b   Podolskii, Vladimir ^c   Schwentick, Thomas ^d   Zakharyaschev, Michael ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^d TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Boolean circuit; Conjunctive query; Datalog; Monotone complexity; Ontology; Query rewriting; Succinctness

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BOOLEAN CIRCUIT; CONJUNCTIVE QUERIES; DATALOG; MONOTONE COMPLEXITY; QUERY REWRITINGS; SUCCINCTNESS;

ONTOLOGY;

EID: 84901044170     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2014.04.004     Document Type: Article

References (60)

1. S. Abiteboul, R. Hull, and V. Vianu Foundations of Databases 1995 Addison-Wesley
2. N. Alon, and R. Boppana The monotone circuit complexity of Boolean functions Combinatorica 7 1 1987 1 22
3. S. Arora, and B. Barak Computational Complexity: A Modern Approach 1st Ed. 2009 Cambridge University Press New York, NY, USA
4. A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev The DL-Lite family and relations J. Artif. Intell. Res. 36 2009 1 69
5. J. Avigad Eliminating definitions and Skolem functions in first-order logic ACM Trans. Comput. Log. 4 3 2003 402 415
6. J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat Extending decidable cases for rules with existential variables Proc. of the 21st Int. Joint Conf. on Artificial Intelligence IJCAI 2009 2009 IJCAI 677 682
7. J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat On rules with existential variables: walking the decidability line Artif. Intell. 175 9-10 2011 1620 1654
8. M. Bienvenu, M. Ortiz, M. Simkus, and G. Xiao Tractable queries for lightweight description logics Proc. of the 23rd Int. Joint Conf. on Artificial Intelligence IJCAI 2013 2013 AAAI Press/IJCAI 768 774
9. M. Bienvenu, B. ten Cate, C. Lutz, and F. Wolter Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP Proc. of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems PODS 2013 2013 ACM 213 224
10. A. Borodin, J. von zur Gathen, and J.E. Hopcroft Fast parallel matrix and gcd computations Proc. of the 23rd Annual Symposium on Foundations of Computer Science FOCS'82 1982 IEEE Computer Society 65 71
11. A. Calì, G. Gottlob, and T. Lukasiewicz A general datalog-based framework for tractable query answering over ontologies J. Web Semant. 14 2012 57 83
12. A. Calì, G. Gottlob, and A. Pieris Advanced processing for ontological queries Proc. VLDB Endow. 3 1 2010 554 565
13. A. Calì, G. Gottlob, and A. Pieris Towards more expressive ontology languages: the query answering problem Artif. Intell. 193 2012 87 128
14. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati DL-Lite: tractable description logics for ontologies Proc. of the 20th Nat. Conf. on Artificial Intelligence AAAI 2005 2005 AAAI Press 602 607
15. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati Data complexity of query answering in description logics Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning KR 2006 2006 AAAI Press 260 270
16. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati Tractable reasoning and efficient query answering in description logics: the DL-Lite family J. Autom. Reason. 39 3 2007 385 429
17. C. Chekuri, and A. Rajaraman Conjunctive query containment revisited Theor. Comput. Sci. 239 2 2000 211 229
18. A. Chortaras, D. Trivela, and G. Stamou Optimized query rewriting for OWL 2 QL Proc. of the 23rd Int. Conf. on Automated Deduction CADE-23 Lecture Notes in Computer Science vol. 6803 2011 Springer 192 206
19. J. Dolby, A. Fokoue, A. Kalyanpur, L. Ma, E. Schonberg, K. Srinivas, and X. Sun Scalable grounded conjunctive query evaluation over large and expressive knowledge bases Proc. of the 7th Int. Semantic Web Conf. ISWC 2008 Lecture Notes in Computer Science vol. 5318 2008 Springer 403 418
20. T. Eiter, M. Ortiz, M. Šimkus, T.-K. Tran, and G. Xiao Query rewriting for Horn-SHIQ plus rules Proc. of the 26th AAAI Conf. on Artificial Intelligence AAAI 2012 2012 AAAI Press
21. J. Flum, and M. Grohe Parameterized Complexity Theory Texts in Theoretical Computer Science. An EATCS Series 2006 Springer
22. M. Garey, and D. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W. H. Freeman & Co. New York, NY, USA
23. G. Gottlob, M. Manna, and A. Pieris Polynomial combined rewritings for existential rules Proc. of the 14th Int. Conf. on the Principles of Knowledge Representation and Reasoning KR 2014 2014 AAAI Press
24. G. Gottlob, G. Orsi, A. Pieris Query rewriting and optimization for ontological databases, arXiv:1405.2848 [cs.DB], 12 May 2014.
25. G. Gottlob, G. Orsi, and A. Pieris Ontological queries: rewriting and optimization Proc. of the 27th Int. Conf. on Data Engineering ICDE 2011 2011 IEEE Computer Society 2 13
26. G. Gottlob, and T. Schwentick Rewriting ontological queries into small nonrecursive datalog programs Proc. of the 13th Int. Conf. on the Principles of Knowledge Representation and Reasoning KR 2012 2012 AAAI Press 254 263
27. M. Grohe, T. Schwentick, and L. Segoufin When is the evaluation of conjunctive queries tractable? Proc. of the 33rd ACM SIGACT Symposium on Theory of Computing STOC'01 2001 ACM 657 666
28. S. Heymans, L. Ma, D. Anicic, Z. Ma, N. Steinmetz, Y. Pan, J. Mei, A. Fokoue, A. Kalyanpur, A. Kershenbaum, E. Schonberg, K. Srinivas, C. Feier, G. Hench, B. Wetzstein, and U. Keller Ontology reasoning with large data repositories Ontology Management, Semantic Web, Semantic Web Services, and Business Applications Semantic Web and Beyond vol. 7 2008 Springer 89 128
29. S. Jukna Boolean Function Complexity: Advances and Frontiers 2012 Springer
30. S. Kikot, R. Kontchakov, V. Podolskii, and M. Zakharyaschev Query rewriting over shallow ontologies Proc. of the 26th Int. Workshop on Description Logics DL 2013 vol. 1014 2013 CEUR-WS 316 327
31. S. Kikot, R. Kontchakov, V. Podolskii, and M. Zakharyaschev On the succinctness of query rewriting over OWL 2 QL ontologies with shallow chases CoRR arXiv:1401.4420 [abs] 2014
32. S. Kikot, R. Kontchakov, V.V. Podolskii, and M. Zakharyaschev Exponential lower bounds and separation for query rewriting Proc. of the 39th Int. Colloquium on Automata, Languages, and Programming, Part II ICALP 2012 Lecture Notes in Computer Science vol. 7392 2012 Springer 263 274
33. S. Kikot, R. Kontchakov, and M. Zakharyaschev Conjunctive query answering with OWL 2 QL Proc. of the 13th Int. Conf. on the Principles of Knowledge Representation and Reasoning KR 2012 2012 AAAI Press 275 285
34. P.G. Kolaitis, and M.Y. Vardi Conjunctive-query containment and constraint satisfaction Proc. of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems PODS'98 1998 ACM Press 205 213
35. M. König, M. Leclère, M.-L. Mugnier, and M. Thomazo A sound and complete backward chaining algorithm for existential rules Proc. of the 6th Int. Conf. on Web Reasoning and Rule Systems RR 2012 Lecture Notes in Computer Science vol. 7497 2012 Springer 122 138
36. M. König, M. Leclère, M.-L. Mugnier, and M. Thomazo On the exploration of the query rewriting space with existential rules Proc. of the 7th Int. Conf. on Web Reasoning and Rule Systems RR 2013 Lecture Notes in Computer Science vol. 7994 2013 Springer 123 137
37. R. Kontchakov, C. Lutz, D. Toman, F. Wolter, and M. Zakharyaschev The combined approach to query answering in DL-Lite Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning KR 2010 2010 AAAI Press
38. R. Kontchakov, C. Lutz, D. Toman, F. Wolter, and M. Zakharyaschev The combined approach to ontology-based data access Proc. of the 22nd Int. Joint Conf. on Artificial Intelligence IJCAI 2011 2011 AAAI Press 2656 2661
39. C. Lutz, I. Seylan, D. Toman, and F. Wolter The combined approach to OBDA: taming role hierarchies using filters Proc. of the 12th Int. Semantic Web Conf. ISWC 2013 Lecture Notes in Computer Science vol. 8218 2013 Springer 314 330
40. C. Lutz, D. Toman, and F. Wolter Conjunctive query answering in the description logic EL using a relational database system Proc. of the 21st Int. Joint Conf. on Artificial Intelligence IJCAI 2009 2009 IJCAI 2070 2075
41. B.J. McMahan, G. Pan, P. Porter, and M.Y. Vardi Projection pushing revisited Proc. of the 9th Int. Conf. on Extending Database Technology EDBT Lecture Notes in Computer Science vol. 2992 2004 Springer 441 458
42. A.R. Meyer, and M.J. Fischer Economy of description by automata, grammars, and formal systems Proc. of the 12th Annual Symposium on Switching and Automata Theory SWAT/FOCS'71 1971 IEEE Computer Society 188 191
43. G. Orsi, and A. Pieris Optimizing query answering under ontological constraints Proc. VLDB Endow. 4 11 2011 1004 1015
44. M. Ortiz, S. Rudolph, and M. Simkus Query answering in the Horn fragments of the description logics SHOIQ and SROIQ Proc. of the 22nd Int. Joint Conf. on Artificial Intelligence IJCAI 2011 2011 IJCAI/AAAI 1039 1044
45. H. Pérez-Urbina, B. Motik, and I. Horrocks A comparison of query rewriting techniques for DL-Lite Proc. of the 22nd Int. Workshop on Description Logics DL 2009 vol. 477 2009 CEUR-WS
46. H. Pérez-Urbina, E. Rodríguez-Díaz, M. Grove, G. Konstantinidis, and E. Sirin Evaluation of query rewriting approaches for OWL 2 Proc. of SSWS+HPCSW 2012 vol. 943 2012 CEUR-WS
47. A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati Linking data to ontologies J. Data Semant. X 2008 133 173
48. R. Raz, and P. McKenzie Separation of the monotone NC hierarchy Proc. of the 38th Annual Symposium on Foundations of Computer Science FOCS'97 1997 IEEE Computer Society 234 243
49. R. Raz, and A. Wigderson Monotone circuits for matching require linear depth J. ACM 39 3 1992 736 744
50. A. Razborov Lower bounds for the monotone complexity of some Boolean functions Dokl. Akad. Nauk SSSR 281 4 1985 798 801
51. M. Rodríguez-Muro, R. Kontchakov, and M. Zakharyaschev Ontology-based data access: ontop of databases Proc. of the 12th Int. Semantic Web Conf. ISWC 2013 Lecture Notes in Computer Science vol. 8218 2013 Springer 558 573
52. M. Rodríguez-Muro, R. Kontchakov, and M. Zakharyaschev Ontop at work Proc. of the 10th Int. Workshop on OWL: Experiences and Directions OWLED 2013 vol. 1080 2013 CEUR-WS
53. R. Rosati On conjunctive query answering in EL Proc. of the 2007 Int. Workshop on Description Logics DL 2007 vol. 250 2007 CEUR-WS
54. R. Rosati Prexto: query rewriting under extensional constraints in DL-Lite Proc. of the 9th Extended Semantic Web Conf. EWSC 2012 Lecture Notes in Computer Science vol. 7295 2012 Springer 360 374
55. R. Rosati, and A. Almatelli Improving query answering over DL-Lite ontologies Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning KR 2010 2010 AAAI Press 290 300
56. B. Rossman Homomorphism preservation theorems J. ACM 55 2008 3
57. E. Salvat, and M.-L. Mugnier Sound and complete forward and backward chaining of graph rules Proc. of the 4th Int. Conf. on Conceptual Structures ICCS'96 Lecture Notes in Computer Science vol. 1115 1996 Springer 248 262
58. I.A. Stewart Logical description of monotone NP problems J. Log. Comput. 4 4 1994 337 357
59. G. Tseitin On the complexity of derivation in propositional calculus Automation of Reasoning 2: Classical Papers on Computational Logic 1967-1970 1983 Springer 466 483
60. M. Yannakakis Algorithms for acyclic database schemes Proc. of the 7th Int. Conf. on Very Large Data Bases VLDB'81 1981 IEEE Computer Society 82 94