Processing Group Reverse kNN in Spatial Databases

Anasthasia Agnes Haryanto, D. Taniar, Kiki Maulana
{"title":"Processing Group Reverse kNN in Spatial Databases","authors":"Anasthasia Agnes Haryanto, D. Taniar, Kiki Maulana","doi":"10.1109/AINA.2015.176","DOIUrl":null,"url":null,"abstract":"In Reverse Nearest Neighbour (RNN) Query, every single object in the space has a certain region where all objects inside this region will think of the query object as their nearest neighbour. Other objects that are outside the region will not consider the query object as their nearest neighbour. In many cases, we might encounter a situation where we want to find this kind of region for several objects altogether, instead of a single object. Current RNN region approach cannot be used for this problem. Therefore we propose Group Reverse kNN as a solution, which we will find a specific region based on multiple query objects. So any objects located inside this region will always consider all of the query objects as the nearest compare to the non-query objects. Our experiments demonstrate the performance efficiency of the proposed Group Reverse kNN algorithm.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"24 1","pages":"126-133"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2015.176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In Reverse Nearest Neighbour (RNN) Query, every single object in the space has a certain region where all objects inside this region will think of the query object as their nearest neighbour. Other objects that are outside the region will not consider the query object as their nearest neighbour. In many cases, we might encounter a situation where we want to find this kind of region for several objects altogether, instead of a single object. Current RNN region approach cannot be used for this problem. Therefore we propose Group Reverse kNN as a solution, which we will find a specific region based on multiple query objects. So any objects located inside this region will always consider all of the query objects as the nearest compare to the non-query objects. Our experiments demonstrate the performance efficiency of the proposed Group Reverse kNN algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
空间数据库中处理群反向kNN
在反向近邻查询(RNN)中,空间中的每个对象都有一个特定的区域,该区域内的所有对象都认为该查询对象是它们最近的邻居。区域之外的其他对象不会将查询对象视为最近的邻居。在许多情况下,我们可能会遇到这样一种情况,我们想要为几个对象而不是单个对象找到这种区域。目前的RNN区域方法不能用于该问题。因此,我们提出了一种基于多个查询对象找到特定区域的组反向kNN解决方案。因此,位于该区域内的任何对象都将始终将所有查询对象视为最接近非查询对象的比较对象。我们的实验证明了该算法的性能效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance Analysis of WMN-GA Simulation System for Different WMN Architectures Considering OLSR A Network Topology Visualization System Based on Mobile AR Technology A Framework for Security Services Based on Software-Defined Networking Extended Lifetime Based Elliptical Sink-Mobility in Depth Based Routing Protocol for UWSNs A Proposal and Implementation of an ID Federation that Conceals a Web Service from an Authentication Server
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1