Comparing complex trees stored in database

In this paper we consider the problem of comparing complex trees stored in a database. We propose a two-step algorithm which compares two arbitrary trees and returns the difference. We employ the hash value for node comparison since the entities may not have the same properties, and the properties themselves may not be primitive (integer, boolean, etc.). We give a comparison in performance using recursive high-level implementation which uses OR-mapper, and our implementation.