Gabriel Joseph Ramos Rafael, Carlos V. A. M. Pontes, Maxwell Guimarães De Oliveira, Carlos Eduardo Santos Pires, Claudio E. C. Campelo
{"title":"Topo-MSJ:通过对空间区域的定性处理搜索 POI 群组","authors":"Gabriel Joseph Ramos Rafael, Carlos V. A. M. Pontes, Maxwell Guimarães De Oliveira, Carlos Eduardo Santos Pires, Claudio E. C. Campelo","doi":"10.1111/tgis.13226","DOIUrl":null,"url":null,"abstract":"To alleviate challenges related to mobility, travel planning, and time management, individuals commonly encounter the necessity of locating points of interest (POIs) that either share the same physical building or are situated within interconnected buildings. However, existing search engines face difficulties in retrieving groups of places based on keywords and topological relations among their respective regions, for instance, when a user wants to find a residential building that is connected to a green area. This is primarily due to their limited consideration of POIs as mere points in space, rather than recognizing the polygonal geometries of their boundaries. In this work, we present a spatial search solution based on textual and topological query parameters for efficiently retrieving groups of POIs whose neighborhoods and boundaries satisfy specific restrictions. To perform this type of search efficiently, we propose the Topo‐MSJ algorithm, building upon the well‐established “Multi‐Star‐Join” (MSJ) algorithm, by including an efficient approach to handle queries with topological requirements. To assess the effectiveness of our solution, we conduct a performance evaluation by comparing the execution time of Topo‐MSJ with equivalent spatial SQL queries. The experimental analysis, performed on real datasets, reveals that Topo‐MSJ exhibits a faster execution time compared with equivalent SQL queries, additionally providing a simplified spatial pattern query notation.","PeriodicalId":47842,"journal":{"name":"Transactions in GIS","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Topo‐MSJ: Search for groups of POIs with qualitative processing of spatial regions\",\"authors\":\"Gabriel Joseph Ramos Rafael, Carlos V. A. M. Pontes, Maxwell Guimarães De Oliveira, Carlos Eduardo Santos Pires, Claudio E. C. Campelo\",\"doi\":\"10.1111/tgis.13226\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To alleviate challenges related to mobility, travel planning, and time management, individuals commonly encounter the necessity of locating points of interest (POIs) that either share the same physical building or are situated within interconnected buildings. However, existing search engines face difficulties in retrieving groups of places based on keywords and topological relations among their respective regions, for instance, when a user wants to find a residential building that is connected to a green area. This is primarily due to their limited consideration of POIs as mere points in space, rather than recognizing the polygonal geometries of their boundaries. In this work, we present a spatial search solution based on textual and topological query parameters for efficiently retrieving groups of POIs whose neighborhoods and boundaries satisfy specific restrictions. To perform this type of search efficiently, we propose the Topo‐MSJ algorithm, building upon the well‐established “Multi‐Star‐Join” (MSJ) algorithm, by including an efficient approach to handle queries with topological requirements. To assess the effectiveness of our solution, we conduct a performance evaluation by comparing the execution time of Topo‐MSJ with equivalent spatial SQL queries. The experimental analysis, performed on real datasets, reveals that Topo‐MSJ exhibits a faster execution time compared with equivalent SQL queries, additionally providing a simplified spatial pattern query notation.\",\"PeriodicalId\":47842,\"journal\":{\"name\":\"Transactions in GIS\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions in GIS\",\"FirstCategoryId\":\"89\",\"ListUrlMain\":\"https://doi.org/10.1111/tgis.13226\",\"RegionNum\":3,\"RegionCategory\":\"地球科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"GEOGRAPHY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions in GIS","FirstCategoryId":"89","ListUrlMain":"https://doi.org/10.1111/tgis.13226","RegionNum":3,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"GEOGRAPHY","Score":null,"Total":0}
引用次数: 0
摘要
为了缓解与移动性、旅行规划和时间管理相关的挑战,个人通常会遇到需要定位兴趣点(POI)的情况,这些兴趣点要么共用同一物理建筑,要么位于相互连接的建筑内。然而,现有的搜索引擎在根据关键字和各自区域之间的拓扑关系检索兴趣点群方面存在困难,例如,当用户想要查找一栋与绿地相连的住宅楼时。这主要是由于搜索引擎仅将 POI 视为空间中的点,而不是识别其边界的多边形几何结构。在这项工作中,我们提出了一种基于文本和拓扑查询参数的空间搜索解决方案,用于高效检索邻域和边界满足特定限制条件的 POI 群组。为了高效地执行这类搜索,我们提出了 Topo-MSJ 算法,该算法建立在成熟的 "多星连接"(MSJ)算法基础之上,包括一种高效的方法来处理有拓扑要求的查询。为了评估我们解决方案的有效性,我们通过比较 Topo-MSJ 与同等空间 SQL 查询的执行时间来进行性能评估。在真实数据集上进行的实验分析表明,与同等的 SQL 查询相比,Topo-MSJ 的执行时间更快,而且还提供了简化的空间模式查询符号。
Topo‐MSJ: Search for groups of POIs with qualitative processing of spatial regions
To alleviate challenges related to mobility, travel planning, and time management, individuals commonly encounter the necessity of locating points of interest (POIs) that either share the same physical building or are situated within interconnected buildings. However, existing search engines face difficulties in retrieving groups of places based on keywords and topological relations among their respective regions, for instance, when a user wants to find a residential building that is connected to a green area. This is primarily due to their limited consideration of POIs as mere points in space, rather than recognizing the polygonal geometries of their boundaries. In this work, we present a spatial search solution based on textual and topological query parameters for efficiently retrieving groups of POIs whose neighborhoods and boundaries satisfy specific restrictions. To perform this type of search efficiently, we propose the Topo‐MSJ algorithm, building upon the well‐established “Multi‐Star‐Join” (MSJ) algorithm, by including an efficient approach to handle queries with topological requirements. To assess the effectiveness of our solution, we conduct a performance evaluation by comparing the execution time of Topo‐MSJ with equivalent spatial SQL queries. The experimental analysis, performed on real datasets, reveals that Topo‐MSJ exhibits a faster execution time compared with equivalent SQL queries, additionally providing a simplified spatial pattern query notation.
期刊介绍:
Transactions in GIS is an international journal which provides a forum for high quality, original research articles, review articles, short notes and book reviews that focus on: - practical and theoretical issues influencing the development of GIS - the collection, analysis, modelling, interpretation and display of spatial data within GIS - the connections between GIS and related technologies - new GIS applications which help to solve problems affecting the natural or built environments, or business