Syntactic Modular Decomposition of Large Ontologies with Relational Database

نویسنده

  • Pawel Kaplanski
چکیده

Support for modularity allows complex ontologies to be separated into smaller pieces (modules) that are easier to maintain and compute. Instead of considering the entire complex ontology, users may bene t more by starting from a problem-speci c set of concepts (signature of problem) from the ontology and exploring its surrounding logical modules. Additionally, an ontology modularization mechanism allows for the splitting up of ontologies into modules that can be processed by isolated separate instances of the inference engine. The relational algorithm, described in this paper, makes it possible to construct an inference engine that can run in a highly scalable cloud computing environment, or on a computer grid.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A normal form for hypergraph-based module extraction for SROIQ

Modularization is an important part of the modular design and maintenance of large scale ontologies. Syntactic locality modules, with their desirable model theoretic properties, play an ever increasing role in the design of algorithms for modularization, partitioning and reasoning tasks such as classification. It has been shown that, for the DL EL, the syntactic locality module extraction probl...

متن کامل

Enhancing Keyword Search over Relational Databases Using Ontologies

Keyword Search Over Relational Databases (KSORDB) provides an easy way for casual users to access relational databases using a set of keywords. Although much research has been done and several prototypes have been developed recently, most of this research implements exact (also called syntactic or keyword) match. So, if there is a vocabulary mismatch, the user cannot get an answer although the ...

متن کامل

A Systematic Method for Query Evaluation in Federated Relational Databases

In this paper, a systematic method for evaluating queries issued to an federated relational database system is presented. The method consists of four phases: syntactic analysis, query decomposition, query translation and result synthesis, which all can be done automatically based on the metadata built in the system, even if the structure conflicts among the local databases exist.

متن کامل

Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML

As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...

متن کامل

DeMoSt: a Tool for Exploring the Decomposition and the Modular Structure of OWL Ontologies

Motivation In relevant application fields ontologies are often maintained as huge monolithic collections of axioms in single files, as for some ontologies in the NCBO BioPortal repository4, like the Gene Ontology (∼ 60, 000 axioms). Such representation is not ideal for applications which only require access limited to individual fragments of the ontology. As an example, the reasoning service pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009