Datenschutzerklärung|Data Privacy

A. Borusan

10.09.2012, 16 Uhr c.t. TU Berlin, EN building, seminar room EN 719 (7th floor), Einsteinufer 17, 10587 Berlin: "Stream-based Joins with Limited Resource Consumption" (Muhammad Asif Naeem, School of Computing and Mathematical Sciences, Auckland University

Many stream-based applications have plenty of resources available to them, but there are also applications where resource consumption must be limited. For one important class of stream-based joins, where a stream is joined with a non-stream master data set, the algorithm called MESHJOIN was proposed. MESHJOIN uses limited memory and is a candidate for a resource-aware system setup. The problem that is considered in our research is that MESHJOIN is not very selective. In particular, MESHJOIN does not consider the typical characteristics like skew in stream data and therefore the performance of the algorithm is always inversely proportional to the size of the master data table. Consequently, the resource consumption is in some scenarios suboptimal. As a solution we propose a set of algorithms while each algorithm performs better than MESHJOIN in defined settings. For these algorithms cost models have been developed for tuning the algorithms and validation of our implementation. In order to quantify the performance differences, we compare our algorithms with MESHJOIN using a synthetic data set with a known skewed distribution.