Optimizing query answering under ontological constraints

Proceedings of the VLDB Endowment

Volumn 4, Issue 11, 2011, Pages 1004-1015

  Orsi, Giorgio ^a   Pieris, Andreas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MODELING LANGUAGES; QUERY LANGUAGES; QUERY PROCESSING; SEMANTICS;

DATABASE RESEARCH; DATALOG; FIRST ORDER; ONTOLOGICAL CONSTRAINTS; ONTOLOGICAL MODELING; ONTOLOGICAL QUERY; ONTOLOGY'S; QUERY ANSWERING; QUERY REWRITINGS; REWRITTEN QUERY;

ONTOLOGY;

EID: 80053058060     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/3402707.3402737     Document Type: Conference Paper

References (21)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. C. Beeri and M. Y. Vardi. The implication problem for data dependencies. In Proc. of ICALP, pages 73-85, 1981.
3. L. Cabibbo. The expressive power of stratified logic programs with value invention. Inf. Comput., 147(1):22-56, 1998.
4. A. Cal'i, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. of KR, pages 70-80, 2008.
5. A. Cal'i, G. Gottlob, and T. Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. In Proc. of PODS, pages 77-86, 2009.
6. A. Cal'i, G. Gottlob, and A. Pieris. Advanced processing for ontological queries. PVLDB, 3(1):554-565, 2010.
7. A. Cal'i, G. Gottlob, and A. Pieris. Query answering under non-guarded rules in datalog+/-. In Proc. of RR, pages 175-190, 2010.
8. A. Cal'i, G. Gottlob, and A. Pieris. Query rewriting under non-guarded rules. In Proc. AMW, 2010.
9. 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. Reasoning, 39(3):385-429, 2007.
10. S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi. Decidable optimization problems for database logic programs (preliminary report). In Proc. of STOC, pages 477-490, 1988.
11. R. de Virgilio, F. Giunchiglia, and L. Tanca, editors. Semantic Web Information Management: A Model-Based Perspective. Springer Verlag, 2010.
12. A. Deutsch, A. Nash, and J. B. Remmel. The chase revisisted. In Proc. of PODS, pages 149-158, 2008.
13. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005.
14. H. Gaifman, H. G. Mairson, Y. Sagiv, and M. Y. Vardi. Undecidable optimization problems for database logic programs. In Proc. of LICS, pages 106-115, 1987.
15. G. Gottlob, G. Orsi, and A. Pieris. Ontological queries: Rewriting and optimization. In Proc. of ICDE, pages 2-13, 2011.
16. D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1):167-189, 1984.
17. J. W. Lloyd. Foundations of Logic Programming. Springer, 1984.
18. D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4):455-469, 1979.
19. H. Ṕerez-Urbina, B. Motik, and I. Horrocks. Tractable query answering and rewriting under description logic constraints. Journal of Applied Logic, 8(2):151-232, 2009.
20. A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati. Linking data to ontologies. J. Data Semantics, 10:133-173, 2008.
21. R. Rosati and A. Almatelli. Improving query answering over DL-Lite ontologies. In Proc. KR, pages 290-300, 2010