A novel ontology relation graph-based ontology module partition algorithm

In order to help Agent or semantic annotation tool in real-time understanding of the text, this paper presents an ontology module partition method: partitioning large broad-coverage ontologism into small ontology modules and storing the partition in advance, in the stage of real-time, according to the application requirements, selecting the appropriate modular from the ontology modular library, then applying directly or composing the selected modules. This time-consuming procedure of ontology extraction and decomposition is put into pre-processing process, which can improve real-time process and improve the efficiency. In this paper, ontology module partition criteria and methods are discussed. The method discussed in this article can partition corresponding ontology in different level of granularities. The ontology relation graph-based ontology module partition algorithm employed extended adjacency list as the storage structure in which the asymptotic time complexity of extended broad first traverse of ontology relation graph is O(n+e).