Show simple item record

dc.contributor.authorHelmer, S
dc.contributor.authorWestmann, T
dc.contributor.authorMoerkotte, G
dc.contributor.editorGupta, A
dc.description.abstractTime 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 Diag-Join, which exploits time-of-creation clustering. The performance evaluation reveals its superiority over standard join algorithms like nested-loop join and GRACE hash join. We also present an analytical cost model for Diag-Join.en_US
dc.publisherMorgan Kaufmann Publishers Inc.en_US
dc.titleDiag-Join: An Opportunistic Join Algorithm for 1:N Relationshipsen_US
dc.typeBook chapteren_US
dc.publication.titleVLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record