The algorithm of the join data stream with diskresident relation

Current data integration approaches are moving towards real-time updates. One important element in real-time data integration is the join of a continuous incoming data stream with a disk-resident relation. Because data stream is infinite, it is impossible to adopt blocking join algorithms such as sort-merge and hash join. The novel algorithm MESHJOIN has been proposed for joining a continuous stream with a disk-resident relation. The crux of MESHJOIN algorithm is that the whole memory block of disk-based relation is replaced at each iteration. We propose that the memory block is divided into a number of logical partitions, and then only one logical partition of memory block is replaced at each iteration. The experimental results show that the service rate of the join is increased because I/O cost for one loop iteration is decreased.