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

Helmer, Sven ; Westmann, Till ; Moerkotte, Guido

TR-97-006.pdf - Published

Download (311kB)

URL: http://ub-madoc.bib.uni-mannheim.de/788
URN: urn:nbn:de:bsz:180-madoc-7880
Document Type: Working paper
Year of publication: 1997
The title of a journal, publication series: None
Publication language: English
Institution: School of Business Informatics and Mathematics > Sonstige - Fakultät für Wirtschaftsinformatik und Wirtschaftsmathematik
MADOC publication series: Veröffentlichungen der Fakultät für Mathematik und Informatik > Institut für Informatik > Technical Reports
Subject: 004 Computer science, internet
Subject headings (SWD): Join-Operation , Data-Warehouse-Konzept
Keywords (English): join algorithm , Data-Warehousing
Abstract: 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 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.
Additional information:

Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.

Metadata export


+ Search Authors in

+ Download Statistics

Downloads per month over past year

View more statistics

You have found an error? Please let us know about your desired correction here: E-Mail

Actions (login required)

Show item Show item