Leveraging range joins for the computation of overlap joins

• Published in: The VLDB journal Vol. 31; no. 1; pp. 75 - 99
• Main Authors: Dignös, Anton, Böhlen, Michael H., Gamper, Johann, Jensen, Christian S., Moser, Peter
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 2022; Springer Nature B.V
• Subjects: Computer Science; Data base management systems; Database Management; Empirical analysis; Indexing; Proposals; Regular Paper; Range join; Interval join; Temporal databases; Temporal join; Overlap join
• ISSN: 1066-8888; 0949-877X
• DOI: 10.1007/s00778-021-00692-3

Joins are essential and potentially expensive operations in database management systems. When data is associated with time periods, joins commonly include predicates that require pairs of argument tuples to overlap in order to qualify for the result. Our goal is to enable built-in systems support for such joins. In particular, we present an approach where overlap joins are formulated as unions of range joins, which are more general purpose joins compared to overlap joins, i.e., are useful in their own right, and are supported well by B+-trees. The approach is sufficiently flexible that it also supports joins with additional equality predicates, as well as open, closed, and half-open time periods over discrete and continuous domains, thus offering both generality and simplicity, which is important in a system setting. We provide both a stand-alone solution that performs on par with the state-of-the-art and a DBMS embedded solution that is able to exploit standard indexing and clearly outperforms existing DBMS solutions that depend on specialized indexing techniques. We offer both analytical and empirical evaluations of the proposals. The empirical study includes comparisons with pertinent existing proposals and offers detailed insight into the performance characteristics of the proposals.