[1]万静,唐贝贝,孙健,等.障碍空间中不确定对象的组k最近邻查询方法[J].哈尔滨理工大学学报,2019,(03):29-34.[doi:10.15938/j.jhust.2019.03.005]
 WAN Jing,TANG Bei bei,SUN Jian,et al. Group k Nearest Neighbor Query Method for Uncertainty Data in Obstructed Spaces[J].哈尔滨理工大学学报,2019,(03):29-34.[doi:10.15938/j.jhust.2019.03.005]
点击复制

障碍空间中不确定对象的组k最近邻查询方法()
分享到:

《哈尔滨理工大学学报》[ISSN:1007-2683/CN:23-1404/N]

卷:
期数:
2019年03期
页码:
29-34
栏目:
计算机与控制工程
出版日期:
2019-06-24

文章信息/Info

Title:
 Group   k  Nearest Neighbor Query Method for Uncertainty Data in Obstructed Spaces
文章编号:
1007-2683(2019)03-0029-06
作者:
 万静唐贝贝孙健何云斌李松
 (哈尔滨理工大学 计算机科学与技术学院,黑龙江 哈尔滨 150080)
Author(s):
 WAN JingTANG BeibeiSUN JianHE YunbinLI Song
 (School of Computer Science and Technology,Harbin University of Science and Technology,Harbin 150080,China)
关键词:
 R树组最近邻查询不确定性可视性障碍距离
Keywords:
 Rtree group nearest neighbor query uncertainty visibility obstructed distance
分类号:
TP311
DOI:
10.15938/j.jhust.2019.03.005
文献标志码:
A
摘要:
针对障碍空间中不确定对象的组k最近邻查询问题,提出了PkOGNN(probabilistic  k  obstructed group nearest neighbor query)查询方法。PkOGNN查询方法主要包括4个子算法:Compadist_o(),SpatialPru(),PruInterEnt()和PkOGNN(),这些子算法分别是集总障碍距离的计算方法、空间修剪方法、根据空间修剪方法进行R树中间结点修剪、最终精炼查询方法。所提PkOGNN查询方法通过集成有效的修剪策略以便减少PkOGNN的搜索空间,得到正确的kGNNs。理论研究和实验结果表明,所提方法具有较好的性能。
Abstract:
 To deal with the problem of group  k  nearest neighbor query method for uncertainty data in obstructed spaces, this paper presents the method of the PkOGNN(probabilistic  k obstructed group nearest neighbor)query .The PkOGNN query method mainly includes four subalgorithms: Compadist_o(),SpatialPru(),PruInterEnt() and PkOGNN(), These algorithms are respectively the calculation of the aggregate obstructed distance, the spatial pruning method, the pruning of the Rtree intermediate items according to the spatial pruning method, the final refined query method.  It integrates the effective pruning methods to reduce the search space of PkOGNN and get the correct kGNNs.The theoretical research and experimental results show that the proposed method has good efficiency.

参考文献/References:

[1]SUN W, CHEN C, ZHENG B, et al.Merged Aggregate Nearest Neighbor Query Processing in Road Networks[C]// CIKM, 2013:2243.
[2]陈舒,蒋志会,陆恒,等. 路网环境中关于模糊组最近邻问题的研究[J]. 计算机应用研究, 2016,33(2) :333.
[3]HASHEM T, KULIK L, ZHANG R. Privacy Preserving Group Nearest Neighbor Queries[C]// EDBT, 2010:489.
[4]刘晓乐,李博.隐私保护下的组最近邻查询算法研究[J]. 计算机应用与软件. 2016,33(5):302.
[5]GAO Yunjun, ZHENG Baihua. Continuous Obstructed Nearest Neighbor Queries in Spatial Databases[C]// Proceedings of the 28th ACM SIGMOD International Conference of Management of Data,2009,9(4): 577.
[6]SULTANA N, HASHEM T, KULIK L. Group Nearest Neighbor Queries in the Presence of Obstacles[C]// International Conference on Advances in GIS,2014:481.
[7]MOKBEL MF, CHOW CY, AREF WG. The Newcasper: Query Processing for Location Services Without Compromising Privacy[C]// International Conference on Very Large Data Bases, 2009, 34(4):763.
[8]HUANG YuanKo, CHEN ChaoChun, LEE Chiang. Continuous knearest Neighbor Query for Moving Objects with Uncertain Velocity[J]. Geoinformatica ,2009,13(1): 1.
[9]孙冬璞,郝晓红,高爽,等. 概率可视最近邻查询算法[J].哈尔滨理工大学学报,2013,18(6):58.
[10]SACK JUJR. Handbook of Computational Geometry [M]. Ottawa: Elsevier Science,2000:829. 
[11]李传文,谷峪,李芳芳,等. 一种障碍空间中不确定对象的连续最近邻查询方法[J].计算机学报,2010,33(8):1359.
[12]PAPADIAS D, SHEN Qiongmao, TAO Yufei, et al. Group Nearest Neighbor Queries[C]//ICDE,2004,312.
[13]SULTANA Nusrat, HASHEM Tanzima, KULIK Lars. Group Nearest Neighbor Queries in the Presence of Obstacles[J]. International Conference on Advances in GIS, 2014:481.[14]LIAN X, CHEN L. Probabilistic Group Nearest Neighbor Queries in Uncertain Databases[J]. IEEE Transactions on Knowledge & Data Engineering,2008, 20(6):809.

相似文献/References:

[1]孙永全,郭建英,陈洪科,等.AMSAA模型可靠性增长预测方法的改进[J].哈尔滨理工大学学报,2010,(05):49.
 SUN Yong-quan,GUO Jian-ying,CHEN Hong-ke,et al.An Improved Reliability Growth Prediction Algorithm Based on AMSAA Model[J].哈尔滨理工大学学报,2010,(03):49.
[2]滕志军,李晓霞,郑权龙,等.矿井巷道的MIMO信道几何模型及其信道容量分析[J].哈尔滨理工大学学报,2012,(02):14.
 TENG Zhi-jun,LI Xiao-xia,ZHENG Quan-long.Geometric Model for Mine MIMO Channels and Its Capacity Analysis[J].哈尔滨理工大学学报,2012,(03):14.
[3]李艳苹,张礼勇.新训练序列下的改进OFDM符号定时算法[J].哈尔滨理工大学学报,2012,(02):19.
 LI Yan-ping,ZHANG Li-yong.An Improved Algorithm of OFDM Symbol Timing Based on A New Training Sequence[J].哈尔滨理工大学学报,2012,(03):19.
[4]赵彦玲,车春雨,铉佳平,等.钢球全表面螺旋线展开机构运动特性分析[J].哈尔滨理工大学学报,2013,(01):37.
 ZHAO Yan-ling,CHE Chun-yu,XUAN Jia-ping,et al.[J].哈尔滨理工大学学报,2013,(03):37.
[5]李冬梅,卢旸,刘伟华,等.一类具有连续接种的自治SEIR传染病模型[J].哈尔滨理工大学学报,2013,(01):73.
 LI Dong-mei,LU Yang,LIU Wei-hua.[J].哈尔滨理工大学学报,2013,(03):73.
[6]华秀英,刘文德.奇Hamiltonian李超代数偶部的非负Z-齐次导子空间[J].哈尔滨理工大学学报,2013,(01):76.
 HUA Xiu-ying,LIU Wen-de.[J].哈尔滨理工大学学报,2013,(03):76.
[7]桂存兵,刘洋,何业军,等.基于LCC谐振电路阻抗匹配的光伏发电最大功率点跟踪[J].哈尔滨理工大学学报,2013,(01):90.
 GUI Cun-bing,LIU Yong,HE Ye-jun.[J].哈尔滨理工大学学报,2013,(03):90.
[8]翁凌,闫利文,夏乾善,等.PI/TiC@Al2O3复合薄膜的制备及其电性能研究[J].哈尔滨理工大学学报,2013,(02):25.
 WENG Ling,YAN Li-wen,XIA Qian-shan.[J].哈尔滨理工大学学报,2013,(03):25.
[9]姜彬,林爱琴,王松涛,等.高速铣刀安全性设计理论与方法[J].哈尔滨理工大学学报,2013,(02):63.
 JIANG Bin,LIN Ai-qin,WANG Song-tao,et al.[J].哈尔滨理工大学学报,2013,(03):63.
[10]李星纬,李晓东,张颖彧,等.EVOH 磺酸锂电池隔膜的制备及微观形貌[J].哈尔滨理工大学学报,2013,(05):18.
 LI Xing- wei,LI Xiao- dong,ZHANG Ying- yu,et al.The Preparation and Microcosmic Morphology oEVOH- SO Li Lithium Ion Battery Septum[J].哈尔滨理工大学学报,2013,(03):18.

备注/Memo

备注/Memo:
 收稿日期: 2017-03-12
基金项目: 黑龙江省教育厅科学技术研究项目(12531z004)
作者简介:
唐贝贝(1990—),女,硕士研究生:
孙健(1990—),男,硕士研究生
通信作者:
万静(1972—),女,博士,教授,硕士研究生导师,E-mail:wanjha@163.com.
更新日期/Last Update: 2019-06-20