= Similarity Measure: Similarity Flooding =
Developer: [mailto:kiesel@dfki.uni-kl.de Malte Kiesel] [mailto:endres@dfki.uni-kl.de Björn Endres] [mailto:Lizhen.Qu@dfki.de Lizhen Qu] 

== Description ==
This is based on the algorithmus similarity flooding from Sergey Melnik,Hector Garcia-Molina and Erhard Rahm. The detailed description of the algorithmus can be found at [http://www-db.stanford.edu/~melnik/mm/sfa/]. Besides a implementation of the original algorithmus, [mailto:Lizhen.Qu@dfki.de Lizhen Qu] provides a optimized version to make it more efficient under huge onologies. 


== Specification ==
The 2 versions of similarity flooding are provided by 
=== original ===
=== optimized ===
The optimization is achieved by dividing the whole graph into several subgraphs.




=== Dependencies ===