A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
MJoin
2003
Proceedings of the 2nd international workshop on Distributed event-based systems - DEBS '03
Join algorithms must be re-designed when processing stream data instead of persistently stored data. Data streams are potentially infinite and the query result is expected to be generated incrementally instead of once only. Data arrival patterns are often unpredictable and the statistics of the data and other relevant metadata often are only known at runtime. In some cases they are supplied interleaved with the actual data in the form of stream markers. Recently, stream join algorithms, like
doi:10.1145/966618.966639
dblp:conf/debs/DingRH03
fatcat:3n5wtifiszbibknldkuszxlfom