Efficiently Producing the K Nearest Neighbors in the Skyline on Vertically Partitioned Tables

被引:0
|
作者
Goncalves, Marlene [1 ]
Vidal, Maria-Esther [1 ]
机构
[1] Univ Simon Bolivar, Dept Computac & Tecnol Informac, Caracas, Venezuela
关键词
K Nearest Neighbors; Multi-Dimensional Points; Skyline XE "Skyline; Top-k; Vertically Partitioned Table (VPT);
D O I
10.4018/ijirr.2013040104
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Criteria that induce a Skyline naturally represent user's preference conditions useful to discard irrelevant data in large datasets. However, in the presence of high-dimensional Skyline spaces, the size of the Skyline can still be very large, making unfeasible for users to process this set of points. To identify the best points among the Skyline, the Top-k Skyline approach has been proposed. Top-k Skyline uses discriminatory criteria to induce a total order of the points that comprise the Skyline, and recognizes the best or top-k points based on these criteria. In this article the authors model queries as multi-dimensional points that represent bounds of VPT (Vertically Partitioned Table) property values, and datasets as sets of multi-dimensional points; the problem is to locate the k best tuples in the dataset whose distance to the query is minimized. A tuple is among the k best tuples whenever there is not another tuple that is better in all dimensions, and that is closer to the query point, i.e., the k best tuples correspond to the k nearest points to the query that are incomparable or belong to the skyline. The authors name these tuples the k nearest neighbors in the skyline. The authors propose a hybrid approach that combines Skyline and Top-k solutions and develop two algorithms: TKSI and k-NNSkyline. The proposed algorithms identify among the skyline tuples, the k ones with the lowest values of the distance metric, i.e., the k nearest neighbors to the multi-dimensional query that are incomparable. Empirically, we study the performance and quality of TKSI and k-NNSkyline. The authors' experimental results show the TKSI is able to speed up the computation of the Top-k Skyline in at least 50% percent with respect to the state-of-the-art solutions, whenever k is smaller than the size of the Skyline. Additionally, the authors' results suggest that k-NNSkyline outperforms existing solutions by up to three orders of magnitude.
引用
收藏
页码:58 / 77
页数:20
相关论文
共 50 条
  • [1] Efficiently processing snapshot and continuous reverse k nearest neighbors queries
    Cheema, Muhammad Aamir
    Zhang, Wenjie
    Lin, Xuemin
    Zhang, Ying
    VLDB JOURNAL, 2012, 21 (05): : 703 - 728
  • [2] On Efficiently Monitoring Continuous Aggregate k Nearest Neighbors in Road Networks
    Miao, Xiaoye
    Gao, Yunjun
    Mai, Guanhua
    Chen, Gang
    Li, Qing
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2020, 19 (07) : 1664 - 1676
  • [3] Efficiently processing snapshot and continuous reverse k nearest neighbors queries
    Muhammad Aamir Cheema
    Wenjie Zhang
    Xuemin Lin
    Ying Zhang
    The VLDB Journal, 2012, 21 : 703 - 728
  • [4] Influence Zone: Efficiently Processing Reverse k Nearest Neighbors Queries
    Cheema, Muhammad Aamir
    Lin, Xuemin
    Zhang, Wenjie
    Zhang, Ying
    IEEE 27TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2011), 2011, : 577 - 588
  • [5] Efficiently Monitoring Reverse k-Nearest Neighbors in Spatial Networks
    Wang, Shenlu
    Cheema, Muhammad Aamir
    Lin, Xuemin
    COMPUTER JOURNAL, 2015, 58 (01): : 40 - 56
  • [6] Building K-nearest neighbor classifiers on vertically partitioned private data
    Zhan, J
    Chang, LW
    2005 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, VOLS 1 AND 2, 2005, : 708 - 711
  • [7] On efficiently finding reverse k-nearest neighbors over uncertain graphs
    Yunjun Gao
    Xiaoye Miao
    Gang Chen
    Baihua Zheng
    Deng Cai
    Huiyong Cui
    The VLDB Journal, 2017, 26 : 467 - 492
  • [8] MGR: Efficiently Processing Maximal Group Reverse k Nearest Neighbors Queries
    Meng, Xin
    Ma, Guojie
    Yang, Shiyu
    Wang, Liping
    IEEE ACCESS, 2022, 10 : 78576 - 78587
  • [9] On efficiently finding reverse k-nearest neighbors over uncertain graphs
    Gao, Yunjun
    Miao, Xiaoye
    Chen, Gang
    Zheng, Baihua
    Cai, Deng
    Cui, Huiyong
    VLDB JOURNAL, 2017, 26 (04): : 467 - 492
  • [10] Efficiently monitoring nearest neighbors to a moving object
    Jin, Cheqing
    Guo, Weibin
    ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2007, 4632 : 239 - +