CAJ | 학술논문

基双色子反近邻的查询在空间数据库领很有应用价值.在实际中,设施会要受到自身服务能力的限制.当需求快速增长时,那些处服务密集区的设施很可能不堪重负.研究了一种与双色子反近邻集合相关的查询,旨在找到最具潜力的候选位置来最大程度的提高整个区的服务质量.使用剪枝技术和空间索引技术,提出了时间复杂度为O(nlogn)的算法快速有效的完成这种查询.为了评价算法的效率,我们在真实数据集和合成数据集上做了实验,结果显示提出的算法十分优基本算法.
기쌍색자반근린적사순재공간수거고령흔유응용개치.재실제중,설시회요수도자신복무능력적한제.당수구쾌속증장시,나사처복무밀집구적설시흔가능불감중부.연구료일충여쌍색자반근린집합상관적사순,지재조도최구잠력적후선위치래최대정도적제고정개구적복무질량.사용전지기술화공간색인기술,제출료시간복잡도위O(nlogn)적산법쾌속유효적완성저충사순.위료평개산법적효솔,아문재진실수거집화합성수거집상주료실험,결과현시제출적산법십분우기본산법.
Bichromatic reverse nearest neighbor (BRNN) has great potential for real life applications and re-ceives considerable attentions from spatial database studies .In real world, facilities are inevitably constrained by designed capacities.When the needs of service increase , facilities in those booming areas may suffer from over-loading.We study a new kind of BRNN related query .It aims at finding most promising candidate locations to increase the overall service quality.To efficiently answer the query, we propose an algorithm using pruning tech-niques and spatial indices.To evaluate the efficiency of proposed algorithm , we conduct extensive experiments on both real and synthetic datasets .The results show our algorithm has superior performance over the basic solu-tion.