Name
Abstract | ||
|---|---|---|
Stream-based join algorithms got a prominent role in the field of real-time data warehouses. One particular type of stream-based joins is a semi-stream join where a single stream is joined with a disk -based relation. Normally the size of this disk-based relation is large enough and cannot be fit into memory, available for join operator. Therefore, the relation is loaded into memory in partitions. A well-known join algorithm called MESHJOIN Mesh Join has been presented in the literature to process semi-stream data. However, the algorithm has some limitations. In particular, MESHJOIN does not consider the characteristics of stream data and therefore does not perform well for skewed stream data. This article introduces the concept of caching and based on that presents a novel algorithm called Cached-based Stream-Relation Join CSRJ. The algorithm exploits skewed distributions more appropriately, and the authors present results for Zipfian distributions of the type that appear in many applications. They test their algorithm using synthetic, TPC-H and real datasets. Their experiments show that CSRJ forms significantly better than MESHJOIN. They also drive the cost model for their algorithm and based on that they tune the algorithm. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.4018/IJDWM.2016070102 | IJDWM |
Keywords | Field | DocType |
Performance Optimization, Real-Time Data Warehouses, Semi-Stream Join, Skewed Data | Data warehouse,Hash join,Data mining,Joins,Recursive join,Computer science,Cache,Parallel computing,Exploit,Sort-merge join,Operator (computer programming) | Journal |
Volume | Issue | ISSN |
12 | 3 | 1548-3924 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Asif Naeem | 1 | 102 | 19.73 |
| Imran Sarwar Bajwa | 2 | 87 | 22.31 |
| Noreen Jamil | 3 | 12 | 6.01 |