On efficiently finding reverse K-nearest neighbors over uncertain graphs

• المؤلفون الرئيسيون: GAO, Yunjun, MIAO, Xiaoye, CHEN, Gang, ZHENG, Baihua, CAI, Deng, CUI, Huiyong
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2017
• الموضوعات: uncertain graph; RkNN search; stratified sampling; querying processing; Databases and Information Systems
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/3708; https://ink.library.smu.edu.sg/context/sis_research/article/4710/viewcontent/101007_2Fs00778_017_0460_y.pdf
• المؤسسة: Singapore Management University

Reverse k-nearest neighbor (RkNN) query on graphs returns the data objects that take a specified query object q as one of their k-nearest neighbors. It has significant influence in many real-life applications including resource allocation and profile-based marketing. However, to the best of our know...