International Journal of Scientific & Technology Research

Home About Us Scope Editorial Board Blog/Latest News Contact Us
10th percentile
Powered by  Scopus
Scopus coverage:
Nov 2018 to May 2020


IJSTR >> Volume 7 - Issue 3, March 2018 Edition

International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616

Utilization Of Query Rewriting Over Ontology Change: A Review

[Full Text]



Helna Wardhana, Yohanes Suyanto, Sigit Priyanta



query rewriting, query answering, conjunctive query, ontology, ontology change, description logics



There are two approaches to view-based query processing, called query rewriting and query answering. Query rewriting is one of the most important reasoning techniques for answering queries on data represented utilizing ontologies or ontology-based data access applications. The last years a wide variety of query rewriting systems has been proposed, including the research about ontology change. In this paper, we present the discussion of the utilization of query rewriting on ontology change. We divide the use of query rewriting in this paper into 3 parts i.e. proposing a new algorithm, research development in Description Logics (DL) family and complexity of conjunctive query. Furthermore, we also present a brief description of the advantages and disadvantages of using query rewriting algorithm only on 3 types of ontology, ontology contraction, ontology evolution and ontology change. Finally, we show the list of query rewriting algorithm publication based on their approaches.



[1] D. Calvanese, G. De Giacomo, M. Lenzerini, and V. M.Y., What is QueryRewriting? 2000.

[2] M. Imprialou, G. Stoilos, and B. C. Grau, “Benchmarking Ontology-based Query Rewriting Systems,” Twenty-Sixth AAAI Conf. Artif. Intell., pp. 779–785, 2012.

[3] B. T. Gruber, “What is an Ontology ?,” pp. 1–11, 1993.

[4] B. Chandrasekaran, J. R. Josephson, and V. R. Benjamins, “What Are Ontologies , and Why Do We Need Them ?,” 1999.

[5] A. M. Khattak, R. Batool, Z. Pervez, A. M. Khan, and S. Lee, “Ontology evolution and challenges,” J. Inf. Sci. Eng., vol. 29, no. 5, pp. 851–871, 2013.

[6] S. Editors, P. Bernus, and M. J. Shaw, International Handbooks on Information Systems. 2007.

[7] S. Bloehdorn, P. Haase, Y. Sure, and J. Voelker, “Ontology Evolution,” Semant. Web Technol. Trends Res. Ontol. Syst., pp. 51–70, 2006.

[8] N. F. Noy and D. L. McGuinness, “Ontology Development 101: A Guide to Creating Your First Ontology,” Stanford Knowl. Syst. Lab., p. 25, 2001.

[9] G. Flouris, D. Manakanatas, H. Kondylakis, D. Plexousakis, and G. Antoniou, “Ontology change: classification and survey,” Knowl. Eng. Rev., vol. 23, no. 2, pp. 117–152, 2008.

[10] L. Stojanovic and B. Motik, “Ontology evolution within ontology editors,” EKAW02 Work. Eval. Ontol. Tools, pp. 53–62, 2002.

[11] U. Sattler, “Description Logics for Ontologies,” pp. 1–21, 2003.

[12] A. Armando and P. Baumgartner, The Complexity of Conjunctive Query Answering in Expressive Description Logics. 2008.

[13] G. Gottlob, G. Orsi, A. Pieris, and Q. Finance, “Ontological Queries : Rewriting and Optimization,” Proc. - Int. Conf. Data Eng., pp. 2–13, 2011.

[14] H. Pérez-Urbina, B. Motik, and I. Horrocks, “Tractable Query Answering and Rewriting under Description Logic Constraints,” J. Appl. Log., vol. 8, no. 2, pp. 186–209, 2010.

[15] E. Tsalapati, G. Stoilos, A. Chortaras, G. Stamou, and G. Koletsos, “Query rewriting under ontology change,” Comput. J., vol. 60, no. 3, pp. 389–409, 2016.

[16] E. Tsalapati, G. Stoilos, G. Stamou, and G. Koletsos, “Query Rewriting Under Ontology Evolution,” 2013.

[17] E. Tsalapati, G. Stoilos, G. Stamou, and G. Koletsos, “Query Rewriting Under Ontology Contraction,” 2012.

[18] A. Chortaras, D. Trivela, and G. Stamou, “Optimized query rewriting for OWL 2 QL,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 6803 LNAI, pp. 192–206, 2011.

[19] T. Venetis, G. Stoilos, and G. Stamou, “Incremental Query Rewriting for OWL 2 QL,” 2012.

[20] I. Horrocks, B. Motik, H. Perez-Urbina, I. Horrocks, and B. Motik, “Efficient Query Answering for OWL 2,” Iswc’09, pp. 489–504, 2009.

[21] G. Orsi, A. Pieris, and A. P. Giorgio Orsi, “Optimizing Query Answering under Ontological Constraints,” Pvldb, vol. 4, no. 11, pp. 1004–1015, 2011.

[22] A. Bundy, “First Steps in EL Contraction,” Autom. Reason. about Context Ontol. Evol., 2009.

[23] B. C. Grau, E. Kharlamov, and D. Zheleznyakov, “Ontology Contraction : Beyond the Propositional Paradise,” 2012.

[24] D. Calvanese et al., “Tractable Reasoning and Efficient Query Answering in Description Logics : The DL-Lite Family,” J. Autom. Reason., vol. 39, no. 3, pp. 385–429, 2007.

[25] R. Rosati and A. Almatelli, “Improving Query Answering over DL-Lite Ontologies,” Kr, vol. 10, no. Kr, pp. 51--53, 2010.

[26] M. M. Ribeiro, R. Wassermann, G. Antoniou, G. Flouris, and J. Pan, “Belief contraction in web-ontology languages,” CEUR Workshop Proc., vol. 519, no. August, 2009.

[27] J. F. Baget, M. Leclère, M. L. Mugnier, and E. Salvat, “On rules with existential variables: Walking the decidability line,” Artif. Intell., vol. 175, no. 9–10, pp. 1620–1654, 2011.

[28] A. Cal et al., “Datalog + / - : A Family of Logical Knowledge Representation and Query Languages for New Applications Keynote Lecture,” Proc. - Symp. Log. Comput. Sci., pp. 228–242, 2010.

[29] H. Kondylakis and D. Plexousakis, “Ontology Evolution without Tears,” J. Web Semant., vol. 19, pp. 42–58, 2013.

[30] M. Sipser, “Introduction to the Theory of Computation,” 2013.

[31] D. Calvanese et al., “The MASTRO system for ontology-based data access,” Semant. Web, vol. 2, no. 1, pp. 43–53, 2011.

[32] M. Rodrıguez-Muro and D. Calvanese, “High Performance Query Answering over DL-Lite Ontologies,” Proc. Thirteen. Int. Conf. Princ. Knowl. Represent. Reason., pp. 308–318, 2012.

[33] T.-K. T. and G. X. Thomas Eiter, Magdalena Ortiz, Mantas Simkus, “Query Rewriting for Horn-SHIQ plus Rules.pdf.” 2012.

[34] G. K. and E. S. Hector Perez-Urbina, Edgar Rodriguez-Diaz, Michael Grove, “Evaluation of Query Rewriting Approaches for OWL 2.pdf.” 2012.

[35] M. T. Melanie Konig, Michel Leclere, Marie-Laure Mugnier, “A Sound and Complete Backward Chaining Algorithm for Existential Rules.pdf.” 2012.

[36] M. Rodríguez-Muro, R. Kontchakov, and M. Zakharyaschev, “Ontology-based data access: Ontop of databases,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 8218 LNCS, no. PART 1, pp. 558–573, 2013.

[37] J. Mora and O. Corcho, “Towards a systematic benchmarking of ontology-based query rewriting systems,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 8219 LNCS, no. PART 2, pp. 376–391, 2013.

[38] T. Venetis, G. Stoilos, and G. Stamou, “Query Rewriting Under Query Extensions for OWL 2 QL Ontologies,” J. Data Semant., vol. 3, pp. 1--23, 2014.

[39] D. Trivela, G. Stoilos, A. Chortaras, and G. Stamou, “Query Rewriting in Horn- SHIQ ( Extended Abstract ),” pp. 5–8, 2015.