very large ontologies

An efficient and scalable algorithm for segmented alignment of ontologies of arbitrary size

Authors: 
Seddiqui, Md. Hanif; Aono, Masaki
Year: 
2009

It has been a formidable task to achieve efficiency and scalability for the alignment between two massive, conceptually similar ontologies. Here we assume, an ontology is typically given in RDF (Resource Description Framework) or OWL (Web Ontology Language) and can be represented by a directed graph. A straightforward approach to the alignment of two ontologies entails an O(N2) computation by comparing every combination of pairs of nodes from given two ontologies, where N denotes the average number of nodes in each ontology.

Syndicate content