Sciweavers

Share
ICDE
2009
IEEE

Double Index NEsted-Loop Reactive Join for Result Rate Optimization

12 years 1 months ago
Double Index NEsted-Loop Reactive Join for Result Rate Optimization
Adaptive join algorithms have recently attracted a lot 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 for result 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 inmemory and disk-resident tuples, thus better exploiting temporary delays when new data is not available. Our experiments using real and syntheti...
Mihaela A. Bornea, Vasilis Vassalos, Yannis Kotidi
Added 20 Oct 2009
Updated 20 Oct 2009
Type Conference
Year 2009
Where ICDE
Authors Mihaela A. Bornea, Vasilis Vassalos, Yannis Kotidis, Antonios Deligiannakis
Comments (0)
books