Continuous k-Regret Minimization Queries: A Dynamic Coreset Approach

被引:7
|
作者
Zheng, Jiping [1 ]
Ma, Wei [1 ]
Wang, Yanhao [2 ]
Wang, Xiaoyang [3 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing 210016, Jiangsu, Peoples R China
[2] East China Normal Univ, Sch Data Sci & Engn, Shanghai 200062, Peoples R China
[3] Zhejiang Gongshang Univ, Sch Comp Sci & Informat Engn, Hangzhou 310018, Zhejiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Continuous k-regret minimization query; dynamic coreset; d-net; e-kernel; nearest neighbor search; SKYLINE; ALGORITHM;
D O I
10.1109/TKDE.2022.3166835
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Finding a small set of representative tuples from a large database is an important functionality for supporting multi-criteria decision making. Top-k queries and skyline queries are two widely studied queries to fulfill this task. However, both of them have some limitations: a top-k query requires the user to provide her utility functions for finding the k tuples with the highest scores as the result; a skyline query does not need any user-specified utility function but cannot control the result size. To overcome their drawbacks, the k-regret minimization query was proposed and received much attention recently, since it does not require any user-specified utility function and returns a fixed-size result set. Specifically, it selects a set R of tuples with a pre-defined size r from a database D such that the maximum k-regret ratio, which captures how well the top-ranked tuple in R represents the top-k tuples in D for any possible utility function, is minimized. Although there have been many methods for k-regret minimization query processing, most of them are designed for static databases without tuple insertions and deletions. The only known algorithm to process continuous k-regret minimization queries (CkRMQ) in dynamic databases suffers from suboptimal approximation and high time complexity. In this paper, we propose a novel dynamic coreset-based approach, called DYNCORE, for CkRMQ processing. It achieves the same (asymptotically optimal) upper bound on the maximum k-regret ratio as the best-known static algorithm. Meanwhile, its time complexity is sublinear to the database size, which is significantly lower than that of the existing dynamic algorithm. The efficiency and effectiveness of DYNCORE is confirmed by experimental results on real-world and synthetic datasets.
引用
收藏
页码:5680 / 5694
页数:15
相关论文
共 50 条
  • [21] An efficient approach for continuous density queries
    Jie Wen
    Xiaofeng Meng
    Xing Hao
    Jianliang Xu
    Frontiers of Computer Science, 2012, 6 : 581 - 595
  • [22] An efficient approach for continuous density queries
    Wen, Jie
    Meng, Xiaofeng
    Hao, Xing
    Xu, Jianliang
    FRONTIERS OF COMPUTER SCIENCE, 2012, 6 (05) : 581 - 595
  • [23] Optimal Top-K Queries Processing: Sampling and Dynamic Scheduling Approach
    Saranya, L.
    2014 INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND INFORMATICS (ICCCI), 2014,
  • [24] Continuous Top-k Dominating Queries
    Kontaki, Maria
    Papadopoulos, Apostolos N.
    Manolopoulos, Yannis
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (05) : 840 - 853
  • [25] Online Learning with Continuous Variations Dynamic Regret and Reductions
    Cheng, Ching-An
    Lee, Jonathan
    Goldberg, Ken
    Boots, Byron
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 108, 2020, 108 : 2218 - 2227
  • [26] Robust and Fully-Dynamic Coreset for Continuous-and-Bounded Learning (With Outliers) Problems
    Wang, Zixiu
    Guo, Yiwen
    Ding, Hu
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [27] An Efficient Approach of Processing Multiple Continuous Queries
    Liu, Wen
    Shen, Yan-Ming
    Wang, Peng
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2016, 31 (06) : 1212 - 1227
  • [28] The CoQUOS Approach to Continuous Queries in Unstructured Overlays
    Ramaswamy, Lakshmish
    Chen, Jianxia
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2011, 23 (03) : 463 - 478
  • [29] An Efficient Approach of Processing Multiple Continuous Queries
    Wen Liu
    Yan-Ming Shen
    Peng Wang
    Journal of Computer Science and Technology, 2016, 31 : 1212 - 1227
  • [30] A distributed approach to continuous monitoring of constrained k-nearest neighbor queries in road networks
    Cho, Hyung-Ju
    Choe, Seung-Kwon
    Chung, Tae-Sun
    MOBILE INFORMATION SYSTEMS, 2012, 8 (02) : 107 - 126