Query answering under expressive entity-relationship schemata

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

Volumn 6412 LNCS, Issue , 2010, Pages 347-361

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY PERMUTATIONS; COMPLEXITY ANALYSIS; CONJUNCTIVE QUERIES; ENTITY-RELATIONSHIP MODEL; ENTITY-RELATIONSHIP SCHEMA; EXTENDED MODEL; EXTENDED VERSIONS; NEGATIVE CONSTRAINTS; ONTOLOGY LANGUAGE; QUERY ANSWERING; SUFFICIENT CONDITIONS; SYNTACTIC CHARACTERIZATION;

ONTOLOGY;

QUERY LANGUAGES;

EID: 78649938489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16373-9_25     Document Type: Conference Paper

References (27)

1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
2. Artale, A., Calvanese, D., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: Reasoning over extended ER models. In: Parent, C., Schewe, K.-D., Storey, V.C., Thalheim, B. (eds.) ER 2007. LNCS, vol. 4801, pp. 277-292. Springer, Heidelberg (2007)
3. Battista, G.D., Lenzerini, M.: A deductive method for entity-relationship modeling. In: Proc. of VLDB, pp. 13-21 (1989)
4. 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)
5. Calì, A., Gottlob, G., Kifer,M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70-80 (2008)
6. 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)
7. Calì, A., Gottlob, G., Pieris, A.: Tractable query answering over conceptual schemata. In: Proc. of ER, pp. 175-190 (2009)
8. Calì, A., Gottlob, G., Pieris, A.: Query answering under expressive entity-relationship schemata. Unpublished manuscript, available from the authors (2010)
9. 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)
10. Calì, A., Lembo, D., Rosati, R.: Query rewriting and answering under constraints in data integration systems. In: Proc. of IJCAI, pp. 16-21 (2003)
11. Calì, A., Martinenghi, D.: Querying incomplete data over extended ER schemata. TPLP 10(3), 291-329 (2010)
12. 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)
13. Calvanese, D., Giacomo, G.D., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of PODS, pp. 149-158 (1998)
14. Calvanese, D., Lenzerini, M., Nardi, D.: Description logics for conceptual data modeling. In: Logics for Databases and Information Systems, pp. 229-263 (1998)
15. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. of STOCS, pp. 77-90 (1977)
16. Chen, P.P.: The entity-relationship model: Towards a unified view of data. ACM Trans. Database Syst. 1(1), 9-36 (1976)
17. Deutsch, A., Nash, A., Remmel, J.B.: The chase revisisted. In: Proc. of PODS, pp. 149-158 (2008)
18. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1), 89-124 (2005)
19. Gogolla, M., Hohenstein, U.: Towards a semantic view of an extended entity-relationship model. ACM Trans. on Database Syst. 16(3), 369-416 (1991) (Pubitemid 23600331)
20. 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)
21. Kozen, D.: Lower bounds for natural proof systems. In: Proc. of FOCS, pp. 254-266 (1977)
22. Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455-469 (1979)
23. Markowitz, V.M., Makowsky, J.A.: Identifying extended entity-relationship object structures in relational schemas. IEEE Trans. Software Eng. 16(8), 777-790 (1990)
24. Markowitz, V.M., Shoshani, A.: Representing extended entity-relationship structures in relational databases: A modular approach. ACM Trans. Database Syst. 17(3), 423-464 (1992)
25. Ortiz, M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proc. of AAAI (2006)
26. Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semantics 10, 133-173 (2008)
27. Vardi, M.Y.: On the complexity of bounded-variable queries. In: Proc. of PODS, pp. 266-276 (1995)