LOMPT: An efficient and scalable ontology matching algorithm

Citations of this article
Mendeley users who have this article in their library.


Ontology matching is an effective way to handle semantic heterogeneity among the ontologies. An ontology matching system with good efficiency and scalability is a challenge because of the monolithic nature and size of real world domain ontologies. In this paper, an efficient and scalable ontology matching algorithm called LOMPT (Large Ontology Matching using Partitioning Technique) is proposed. LOMPT consist of structure-based bottom up partitioning algorithm which decomposes the large ontology into a set of small partitions. Then the partition pairs across the ontologies are discovered based on the anchor distribution, where anchor is indentified by the proposed light weight string matcher SI-SUB. Finally the linguistic matcher V-DOC and structural matcher GMO process the partition pairs to find match results from the partition pairs. The example and experimental results depicts the efficiency and scalability of the proposed LOMPT system. © 2012 Published by Elsevier Ltd.




Saraladha, K., Aghila, G., & Sathiya, B. (2012). LOMPT: An efficient and scalable ontology matching algorithm. In Procedia Engineering (Vol. 38, pp. 2272–2287). Elsevier Ltd. https://doi.org/10.1016/j.proeng.2012.06.274

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free