2003/08/02 by Gene Cooperman, Xiaoqin Ma, Cooperman, Gene +3
Computer Science · #Algorithms and Data Compression #Data Structures and Algorithms (cs.DS) #Databases (cs.DB) #Distributed and Parallel Computing Systems #E.1 #E.2 #F.2.2 #FOS: Computer and information sciences #Parallel Computing and Optimization Techniques #cs.DB #cs.DS
paper · pdf · doi:10.48550/arxiv.cs/0308004
12 pages, 11 figures
arxiv created 2003/08/02 · openalex publication_date 2003/08/02 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.