A disk-based, adaptive approach to memory-limited computation of windowed stream joins
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
SIHJoin: querying remote and local linked data
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Providing timely results with an elastic parallel DW
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
| Hi-index | 0.00 |
Adaptive join algorithms have recently attracted alot of attention in emerging applications where data is provided by autonomous data sources through heterogeneous network environments. Their main advantage over traditional join techniques is that they can start producing join results as soon as the first input tuples are available, thus improving pipelining by smoothing join result production and by masking source or network delays. In this paper we propose Double Index NEsted loops Reactive join (DINER), a new adaptive join algorithm forresult rate maximization. DINER combines two key elements: an intuitive flushing policy that aims to increase the productivity of in-memory tuples in producing results during the online phase of the join, and a novel re-entrant join technique that allows the algorithm to rapidly switch between processing in-memory and disk-resident tuples, thus better exploiting temporary delayswhen new data is not available. Our experiments using realand synthetic data sets demonstrate that DINER outperformsprevious adaptive join algorithms in producing result tuples at a significantly higher rate, while making better use of the available memory.