Experimental Results

• PipeSort and PipeHash are two to eight times faster than the naive methods.
• The performance fo PipeHash is very close to lower bounds for hash based algorithms.
• The performance fo PipeSort is very close to lower bounds for sort based algorithms.
• From experimental results, PipeHash seems to be inferior to PipeSort Algorithm.
• The Overlap algorithm is compared to Independent and Parent algorithms. This comparison was done for different data distribution. The experiments were done to show the scale up of the algorithm. On different data distributions, the Overlap method with different sort order for root cuboid, did very well compared to other two algorithms, as expected.