Name
Abstract | ||
|---|---|---|
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 this paper is that MESHJOIN is not very selective. In particular, the performance of the algorithm is always inversely proportional to the size of the master data table. As a consequence, the resource consumption is in some scenarios sub-optimal. We present an algorithm CACHEJOIN, which performs asymptotically at least as well as MESHJOIN but performs better in realistic scenarios, particularly if parts of the master data are used with different frequencies. In order to quantify the performance differences, we compare both algorithms using a synthetic data set with a known skewed distribution. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-32584-7_35 | DaWaK |
Keywords | DocType | Citations |
master data,limited resource consumption,scenarios sub-optimal,stream-based application,master data table,limited memory,algorithm cachejoin,performance difference,synthetic data,non-stream master data,resource consumption | Conference | 6 |
PageRank | References | Authors |
0.48 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Asif Naeem | 1 | 102 | 19.73 |
| Gill Dobbie | 2 | 728 | 77.75 |
| Gerald Weber | 3 | 44 | 5.13 |