Advanced processing for ontological queries

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 554-565

  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

DATA DESCRIPTION; DATABASE SYSTEMS; FORMAL LANGUAGES; MODELING LANGUAGES; ONTOLOGY; QUERY LANGUAGES;

CONJUNCTIVE QUERIES; DATABASE CONSTRAINTS; FUNCTIONAL DEPENDENCY; INTEGRITY CONSTRAINTS; ONTOLOGICAL CONSTRAINTS; ONTOLOGICAL MODELING; ONTOLOGY-BASED DATA ACCESS; TUPLE-GENERATING DEPENDENCIES;

QUERY PROCESSING;

EID: 79957830183     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920912     Document Type: Article

References (30)

1. Data grid inc. http://dt123.com/DataGrid/DataGridWebsiteV1a/.
2. Oracle semantic technology center. http://www.oracle.com/technology/tech/semantictechnologies/.
3. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
4. A. Acciarri, D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, M. Palmieri, and R. Rosati. QuOnto: Querying ontologies. In Proc. of AAAI, 2005.
5. J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat. Extending decidable cases for rules with existential variables. In Proc. of IJCAI, 2009.
6. V. Barany, G. Gottlob, and M. Otto. Querying the guarded fragment. In Proc. of LICS, 2010.
7. C. Beeri and M. Y. Vardi. The implication problem for data dependencies. In Proc. of ICALP, 1981.
8. L. Cabibbo. The expressive power of stratified logic programs with value invention. Inf. Comput., 147(1), 1998.
9. A. Calì, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. of KR, 2008.
10. A. Calì, G. Gottlob, and T. Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. In Proc. of PODS, 2009.
11. A. Calì, G. Gottlob, and A. Pieris. Advanced processing for ontological queries. Unpublished manuscript. Available at: http://benner.dbai.tuwien.ac.at/staff/gottlob/CGP.pdf.
12. A. Calì, G. Gottlob, and A. Pieris. Tractable query answering over conceptual schemata. In Proc. of ER, 2009.
13. A. Calì, G. Gottlob, and A. Pieris. Query answering under non-guarded rules in datalog+/-. In Proc. of RR, 2010.
14. A. Calì, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proc. of PODS, 2003.
15. 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), 2007.
16. D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data complexity of query answering in description logics. In Proc. of KR, 2006.
17. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. of STOCS, 1977.
18. A. K. Chandra and M. Y. Vardi. The implication problem for functional and inclusion dependencies. SIAM Journal of Computing, 14, 1985.
19. E. Dantsin, T. Eiter, G. Georg, and A. Voronkov. Complexity and expressive power of logic programming. ACM Comput. Surv., 33(3), 2001.
20. A. Deutsch, A. Nash, and J. B. Remmel. The chase revisisted. In Proc. of PODS, 2008.
21. A. Deutsch and V. Tannen. Reformulation of XML queries and constraints. In Proc. of ICDT, 2003.
22. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1), 2005.
23. I. Horrocks. Using an expressive description logic: FaCT or fiction? In Proc. of KR, 1998.
24. D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1), 1984.
25. D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4), 1979.
26. D. Mailharrow. A classification and constraint-based framework for configuration. Artif. Intell. for Engineering Design, Analysis and Manufacturing, 12(4), 1998.
27. A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati. Linking data to ontologies. J. Data Semantics, 10, 2008.
28. R. Rosati. On the decidability and finite controllability of query processing in databases with incomplete information. In Proc. of PODS, 2006.
29. S. Rudolph, M. Krötzsch, and P. Hitzler. All elephants are bigger than all mice. In Description Logics, 2008.
30. M. Y. Vardi. On the complexity of bounded-variable queries. In Proc. of PODS, 1995.