DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators

Details DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators

2003-08-02

arxiv.org/abs/cs/0308004v1

Computer Science

Databases

12 pages, 11 figures

Scientific paper

We present a new algorithm for fast record retrieval, distribute-probe-gather, or DPG. DPG has important applications both in sorting and in joins. Current main memory sorting algorithms split their work into three phases: extraction of key-pointer pairs; sorting of the key-pointer pairs; and copying of the original records into the destination array according the sorted key-pointer pairs. The copying in the last phase dominates today's sorting time. Hence, the use of DPG in the third phase provides an accelerator for existing sorting algorithms. DPG also provides two new join methods for foreign key joins: DPG-move join and DPG-sort join. The resulting join methods with DPG are faster because DPG join is cache-efficient and at the same time DPG join avoids the need for sorting or for hashing. The ideas presented for foreign key join can also be extended to faster record pair retrieval for spatial and temporal databases.

Affiliated with

Also associated with

No associations

Rating

DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-156309