Quiané-Ruiz, Jorge Arnulfo
KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Online Publication Date2016-09-07
Print Publication Date2017-02
Permanent link to this recordhttp://hdl.handle.net/10754/622197
MetadataShow full item record
AbstractInequality joins, which is to join relations with inequality conditions, are used in various applications. Optimizing joins has been the subject of intensive research ranging from efficient join algorithms such as sort-merge join, to the use of efficient indices such as (Formula presented.)-tree, (Formula presented.)-tree and Bitmap. However, inequality joins have received little attention and queries containing such joins are notably very slow. In this paper, we introduce fast inequality join algorithms based on sorted arrays and space-efficient bit-arrays. We further introduce a simple method to estimate the selectivity of inequality joins which is then used to optimize multiple predicate queries and multi-way joins. Moreover, we study an incremental inequality join algorithm to handle scenarios where data keeps changing. We have implemented a centralized version of these algorithms on top of PostgreSQL, a distributed version on top of Spark SQL, and an existing data cleaning system, Nadeef. By comparing our algorithms against well-known optimization techniques for inequality joins, we show our solution is more scalable and several orders of magnitude faster. © 2016 Springer-Verlag Berlin Heidelberg
CitationKhayyat Z, Lucia W, Singh M, Ouzzani M, Papotti P, et al. (2016) Fast and scalable inequality joins. The VLDB Journal. Available: http://dx.doi.org/10.1007/s00778-016-0441-6.
SponsorsPortions of the research in this paper used the MDC Database made available by Idiap Research Institute, Switzerland and owned by Nokia.
JournalThe VLDB Journal