Querying conceptual schemata with expressive equality constraints

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

Volumn 6998 LNCS, Issue , 2011, Pages 161-174

  Calì, Andrea ^b,c   Gottlob, Georg ^a,c   Pieris, Andreas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPTUAL SCHEMAS; DATABASE CONSTRAINTS; ENTITY-RELATIONSHIP SCHEMA; EQUALITY CONSTRAINTS; EQUALITY-GENERATING DEPENDENCY; GENERAL CLASS; LOGICAL THEORIES; ONTOLOGY LANGUAGE; QUERY ANSWERING; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY; DATA MINING; RELATIONAL DATABASE SYSTEMS;

ONTOLOGY;

EID: 80455178559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24606-7_13     Document Type: Conference Paper

References (18)

1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
2. Calì, A., Calvanese, D., De Giacomo, G., Lenzerini, M.: Accessing data integration systems through conceptual schemas. In: Kunii, H.S., Jajodia, S., Sølvberg, A. (eds.) ER 2001. LNCS, vol. 2224, pp. 270-284. Springer, Heidelberg (2001) (Pubitemid 33370410)
3. Calì, A., Gottlob, G., Kifer,M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70-80 (2008)
4. 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)
5. 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)
6. Calì, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. PVLDB 3(1), 554-565 (2010)
7. 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)
8. Calì, A., Gottlob, G., Pieris, A.: Query answering under non-guarded rules in datalog+/-. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 175-190. Springer, Heidelberg (2010)
9. Calì, A., Gottlob, G., Pieris, A.: Query rewriting under non-guarded rules. In: Proc. AMW (2010)
10. Calì, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. of PODS, pp. 260-271 (2003)
11. 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)
12. Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Path-based identification constraints in description logics. In: Proc. of KR, pp. 231-241 (2008)
13. Chen, P.P.: The entity-relationship model: towards a unified view of data. ACM Trans. Database Syst. 1(1), 124-131 (1976)
14. Deutsch, A., Nash, A., Remmel, J.B.: The chase revisisted. In: Proc. of PODS, pp. 149-158 (2008)
15. Fagin, R., Kolaitis, P.G.,Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1), 89-124 (2005)
16. 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)
17. Kontchakov, R., Lutz, C., Toman, D.,Wolter, F., Zakharyaschev, M.: The combined approach to query answering in DL-lite. In: Proc. of KR (2010)
18. Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455-469 (1979)