Ontological query answering via rewriting

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

Volumn 6909 LNCS, Issue , 2011, Pages 1-18

  Gottlob, Georg ^a   Orsi, Giorgio ^a   Pieris, Andreas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; DATABASE DESIGN; FIRST-ORDER; MODEL-DRIVEN; ONTOLOGICAL CONSTRAINTS; ONTOLOGICAL DATABASE; ONTOLOGICAL QUERY; QUERY ANSWERING; QUERY OPTIMIZATION; QUERY REWRITINGS; SEMANTIC DATA;

INFORMATION SYSTEMS; ONTOLOGY; QUERY LANGUAGES; SEMANTICS;

QUERY PROCESSING;

EID: 80053070411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23737-9_1     Document Type: Conference Paper

References (32)

1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
2. Ajtai, M., Gurevich, Y.: Datalog vs. first-order logic. In: Proc. of FOCS, pp. 142-147 (1989) (Pubitemid 20725938)
3. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. of Artificial Intelligence Research 36, 1-69 (2009)
4. Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: On rules with existential variables: Walking the decidability line. Artif. Intell. 175(9-10), 1620-1654 (2011)
5. Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 73-85. Springer, Heidelberg (1981)
6. Bishop, B., Kiryakov, A., Ognyanoff, D., Peikov, I., Tashev, Z., Velkov, R.: Owlim: A family of scalable semantic repositories. Semantic Web 2(1), 33-42 (2011)
7. Cabibbo, L.: The expressive power of stratified logic programs with value invention. Inf. Comput. 147(1), 22-56 (1998) (Pubitemid 128453326)
8. Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70-80 (2008)
9. Calì, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. In: Proc. of PODS, pp. 77-86 (2009)
10. Calì, A., Gottlob, G., Pieris, A.: Tractable query answering over conceptual schemata. In: Laender, A.H.F., Castano, S., Dayal, U., Casati, F., de Oliveira, J.P.M. (eds.) ER 2009. LNCS, vol. 5829, pp. 175-190. Springer, Heidelberg (2009)
11. Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. PVLDB 3(1), 554-565 (2010)
12. Calì, A., Gottlob, G., Pieris, A.: Query answering under expressive Entity-Relationship schemata. In: Parsons, J., Saeki, M., Shoval, P., Woo, C., Wand, Y. (eds.) ER 2010. LNCS, vol. 6412, pp. 347-361. Springer, Heidelberg (2010)
13. ±. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 1-17. Springer, Heidelberg (2010)
14. Calì, A., Gottlob, G., Pieris, A.: Query rewriting under non-guarded rules. In: Proc. AMW (2010)
15. Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: Proc. of IJCAI, pp. 16-21 (2003)
16. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Autom. Reasoning 39(3), 385-429 (2007) (Pubitemid 47340922)
17. Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of KR, pp. 260-270 (2006)
18. Chong, E., Das, S., Eadon, G., Srinivasan, J.: An efficient SQL-based RDF querying scheme. In: Proc. of the 31th Intl Conf. on Very Large Data Bases (VLDB), pp. 1216-1227 (2005) (Pubitemid 43991091)
19. Deutsch, A., Nash, A., Remmel, J.B.: The chase revisisted. In: Proc. of PODS, pp. 149-158 (2008)
20. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1), 89-124 (2005) (Pubitemid 40612385)
21. Gaifman, H., Mairson, H.G., Sagiv, Y., Vardi, M.Y.: Undecidable optimization problems for database logic programs. J. ACM 40(3), 683-713 (1993) (Pubitemid 23707881)
22. Gottlob, G., Orsi, G., Pieris, A.: Ontological queries: Rewriting and optimization. In: Proc. of ICDE, pp. 2-13 (2011)
23. Gottlob, G., Schwentick, T.: Rewriting ontological queries into small non-recursive Datalog programs. In: Proc. of DL (2011)
24. Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1), 167-189 (1984) (Pubitemid 14569352)
25. Joiner, W.H.: Resolution strategies as decision procedures. J. ACM 23, 398-417 (1976)
26. Kontchakov, R., Lutz, C., Toman, D., Wolter, F., Zakharyaschev, M.: The combined approach to query answering in DL-Lite. In: Proc. of KR (2010)
27. Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455-469 (1979)
28. Orsi, G., Pieris, A.: Optimizing query answering under ontological constraints. In: PVLDB (2011) (in press)
29. Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading (1994)
30. Pérez-Urbina, H., Motik, B., Horrocks, I.: Tractable query answering and rewriting under description logic constraints. Journal of Applied Logic 8(2), 151-232 (2009)
31. Rosati, R., Almatelli, A.: Improving query answering over DL-Lite ontologies. In: Proc. KR (2010)
32. Vardi, M.Y.: On the complexity of bounded-variable queries. In: Proc. of PODS, pp. 266-276 (1995