Show simple item record

dc.contributor.authorKhayyat, Zuhair
dc.contributor.authorLucia, William
dc.contributor.authorSingh, Meghna
dc.contributor.authorOuzzani, Mourad
dc.contributor.authorPapotti, Paolo
dc.contributor.authorQuiané-Ruiz, Jorge-Arnulfo
dc.contributor.authorTang, Nan
dc.contributor.authorKalnis, Panos
dc.date.accessioned2016-01-10T10:24:55Z
dc.date.available2016-01-10T10:24:55Z
dc.date.issued2015-09-01
dc.identifier.citationKhayyat, Z., Lucia, W., Singh, M., Ouzzani, M., Papotti, P., Quiané-Ruiz, J.-A., … Kalnis, P. (2015). Lightning fast and space efficient inequality joins. Proceedings of the VLDB Endowment, 8(13), 2074–2085. doi:10.14778/2831360.2831362
dc.identifier.issnLightning fast and space efficient inequality joins 2015, 8 (13):2074 Proceedings of the VLDB Endowment
dc.identifier.issn21508097
dc.identifier.doi10.14778/2831360.2831362
dc.identifier.doi10.14778/3099622.3099629
dc.identifier.urihttp://hdl.handle.net/10754/593180
dc.description.abstractInequality joins, which join relational tables on inequality conditions, are used in various applications. While there have been a wide range of optimization methods for joins in database systems, from algorithms such as sort-merge join and band join, to various indices such as B+-tree, R*-tree and Bitmap, inequality joins have received little attention and queries containing such joins are usually very slow. In this paper, we introduce fast inequality join algorithms. We put columns to be joined in sorted arrays and we use permutation arrays to encode positions of tuples in one sorted array w.r.t. the other sorted array. In contrast to sort-merge join, we use space efficient bit-arrays that enable optimizations, such as Bloom filter indices, for fast computation of the join results. We have implemented a centralized version of these algorithms on top of PostgreSQL, and a distributed version on top of Spark SQL. We have compared against well known optimization techniques for inequality joins and show that our solution is more scalable and several orders of magnitude faster.
dc.publisherVLDB Endowment
dc.relation.urlhttp://dl.acm.org/citation.cfm?doid=2831360.2831362
dc.rightsThis work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-nd/3.0/. Obtain permission prior to any use beyond those covered by the license.
dc.titleLightning fast and space efficient inequality joins
dc.typeConference Paper
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.identifier.journalProceedings of the VLDB Endowment
dc.conference.dateSeptember 5–9, 2015
dc.conference.nameProceedings of the VLDB Endowment - Proceedings of the 41st International Conference on Very Large Data Bases
dc.conference.locationKohala Coast, Hawaii
dc.eprint.versionPublisher's Version/PDF
dc.contributor.institutionQatar Computing Research Institute
kaust.personKhayyat, Zuhair
kaust.personKalnis, Panos
refterms.dateFOA2018-06-13T13:21:50Z


Files in this item

Thumbnail
Name:
p2074-khayyat.pdf
Size:
573.7Kb
Format:
PDF
Description:
Main article
Thumbnail
Name:
3099622.3099629.pdf
Size:
166.1Kb
Format:
PDF
Description:
Correction - May 2017

This item appears in the following Collection(s)

Show simple item record