Please use this identifier to cite or link to this item:

RPJ: Producing fast join results on streams through rate-based optimization

Authors Tao, Y.
Yiu, M.L.
Papadias, D. View this author's profile
Hadjieleftheriou, M.
Mamoulis, N. HKUST affiliated (currently or previously)
Issue Date 2005
Source Proceedings of the ACM SIGMOD International Conference on Management of Data , 2005, p. 371-382
Summary We consider the problem of "progressively" joining relations whose records are continuously retrieved from remote sources through an unstable network that may incur temporary failures. The objectives are to (i) start reporting the first output tuples as soon as possible (before the participating relations are completely received), and (ii) produce the remaining results at a fast rate. We develop a new algorithm RPJ (Rate-based Progressive Join) based on solid theoretical analysis. RPJ maximizes the output rate by optimizing its execution according to the characteristics of the join relations (e.g., data distribution, tuple arrival pattern, etc.). Extensive experiments prove that our technique delivers results significantly faster than the previous methods. Copyright 2005 ACM.
ISSN 0730-8078
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Scopus
Files in this item:
File Description Size Format
SIGMOD05RPJ.pdf 412506 B Adobe PDF