The Community for Technology Leaders
Green Image
This paper describes an efficient Web page change detection system based on three optimizations that were implemented on top of the Hungarian algorithm, which we employ to compare trees that correspond to HTML Web pages. The optimizations attempt to stop the comparator algorithm that employs this O(n^{3}) algorithm before it completes all its iterations based on criteria having to do with properties of HTML and heuristics. Analysis and experimental results prove the effectiveness of these optimizations and their ability to render O(n^{2}) performance, where n denotes the number of nodes in the tree. A complete system was implemented and used to carry out the performance experiments. This system includes functionalities and interfaces for processing user requests, fetching Web pages from the Internet, allowing users to select zones in Web pages to monitor, and highlighting changes on the Web pages being monitored.
Web page, change detection, change monitoring, Hungarian algorithm, runtime optimization.

O. El-Rawas, I. Khoury, E. F. Mounayar, R. M. El-Mawas and H. Artail, "An Efficient Web Page Change Detection System Based on an Optimized Hungarian Algorithm," in IEEE Transactions on Knowledge & Data Engineering, vol. 19, no. , pp. 599-613, 2007.
94 ms
(Ver 3.3 (11022016))