Ontological query answering under expressive Entity-Relationship schemata

Information Systems

Volumn 37, Issue 4, 2012, Pages 320-335

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Complexity; Entity Relationship; Query Answering

Indexed keywords

ARBITRARY PERMUTATIONS; COMPLEXITY; COMPLEXITY ANALYSIS; CONJUNCTIVE QUERIES; DATABASE DESIGN; ENTITY-RELATIONSHIP; ENTITY-RELATIONSHIP MODEL; ENTITY-RELATIONSHIP SCHEMA; EXTENDED MODEL; EXTENDED VERSIONS; FUNDAMENTAL TOOLS; KNOWLEDGE REPRESENTATION AND REASONING; NEGATIVE CONSTRAINTS; ONTOLOGICAL QUERY; ONTOLOGY LANGUAGE; QUERY ANSWERING; SUBLANGUAGES; SUFFICIENT CONDITIONS; SYNTACTIC CHARACTERIZATION;

KNOWLEDGE REPRESENTATION; ONTOLOGY; QUERY LANGUAGES;

DATA MINING;

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

References (38)

1. A. Calì, G. Gottlob, A. Pieris, Tractable query answering over conceptual schemata, in: Proceedings of the ER-2009, pp. 175190.
2. A. Calì, G. Gottlob, A.Pieris, Query answering under expressive Entity-Relationship schemata, in: Proceedings of the ER-2010, pp. 347361.
3. P.P. Chen The Entity-Relationship model: towards a unified view of data ACM Transactions on Database Systems 1 1976 9 36
4. D. Calvanese, M. Lenzerini, and D. Nardi Description logics for conceptual data modeling Logics for Databases and Information Systems 1998 229 263
5. 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 Journal of Automated Reasoning 39 2007 385 429 (Pubitemid 47340922)
6. A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati Linking data to ontologies Journal of Data Semantics 10 2008 133 173
7. D. Maier, A.O. Mendelzon, and Y. Sagiv Testing implications of data dependencies ACM Transactions on Database Systems 4 1979 455 469
8. D.S. Johnson, and A.C. Klug Testing containment of conjunctive queries under functional and inclusion dependencies Journal of Computer and System Sciences 28 1984 167 189 (Pubitemid 14569352)
9. A. Calì, D. Lembo, R. Rosati, Query rewriting and answering under constraints in data integration systems, in: Proceedings of the IJCAI-2003, pp. 1621.
10. A.K. Chandra, P.M. Merlin, Optimal implementation of conjunctive queries in relational data bases, in: Proceedings of the STOC-1977, pp. 7790.
11. A. Calì, D. Lembo, R. Rosati, Decidability and complexity of query answering over inconsistent and incomplete databases, in: Proceedings of the PODS-2003, pp. 260271.
12. R. van der Meyden Logical approaches to incomplete information: a survey Logics for Databases and Information Systems 1998 307 356
13. M. Lenzerini, Data integration: a theoretical perspective, in: Proceedings of the PODS-2002, pp. 233246.
14. A. Calì, G. Gottlob, M. Kifer, Taming the infinite chase: query answering under expressive relational constraints, in: Proceedings of the KR-2008, pp. 7080.
15. M. Gogolla, and U. Hohenstein Towards a semantic view of an extended Entity-Relationship model ACM Transactions on Database Systems 16 1991 369 416 (Pubitemid 23600331)
16. V.M. Markowitz, and A. Shoshani Representing extended Entity-Relationship structures in relational databases: a modular approach ACM Transactions on Database Systems 17 1992 423 464 (Pubitemid 23599669)
17. V.M. Markowitz, and J.A. Makowsky Identifying extended Entity-Relationship object structures in relational schemas IEEE Transactions on Software Engineering 16 1990 777 790
18. G.D. Battista, M. Lenzerini, A deductive method for entityrelationship modeling, in: Proceeding of the VLDB-1989, pp. 1321.
19. A. Artale, D. Calvanese, R. Kontchakov, V. Ryzhikov, M. Zakharyaschev, Reasoning over extended ER models, in: Proceedings of the ER-2007, pp. 277292.
20. A. Calì, D. Calvanese, G.D. Giacomo, M. Lenzerini, Accessing data integration systems through conceptual schemas, in: Proceedings of the ER-2001, pp. 270284.
21. M. Ortiz, D. Calvanese, T. Eiter, Characterizing data complexity for conjunctive query answering in expressive description logics, in: Proceedings of the AAAI-2006.
22. D. Calvanese, G.D. Giacomo, M. Lenzerini, On the decidability of query containment under constraints, in: Proceedings of the PODS-1998, pp. 149158.
23. R. Fagin, P.G. Kolaitis, R.J. Miller, and L. Popa Data exchange: semantics and query answering Theoretical Computer Science 336 2005 89 124 (Pubitemid 40612385)
24. A. Deutsch, A. Nash, J.B. Remmel, The chase revisited, in: Proceedings of the PODS-2008, pp. 149158.
25. B. Marnette, Generalized schema-mappings: from termination to tractability, in: Proceedings of the PODS-2009, pp. 1322.
26. A. Calì, G. Gottlob, T. Lukasiewicz, A general datalog-based framework for tractable query answering over ontologies, in: Proceedings of the PODS-2009, pp. 7786.
27. A. Calì, G. Gottlob, and A. Pieris Advanced processing for ontological queries PVLDB 3 2010 554 565
28. A. Calì, G. Gottlob, A. Pieris, Query answering under non-guarded rules in Datalog/-, in: Proceedings of the RR-2010, pp. 117.
29. A. Calì, G. Gottlob, M. Kifer, T. Lukasiewicz, A. Pieris, Ontological reasoning with F-Logic Lite and its extensions, in: Proceedings of the AAAI-2010
30. A. Calì, and D. Martinenghi Querying incomplete data over extended ER schemata Theory and Practice of Logic Programming 10 2010 291 329
31. M.Y. Vardi, The complexity of relational query languages, in: Proceedings of the STOC-1982, pp. 137146.
32. S. Abiteboul, R. Hull, and V. Vianu Foundations of Databases 1995 Addison-Wesley
33. M.Y. Vardi, On the complexity of bounded-variable queries, in: Proceedings of the PODS-1995, pp. 266276.
34. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley
35. D. Calvanese, G.D. Giacomo, D. Lembo, M. Lenzerini, R. Rosati, What to ask to a peer: ontology-based query reformulation, in: Proceedings of the KR-2004, pp. 469478.
36. A. Calì, G. Gottlob, A. Pieris, Ontological query answering under expressive Entity-Relationship schemata, 2011, unpublished manuscript available from the authors.
37. D. Kozen, Lower bounds for natural proof systems, in: Proceedings of the FOCS-1977, pp. 254266.
38. J. de Bruijn, S. Heymans, Logical foundations of (e)RDF(S): complexity and reasoning, in: Proceedings of the ISWC-2007, pp. 8699.