A Review of Answering Queries over Ontologies Based on Databases

A Review of Answering Queries over Ontologies Based on Databases

Fu Zhang (Northeastern University, China), Z. M. Ma (Northeastern University, China) and Haitao Cheng (Northeastern University, China)
DOI: 10.4018/978-1-4666-8767-7.ch018
OnDemand PDF Download:
List Price: $37.50


Ontologies, as a standard (W3C recommendation) for representing knowledge in the Semantic Web, have been employed in many application domains. Currently, real ontologies tend to become very large to huge. Thus, one problem is considered that has arisen from practical needs: namely, efficient querying of ontologies. To this end, there are today many proposals for answering queries over ontologies, and until now the literature on querying of ontologies has been flourishing. In particular, on the basis of the efficient and mature techniques of databases, which are useful for querying ontologies. To investigate querying of ontologies and more importantly identifying the direction of querying of ontologies based on databases, in this chapter, we aim at providing a brief review of answering queries over ontologies based on databases. Some query techniques, their classifications and the directions for future research, are introduced. Other query formalisms over ontologies that are not related to databases are not covered here.
Chapter Preview


The integration of databases and ontology-based systems became an important research problem for the Semantic Web and database communities. On one hand, the databases may be enriched by an ontological theory that enforces expressive constraints over the databases. Such constraints go far beyond traditional integrity constraints and can be used to enable complex reasoning tasks over the database instances (Gottlob, Orsi, & Pieris, 2011). On the other hand, the database research community has successfully developed a wide theory corpus and a mature and efficient technology to deal with large and persistent amounts of information. In this case, some mature database techniques (e.g., data management, maintenance, and query) may be employed to handle some issues of ontologies, such as storage and query of ontologies. To investigate these issues and more importantly serve as helping non-experts grasp the main ideas and results of querying ontologies with databases and identifying the direction of querying ontologies for the Semantic Web study, in this chapter, we aim at providing a review of answering queries over ontologies with databases.

In particular, one of the main tasks in databases and ontologies remains that of query answering. It is well-known that query is one of the things that make databases so powerful, and the related techniques of database queries have been investigated for many years. Also, querying is the fundamental mechanism for extracting information from a knowledge base. In the Semantic Web, the ontology layer is highly important, and has led to a vast corpus of literature. The ontology can provide a high-level conceptual view of the data repository, and specify implicit concepts and roles that extend the vocabulary of the database with terms that are relevant for specific applications (Ortiz & Simkus, 2012). When clients access the application ontology, the ontology can be exploited to access the data and to answer queries taking into account the knowledge that is implicit in the ontology. To this end, reasoning is of paramount importance when querying the implicit knowledge in the ontology. As we have known, description logics (DLs for short) (Baader, Calvanese, & McGuinness, 2003), as the logic foundation of the World Wide Web Consortium (W3C) recommendation Web Ontology Language (OWL), have a long tradition in knowledge representation and reasoning and play a central role in ontology reasoning. In these contexts, many works concerning query answering in ontologies refer in fact to DLs, which led to wide studies of answering queries over DL knowledge bases (KBs). Considering the different expressivity of the DLs and the trade-off between the expressivity of DLs and the complexity of their querying and reasoning problems, many query works focus on several different families of DLs, to name a few, the lightweight DLs of the DL-Lite (Calvanese et al., 2013, 2007) and ℰℒ (Baader, Brandt, & Lutz, 2005) families, and the families of expressive DLs (Ortiz, 2010). The references (Ortiz & Simkus, 2012) and (Ortiz, 2013) survey some query answering techniques for both lightweight and expressive DLs, and give an overview of the computational complexity landscape.

Key Terms in this Chapter

UCQs: The disjunctions of the conjunctive queries are known as Unions of Conjunctive Queries (UCQs) .

RDF: Resource Description Framework (RDF) is a framework for expressing information about resources AU43: Anchored Object 6 . Resources can be anything, including documents, people, physical objects, and abstract concepts.

Conjunctive Queries: The conjunctive queries are simply the fragment of (domain independent) first-order logic given by the set of formulae that can be constructed from atomic formulae using conjunction ? and existential quantification ?, but not using disjunction ?, negation ¬, or universal quantification ?.

Ontology: An ontology is a formal, explicit specification of a shared conceptualization.

DBMS: Database Management System.

SPARQL: Is an RDF query language, that is, a semantic query language for databases, able to retrieve and manipulate data stored in Resource Description Framework format.

SQL: Structured Query Language (SQL) is a query language used for accessing and modifying information in a database.

Description Logics: Is the most recent name for a family of knowledge representation (KR) formalisms that represent the knowledge of an application domain (the “world”) by first defining the relevant concepts of the domain (its terminology), and then using these concepts to specify properties of objects and individuals occurring in the domain (the world description).

Complete Chapter List

Search this Book: