IEICE TRANSACTIONS on Information
Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead
Summary :
In this paper, we propose a communication-efficient top-k continuous query processing method on distributed local nodes where data are horizontally partitioned. A designated coordinator server takes the role of issuing queries from users to local nodes and delivering the results to users. The final results are requested via a top-k subscription which lets local nodes know which data and updates need to be returned to users. Our proposed method makes use of the active previously posed queries to identify a small set of needed top-k subscriptions. In addition, with the pre-indexed nodes' skylines, the number of local nodes to be subscribed can be significantly reduced. As a result, only a small number of subscriptions are informed to a small number of local nodes resulting in lower communication overhead. Furthermore, according to dynamic data updates, we also propose a method that prevents nodes from reporting needless updates and also maintenance procedures to preserve the consistency. The results of experiments that measure the volume of transferred data show that our proposed method significantly outperforms the previously proposed methods.
- Publication
- IEICE TRANSACTIONS on Information Vol.E99-D No.2 pp.383-396
- Publication Date
- 2016/02/01
- Publicized
- 2015/11/11
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2015EDP7377
- Type of Manuscript
- PAPER
- Category
- Data Engineering, Web Information Systems
Authors
Kamalas UDOMLAMLERT
Osaka University
Takahiro HARA
Osaka University
Shojiro NISHIO
Osaka University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kamalas UDOMLAMLERT, Takahiro HARA, Shojiro NISHIO, "Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead" in IEICE TRANSACTIONS on Information,
vol. E99-D, no. 2, pp. 383-396, February 2016, doi: 10.1587/transinf.2015EDP7377.
Abstract: In this paper, we propose a communication-efficient top-k continuous query processing method on distributed local nodes where data are horizontally partitioned. A designated coordinator server takes the role of issuing queries from users to local nodes and delivering the results to users. The final results are requested via a top-k subscription which lets local nodes know which data and updates need to be returned to users. Our proposed method makes use of the active previously posed queries to identify a small set of needed top-k subscriptions. In addition, with the pre-indexed nodes' skylines, the number of local nodes to be subscribed can be significantly reduced. As a result, only a small number of subscriptions are informed to a small number of local nodes resulting in lower communication overhead. Furthermore, according to dynamic data updates, we also propose a method that prevents nodes from reporting needless updates and also maintenance procedures to preserve the consistency. The results of experiments that measure the volume of transferred data show that our proposed method significantly outperforms the previously proposed methods.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2015EDP7377/_p
Copy
@ARTICLE{e99-d_2_383,
author={Kamalas UDOMLAMLERT, Takahiro HARA, Shojiro NISHIO, },
journal={IEICE TRANSACTIONS on Information},
title={Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead},
year={2016},
volume={E99-D},
number={2},
pages={383-396},
abstract={In this paper, we propose a communication-efficient top-k continuous query processing method on distributed local nodes where data are horizontally partitioned. A designated coordinator server takes the role of issuing queries from users to local nodes and delivering the results to users. The final results are requested via a top-k subscription which lets local nodes know which data and updates need to be returned to users. Our proposed method makes use of the active previously posed queries to identify a small set of needed top-k subscriptions. In addition, with the pre-indexed nodes' skylines, the number of local nodes to be subscribed can be significantly reduced. As a result, only a small number of subscriptions are informed to a small number of local nodes resulting in lower communication overhead. Furthermore, according to dynamic data updates, we also propose a method that prevents nodes from reporting needless updates and also maintenance procedures to preserve the consistency. The results of experiments that measure the volume of transferred data show that our proposed method significantly outperforms the previously proposed methods.},
keywords={},
doi={10.1587/transinf.2015EDP7377},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead
T2 - IEICE TRANSACTIONS on Information
SP - 383
EP - 396
AU - Kamalas UDOMLAMLERT
AU - Takahiro HARA
AU - Shojiro NISHIO
PY - 2016
DO - 10.1587/transinf.2015EDP7377
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2016
AB - In this paper, we propose a communication-efficient top-k continuous query processing method on distributed local nodes where data are horizontally partitioned. A designated coordinator server takes the role of issuing queries from users to local nodes and delivering the results to users. The final results are requested via a top-k subscription which lets local nodes know which data and updates need to be returned to users. Our proposed method makes use of the active previously posed queries to identify a small set of needed top-k subscriptions. In addition, with the pre-indexed nodes' skylines, the number of local nodes to be subscribed can be significantly reduced. As a result, only a small number of subscriptions are informed to a small number of local nodes resulting in lower communication overhead. Furthermore, according to dynamic data updates, we also propose a method that prevents nodes from reporting needless updates and also maintenance procedures to preserve the consistency. The results of experiments that measure the volume of transferred data show that our proposed method significantly outperforms the previously proposed methods.
ER -
English
