Ontological queries: Rewriting and optimization

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 2-13

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; DATABASE RESEARCH; DATALOG; DESCRIPTION LOGIC; ENTERPRISE ONTOLOGY; ONTOLOGICAL CONSTRAINTS; ONTOLOGICAL QUERY; OPTIMIZATION METHOD; QUERY OPTIMIZATION; QUERY REWRITINGS; RELATIONAL DATABASE; REWRITING ALGORITHM; SOUNDNESS AND COMPLETENESS;

DATA DESCRIPTION; FORMAL LANGUAGES; OPTIMIZATION; QUERY LANGUAGES;

ONTOLOGY;

EID: 79957828081     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767965     Document Type: Conference Paper

References (34)

1. T. R. Gruber, "A translation approach to portable ontology specifications," Knowledge Acquisition, vol. 5, no. 2, pp. 199-220, 1993.
2. Wikipedia, "Ontology (information science)," 2010. [Online]. Available: http://en.wikipedia.org/wiki/Ontology (information science).
3. D. McComb, "The enterprise ontology," 2006. [Online]. Available: http://www.tdan.com/view-articles/5016.
4. 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, vol. 39, no. 3, pp. 385-429, 2007. (Pubitemid 47340922)
5. F. Baader, "Terminological cycles in a description logic with existential restrictions," in Proc. of 18th Intl Joint Conf. on Artificial Intelligence (IJCAI), 2003, pp. 325-330.
6. A. Calì, G. Gottlob, and T. Lukasiewicz, "A general Datalog-based framework for tractable query answering over ontologies," in Proc. of the 28th Symp. on Principles of Database Systems (PODS), 2009, pp. 77-86.
7. -, "Datalogi: A unified approach to ontologies and integrity constraints," in Proc. of the 12th Intl Conf. on Database Theory (ICDT), 2009, pp. 14-30.
8. A. Calì, G. Gottlob, and A. Pieris, "Advanced processing for ontological queries," in Proc. of the 36th Intl Conf. on Very Large Databases (VLDB), 2010, pp. 554-565.
9. -, "Query answering under non-guarded rules in Datalog±, " in Proc. of the 4th Intl conf. on Web Reasoning and Rule Systems (RR), 2010, pp. 1-17.
10. S. Ceri, G. Gottlob, and L. Tanca, "What you always wanted to know about Datalog (and never dared to ask)," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 1, pp. 146-166, 1989. (Pubitemid 20607001)
11. C. Beeri and M. Y. Vardi, "A proof procedure for data dependencies," Journal of the ACM, vol. 31, no. 4, pp. 718-741, 1984.
12. M. Y. Vardi, "On the complexity of bounded-variable queries," in Proc. of the 14th Symp. on Principles of Database Systems (PODS), 1995, pp. 266-276.
13. A. Calì, G. Gottlob, and A. Pieris, "Query rewriting under non-guarded rules," in Proc. of the 4th Alberto Mendelzon Intl Work. on Foundations of Data Management (AMW), 2010.
14. A. Deutsch, L. Popa, and V. Tannen, "Query reformulation with constraints," SIGMOD Record, vol. 35, pp. 65-73, 2006. (Pubitemid 43383850)
15. S. Alexaki, V. Christophides, G. Karvounarakis, D. Plexousakis, and K. Tolle, "The ICS-FORTH RDFSuite: Managing voluminous RDF description bases," in Proc. of the 2nd Intl Workshop on the Semantic Web (SemWeb), 2001, pp. 109-113.
16. E. Chong, S. Das, G. Eadon, and J. Srinivasan, "An efficient SQL-based RDF querying scheme," in Proc. of the 31th Intl Conf. on Very Large Data Bases (VLDB), 2005, pp. 1216-1227. (Pubitemid 43991091)
17. G. Gottlob, N. Leone, and F. Scarcello, "Hypertree decompositions and tractable queries," in In Proc. of the 18th Symp. on Principles of database systems (PODS), 1999, pp. 21-32.
18. H. Ṕerez-Urbina, B. Motik, and I. Horrocks, "Efficient query answering for OWL 2," in Proc. of the 8th Intl Semantic Web Conf. (ESWC), 2009, pp. 489-504.
19. R. Rosati and A. Almatelli, "Improving query answering over DL-Lite ontologies," in In Proc. of the 20th Intl Conf. on Principles of Knowledge Representation (KR), 2010.
20. A. K. Chandra and P. M. Merlin, "Optimal implementation of conjunctive queries in relational data bases," in Proc. of the 9th ACM Symp. on Theory of Computing (STOC), 1977, pp. 77-90.
21. A. Halevy, "Answering queries using views: A survey," The VLDB Journal, vol. 10, pp. 270-294, 2001. (Pubitemid 33570969)
22. A. Deutsch and V. Tannen, "Mars: A system for publishing XML from mixed and redundant storage," in In Proc. of the 29th Intl Conf. on Very large data bases (VLDB), 2003, pp. 201-212.
23. C. Beeri and M. Y. Vardi, "The implication problem for data dependencies," in Proc. of the 8th Colloquim on Automata, Languages and Programming (ICALP), 1981, pp. 73-85.
24. A. Cali, G. Gottlob, and M. Kifer, "Taming the infinite chase: Query answering under expressive relational constraints," in Proc. of the 11th Intl Joint Conf. on Principles of Knowledge Representation and Reasoning (KR), 2008, pp. 70-80.
25. A. Deutsch, A. Nash, and J. Remmel, "The chase revisited," in Proc. of the 27th Symp. on Principles of Database Systems (PODS), 2008, pp. 149-158.
26. D. Maier, A. O. Mendelzon, and Y. Sagiv, "Testing implications of data dependencies," ACM Trans. on Database Systems, vol. 4, no. 4, pp. 455-469, 1979.
27. D. S. Johnson and A. C. Klug, "Testing containment of conjunctive queries under functional and inclusion dependencies," Journal of Computer and System Sciences, vol. 28, no. 1, pp. 167-189, 1984. (Pubitemid 14569352)
28. R. Fagin, P. Kolaitis, R. Miller, and L. Popa, "Data exchange: Semantics and query answering," Theoretical Computer Science, vol. 336, no. 1, pp. 89-124, 2005. (Pubitemid 40612385)
29. B. Marnette, "Generalized schema-mappings: From termination to tractability," in In Proc. of the 28th Symp. on Principles of Database Systems (PODS), 2009, pp. 13-22.
30. A. Calì, G. Gottlob, and A. Pieris, "Tractable query answering over conceptual schemata," in Proc. of the 28th Intl Conf. on Conceptual Modeling (ER), 2009, pp. 175-190.
31. -, "Query answering under expressive Entity-Relationship schemata," in Proc. of the 29th Intl Conf. on Conceptual Modeling (ER), 2010, pp. 347-361.
32. A. K. Chandra and M. Y. Vardi, "The implication problem for functional and inclusion dependencies is undecidable," SIAM Journal of Computing, vol. 14, no. 3, pp. 671-677, 1985.
33. S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases. Addison-Wesley, 1995.
34. A. Cal, D. Lembo, and R. Rosati, "On the decidability and complexity of query answering over inconsistent and incomplete databases," in Proc. of the 22nd Symp. on Principles of Database Systems (PODS), 2003, pp. 260-271.