Paper accepted at SIGMOD 2019

We are proud to anounce that our paper "Cache-oblivious High-performance Similarity Join" is accepted at the valuable SIGMOD conference.

We are proud to anounce that our paper "Cache-oblivious High-performance Similarity Join" by Martin Perdacher (University of Vienna), Claudia Plant (University of Vienna), and Christian Böhm (Ludwig-Maximilians-Universität) is accepted at the valuable SIGMOD conference (ranked A*). A similarity join combines vectors based on a distance condition. Modern multi-core processors are supported by a deep memory hierarchy including RAM, various levels of cache, and registers. The space-filling curve makes our proposed algorithm cache-oblivious to fully exploit this memory hierarchy.

Thanks to the ACM authorizer-service, the paper will be accessible without charge through our website. Check-out the code at our git-repository: https://gitlab.cs.univie.ac.at/martinp16cs/hilbertJoin