Maximizing bichromatic reverse k nearest neighbor with multi-level tags queries in spatial-textual databases

Chengyuan Zhao, Yongli Wang, Xiaohui Jiang, Chi Yuan, Yanchao Li, Isma Masood
{"title":"Maximizing bichromatic reverse k nearest neighbor with multi-level tags queries in spatial-textual databases","authors":"Chengyuan Zhao, Yongli Wang, Xiaohui Jiang, Chi Yuan, Yanchao Li, Isma Masood","doi":"10.1109/PIC.2017.8359553","DOIUrl":null,"url":null,"abstract":"With the popularity of mobile smart devices, location-based services have been more widely used. Bichromatic Reverse k Nearest Neighbor (BRkNN) queries have become a hotspot in spatial-textual databases domain. In this paper, we extend the concept of traditional BRkNN method to process the object with multi-level tags in some specific scenes, and we propose a new type of query, called Maximized Bichromatic Reverse k Nearest Neighbor with Multi-Level Tags queries (MaxBRkNN-MLT), to find the optimal position of object with multi-level tags in the spatial-textual database. Unlike traditional methods, the number of the results of the MaxBRkNN-MLT query is maximized, which can cross the great divide between space and text. The query method proposed in this paper has a wide range of application scenes. For example, in the advertising industry, advertisers expect to find an optimal position, so that the ads with a given tag can attract the most users. Finally, experiments show that the MLT method has better query precision and execution efficiency than the baseline approach.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Progress in Informatics and Computing (PIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC.2017.8359553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the popularity of mobile smart devices, location-based services have been more widely used. Bichromatic Reverse k Nearest Neighbor (BRkNN) queries have become a hotspot in spatial-textual databases domain. In this paper, we extend the concept of traditional BRkNN method to process the object with multi-level tags in some specific scenes, and we propose a new type of query, called Maximized Bichromatic Reverse k Nearest Neighbor with Multi-Level Tags queries (MaxBRkNN-MLT), to find the optimal position of object with multi-level tags in the spatial-textual database. Unlike traditional methods, the number of the results of the MaxBRkNN-MLT query is maximized, which can cross the great divide between space and text. The query method proposed in this paper has a wide range of application scenes. For example, in the advertising industry, advertisers expect to find an optimal position, so that the ads with a given tag can attract the most users. Finally, experiments show that the MLT method has better query precision and execution efficiency than the baseline approach.
利用空间文本数据库中的多层次标签查询最大化双色逆k近邻
随着移动智能设备的普及,基于位置的服务得到了更广泛的应用。双色逆最近邻查询(BRkNN)已成为空间文本数据库领域的研究热点。本文将传统BRkNN方法的概念扩展到某些特定场景下的多标签对象处理,提出了一种新的查询方法MaxBRkNN-MLT (Maximized bicromatic Reverse k Nearest Neighbor with multi- tags),用于在空间文本数据库中寻找多标签对象的最优位置。与传统方法不同,MaxBRkNN-MLT查询的结果数量是最大化的,这可以跨越空间和文本之间的巨大鸿沟。本文提出的查询方法具有广泛的应用场景。例如,在广告行业中,广告商希望找到一个最佳位置,这样带有给定标签的广告就可以吸引最多的用户。最后,实验表明该方法比基线方法具有更好的查询精度和执行效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信