Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead-Reference-Cited by-同舟云学术

Threshold-Based Distributed Continuous Top-k Query Processing for Minimizing Communication Overhead

Published:2016 Issue:2 Volume:E99.D Page:383-396
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

UDOMLAMLERT Kamalas¹,HARA Takahiro¹,NISHIO Shojiro¹

Affiliation:

1. Graduate School of Information Science and Technology, Osaka University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

https://www.jstage.jst.go.jp/article/transinf/E99.D/2/E99.D_2015EDP7377/_pdf

Reference24 articles.

1. [1] V. Hristidis, N. Koudas, and Y. Papakonstantinou, “Prefer: A system for the efficient execution of multi-parametric ranked queries,” SIGMOD, pp.259-270, 2001.

2. [2] D. Xin, J. Han, H. Cheng, and X. Li, “Answering top-k queries with multi-dimensional selections: The ranking cube approach,” VLDB, pp.463-474, 2006.

3. [3] L. Zou and L. Chen, “Dominant graph: An efficient indexing structure to answer top-k queries,” ICDE, pp.536-545, 2008.

4. [4] L. Zou and L. Chen, “Pareto-based dominant graph: An efficient indexing structure to answer top-k queries,” IEEE Trans. Knowl. Data Eng., vol.23, no.5, pp.727-741, 2011.

5. [5] P. Cao and Z. Wang, “Efficient top-k query calculation in distributed networks,” PODC, pp.206-215, 2004.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scaling the monitoring of approximate top-k queries in streaming windows;2021 IEEE International Conference on Big Data (Big Data);2021-12-15