An interval join optimized for modern hardware

We develop an algorithm for efficiently joining relations on interval-based attributes with overlap predicates, which, for example, are commonly found in temporal databases. Using a new data structure and a lazy evaluation technique, we are able to achieve impressive performance gains by optimizing...

Full description

Saved in:
Bibliographic Details
Published in2016 IEEE 32nd International Conference on Data Engineering (ICDE) pp. 1098 - 1109
Main Authors Piatov, Danila, Helmer, Sven, Dignos, Anton
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2016
Subjects
Containers
Data structures
Hardware
Indexes
Partitioning algorithms
Spatial databases
Online AccessGet full text

Cover

More Information
Summary:We develop an algorithm for efficiently joining relations on interval-based attributes with overlap predicates, which, for example, are commonly found in temporal databases. Using a new data structure and a lazy evaluation technique, we are able to achieve impressive performance gains by optimizing memory accesses exploiting features of modern CPU architectures. In an experimental evaluation with real-world datasets our algorithm is able to outperform the state-of-the-art by an order of magnitude.
DOI:10.1109/ICDE.2016.7498316