Sciweavers

Share
VLDB
1998
ACM

Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships

9 years 11 months ago
Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships
Time of creation is one of the predominant (often implicit) clustering strategies found not only in Data Warehouse systems: line items are created together with their corresponding order, objects are created together with their subparts and so on. The newly created data is then appended to the existing data. We present a new join algorithm, called DiagJoin, which exploits time-of-creation clustering. If we are able to take advantage of timeof-creation clustering, then the performance evaluation reveals the superiority of Diag-Join over standard join algorithms like block-wise nested-loop join, GRACE hash join, and index nested-loop join. We also present an analytical cost model for Diag-Join.
Sven Helmer, Till Westmann, Guido Moerkotte
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1998
Where VLDB
Authors Sven Helmer, Till Westmann, Guido Moerkotte
Comments (0)
books