Skip to Main Content
Nowadays XML have reached a great interest, because it is possible to share information through the Web. Moreover, the Web can be conceived as a huge Database. Therefore, like DBMS traditional, the Web needs efficient algorithms to detect changes on the Database. In this paper we present an efficient algorithm to detect change in XML documents. Algorithm efficiency resides in the efficient application of Hash function and how this information is used. The theoretical complexity of algorithm is O(nlogn+ eG), where n is the number of vertices and eG is the cost to check all edges. The proposed algorithm was compared with X-Diff algorithm in order to show the new algorithm performance. Experimental results show a much better performance of CDL algorithm.
Date of Conference: Nov. 30 2010-Dec. 2 2010