The aggregative closure, a transitive closure with aggregations on the transitive path, is formally defined using database terms. Of the various algorithms for the aggregative closure, we compare the 3 iterative algorithms, naive, semi-naive, logarith...
The aggregative closure, a transitive closure with aggregations on the transitive path, is formally defined using database terms. Of the various algorithms for the aggregative closure, we compare the 3 iterative algorithms, naive, semi-naive, logarithmic algorithm by using 4GL database query language. By the simulation, it is shown that logarithmic algorithm outperforms than other algorithms especially with the problems the aggregative closure operators are not absorptive.