AMJoin: An advanced join algorithm for multiple data streams using a bit-vector hash table

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

A multiple stream join is one of the most important but high cost operations in ubiquitous streaming services. In this paper, we propose a newly improved and practical algorithm for joining multiple streams called AMJoin, which improves the multiple join performance by guaranteeing the detection of join failures in constant time. To achieve this goal, we first design a new data structure called BiHT (Bit-vector Hash Table) and present the overall behavior of AMJoin in detail. In addition, we show various experimental results and their analyses for clarifying its efficiency and practicability. Copyright © 2009 The Institute of Electronics, Information and Communication Engineers.

Cite

CITATION STYLE

APA

Kwon, T. H., Kim, H. G., Kim, M. H., & Son, J. H. (2009). AMJoin: An advanced join algorithm for multiple data streams using a bit-vector hash table. IEICE Transactions on Information and Systems, E92-D(7), 1429–1434. https://doi.org/10.1587/transinf.E92.D.1429

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free