PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans

• Main Authors: Levandoski, J.J., Khalefa, M.E., Mokbel, M.F.
• Format: Conference Proceeding
• Language: English
• Subjects: Algorithm design and analysis; Computer science; Design optimization; Feedback; Fluctuations; Information retrieval; Intelligent sensors; Memory management; Switches; Throughput
• ISSN: 1063-6382; 2375-026X
• DOI: 10.1109/ICDE.2008.4497580

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.