Efficient Predicate Matching over Continuous Data Streams

Hyeon-Gyu KIM; Woo-Lam KANG; Yoon-Joon LEE; Myoung-Ho KIM

doi:10.1587/transinf.E92.D.1787

Efficient Predicate Matching over Continuous Data Streams

Hyeon-Gyu KIM, Woo-Lam KANG, Yoon-Joon LEE, Myoung-Ho KIM

Full Text Views

0

Cite this

Summary :

In this paper, we propose a predicate indexing method which handles equality and inequality tests separately. Our method uses a hash table for the equality test and a balanced binary search tree for the inequality test. Such a separate structure reduces a height of the search tree and the number of comparisons per tree node, as well as the cost for tree rebalancing. We compared our method with the IBS-tree which is one of the popular indexing methods suitable for data stream processing. Our experimental results show that the proposed method provides better insertion and search performances than the IBS-tree.

Publication: IEICE TRANSACTIONS on Information Vol.E92-D No.9 pp.1787-1790

Publication Date: 2009/09/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1587/transinf.E92.D.1787

Type of Manuscript: LETTER

Category: Database

Cite this

Copy

Hyeon-Gyu KIM, Woo-Lam KANG, Yoon-Joon LEE, Myoung-Ho KIM, "Efficient Predicate Matching over Continuous Data Streams" in IEICE TRANSACTIONS on Information, vol. E92-D, no. 9, pp. 1787-1790, September 2009, doi: 10.1587/transinf.E92.D.1787.
Abstract: In this paper, we propose a predicate indexing method which handles equality and inequality tests separately. Our method uses a hash table for the equality test and a balanced binary search tree for the inequality test. Such a separate structure reduces a height of the search tree and the number of comparisons per tree node, as well as the cost for tree rebalancing. We compared our method with the IBS-tree which is one of the popular indexing methods suitable for data stream processing. Our experimental results show that the proposed method provides better insertion and search performances than the IBS-tree.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.1787/_p

Copy

@ARTICLE{e92-d_9_1787,
author={Hyeon-Gyu KIM, Woo-Lam KANG, Yoon-Joon LEE, Myoung-Ho KIM, },
journal={IEICE TRANSACTIONS on Information},
title={Efficient Predicate Matching over Continuous Data Streams},
year={2009},
volume={E92-D},
number={9},
pages={1787-1790},
abstract={In this paper, we propose a predicate indexing method which handles equality and inequality tests separately. Our method uses a hash table for the equality test and a balanced binary search tree for the inequality test. Such a separate structure reduces a height of the search tree and the number of comparisons per tree node, as well as the cost for tree rebalancing. We compared our method with the IBS-tree which is one of the popular indexing methods suitable for data stream processing. Our experimental results show that the proposed method provides better insertion and search performances than the IBS-tree.},
keywords={},
doi={10.1587/transinf.E92.D.1787},
ISSN={1745-1361},
month={September},}

Copy

TY - JOUR
TI - Efficient Predicate Matching over Continuous Data Streams
T2 - IEICE TRANSACTIONS on Information
SP - 1787
EP - 1790
AU - Hyeon-Gyu KIM
AU - Woo-Lam KANG
AU - Yoon-Joon LEE
AU - Myoung-Ho KIM
PY - 2009
DO - 10.1587/transinf.E92.D.1787
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2009
AB - In this paper, we propose a predicate indexing method which handles equality and inequality tests separately. Our method uses a hash table for the equality test and a balanced binary search tree for the inequality test. Such a separate structure reduces a height of the search tree and the number of comparisons per tree node, as well as the cost for tree rebalancing. We compared our method with the IBS-tree which is one of the popular indexing methods suitable for data stream processing. Our experimental results show that the proposed method provides better insertion and search performances than the IBS-tree.
ER -