? Approximate Continuous Top-<em>k</em> Query over Sliding Window
Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | FAQ
 
Indexed by   SCIE, EI ...
Bimonthly    Since 1986
Journal of Computer Science and Technology 2017, Vol. 32 Issue (1) :93-109    DOI: 10.1007/s11390-017-1708-0
Data Management and Data Mining Current Issue | Archive | Adv Search << Previous Articles | Next Articles >>
Approximate Continuous Top-k Query over Sliding Window
Rui Zhu, Member, CCF, ACM, Bin Wang*, Member, CCF, Shi-Ying Luo, Member, CCF, ACM, Xiao-Chun Yang, Senior Member, CCF, IEEE, Member, ACM, and Guo-Ren Wang, Member, CCF, ACM, IEEE
College of Computer Science and Engineering, Northeastern University, Shenyang 110819, China

Abstract
Reference
Related Articles
Download: [PDF 616KB]     Export: BibTeX or EndNote (RIS)  
Abstract Continuous top-k query over sliding window is a fundamental problem in database, which retrieves k objects with the highest scores when the window slides. Existing studies mainly adopt exact algorithms to tackle this type of queries, whose key idea is to maintain a subset of objects in the window, and try to retrieve answers from it. However, all the existing algorithms are sensitive to query parameters and data distribution. In addition, they suffer from expensive overhead for incremental maintenance, and thus cannot satisfy real-time requirement. In this paper, we define a novel query named (ε,δ)-approximate continuous top-k query, which returns approximate answers for top-k query. In order to efficiently support this query, we propose an efficient framework, named PABF (Probabilistic Approximate Based Framework), to support approximate top-k query over sliding window. We firstly maintain a self-adaptive pruning value, which could filter out newly arrived objects who have a probability less than 1-δ of being a query result. For those objects that are not filtered, we combine them together, if the score difference among them is less than a threshold. To efficiently maintain these combined results, the framework PABF also proposes a multi-phase merging algorithm. Theoretical analysis indicates that even in the worst case, we require only logarithmic complexity for maintaining each candidate.
Articles by authors
Rui Zhu
Bin Wang
Shi-Ying Luo
Xiao-Chun Yang
Guo-Ren Wang
Keywordscontinuous top-k query   approximate   sliding window     
Received 2016-02-29;
Fund:

This work is partially supported by the National Natural Science Fund for Distinguish Young Scholars of China under Grant No. 61322208, the National Basic Research 973 Program of China under Grant No. 2012CB316201, the National Natural Science Foundation of China under Grant Nos. 61272178 and 61572122, and the Key Program of the National Natural Science Foundation of China under Grant No. 61532021.

Corresponding Authors: Bin Wang     Email: binwang@mail.neu.edu.cn
About author: Rui Zhu received his M.S. degree in computer science from the Department of Computer Science, Northeastern University, Shenyang, in 2008. Currently, he is a Ph.D. candidate of Northeastern University, Shenyang. His research interests include design and analysis of algorithms, databases, data quality, and distributed systems.
Cite this article:   
Rui Zhu, Bin Wang, Shi-Ying Luo, Xiao-Chun Yang, Guo-Ren Wang.Approximate Continuous Top-k Query over Sliding Window[J]  Journal of Computer Science and Technology, 2017,V32(1): 93-109
URL:  
http://jcst.ict.ac.cn:8080/jcst/EN/10.1007/s11390-017-1708-0
Copyright 2010 by Journal of Computer Science and Technology