PermJoin

An efficient algorithm for producing early results in multi-join query plans

Justin J. Levandoski, Mohamed E. Khalefa, Mohamed Mokbel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of a single join operator, PermJoin takes a radical step by addressing query plans with multiple join operators. PermJoin is optimized to maximize the early overall throughput and to adapt to fluctuations in data arrival rates. PermJoin is a non-blocking operator that is capable of producing join results even if one or more data sources are blocked due to slow or bursty network behavior. Furthermore, PermJoin distinguishes itself from all previous techniques as it: (1) employs a new flushing policy to write in-memory data to disk, once memory allotment is exhausted, in a way that helps increase the probability of producing early result throughput in multi-join queries, and (2) employs a novel state manager module that adaptively switches operators between joining in-memory data and disk-resident data in order to maximize overall throughput.

Original languageEnglish
Title of host publicationProceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08
Pages1433-1435
Number of pages3
DOIs
Publication statusPublished - 1 Oct 2008
Externally publishedYes
Event2008 IEEE 24th International Conference on Data Engineering, ICDE'08 - Cancun, Mexico
Duration: 7 Apr 200812 Apr 2008

Other

Other2008 IEEE 24th International Conference on Data Engineering, ICDE'08
CountryMexico
CityCancun
Period7/4/0812/4/08

Fingerprint

Throughput
Data storage equipment
Joining
Managers
Switches

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Levandoski, J. J., Khalefa, M. E., & Mokbel, M. (2008). PermJoin: An efficient algorithm for producing early results in multi-join query plans. In Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08 (pp. 1433-1435). [4497580] https://doi.org/10.1109/ICDE.2008.4497580

PermJoin : An efficient algorithm for producing early results in multi-join query plans. / Levandoski, Justin J.; Khalefa, Mohamed E.; Mokbel, Mohamed.

Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08. 2008. p. 1433-1435 4497580.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Levandoski, JJ, Khalefa, ME & Mokbel, M 2008, PermJoin: An efficient algorithm for producing early results in multi-join query plans. in Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08., 4497580, pp. 1433-1435, 2008 IEEE 24th International Conference on Data Engineering, ICDE'08, Cancun, Mexico, 7/4/08. https://doi.org/10.1109/ICDE.2008.4497580
Levandoski JJ, Khalefa ME, Mokbel M. PermJoin: An efficient algorithm for producing early results in multi-join query plans. In Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08. 2008. p. 1433-1435. 4497580 https://doi.org/10.1109/ICDE.2008.4497580
Levandoski, Justin J. ; Khalefa, Mohamed E. ; Mokbel, Mohamed. / PermJoin : An efficient algorithm for producing early results in multi-join query plans. Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08. 2008. pp. 1433-1435
@inproceedings{24747bd17e2c4807b70997a26fdf1032,
title = "PermJoin: An efficient algorithm for producing early results in multi-join query plans",
abstract = "This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of a single join operator, PermJoin takes a radical step by addressing query plans with multiple join operators. PermJoin is optimized to maximize the early overall throughput and to adapt to fluctuations in data arrival rates. PermJoin is a non-blocking operator that is capable of producing join results even if one or more data sources are blocked due to slow or bursty network behavior. Furthermore, PermJoin distinguishes itself from all previous techniques as it: (1) employs a new flushing policy to write in-memory data to disk, once memory allotment is exhausted, in a way that helps increase the probability of producing early result throughput in multi-join queries, and (2) employs a novel state manager module that adaptively switches operators between joining in-memory data and disk-resident data in order to maximize overall throughput.",
author = "Levandoski, {Justin J.} and Khalefa, {Mohamed E.} and Mohamed Mokbel",
year = "2008",
month = "10",
day = "1",
doi = "10.1109/ICDE.2008.4497580",
language = "English",
isbn = "9781424418374",
pages = "1433--1435",
booktitle = "Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08",

}

TY - GEN

T1 - PermJoin

T2 - An efficient algorithm for producing early results in multi-join query plans

AU - Levandoski, Justin J.

AU - Khalefa, Mohamed E.

AU - Mokbel, Mohamed

PY - 2008/10/1

Y1 - 2008/10/1

N2 - This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of a single join operator, PermJoin takes a radical step by addressing query plans with multiple join operators. PermJoin is optimized to maximize the early overall throughput and to adapt to fluctuations in data arrival rates. PermJoin is a non-blocking operator that is capable of producing join results even if one or more data sources are blocked due to slow or bursty network behavior. Furthermore, PermJoin distinguishes itself from all previous techniques as it: (1) employs a new flushing policy to write in-memory data to disk, once memory allotment is exhausted, in a way that helps increase the probability of producing early result throughput in multi-join queries, and (2) employs a novel state manager module that adaptively switches operators between joining in-memory data and disk-resident data in order to maximize overall throughput.

AB - This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of a single join operator, PermJoin takes a radical step by addressing query plans with multiple join operators. PermJoin is optimized to maximize the early overall throughput and to adapt to fluctuations in data arrival rates. PermJoin is a non-blocking operator that is capable of producing join results even if one or more data sources are blocked due to slow or bursty network behavior. Furthermore, PermJoin distinguishes itself from all previous techniques as it: (1) employs a new flushing policy to write in-memory data to disk, once memory allotment is exhausted, in a way that helps increase the probability of producing early result throughput in multi-join queries, and (2) employs a novel state manager module that adaptively switches operators between joining in-memory data and disk-resident data in order to maximize overall throughput.

UR - http://www.scopus.com/inward/record.url?scp=52649152956&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52649152956&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2008.4497580

DO - 10.1109/ICDE.2008.4497580

M3 - Conference contribution

SN - 9781424418374

SP - 1433

EP - 1435

BT - Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE'08

ER -