{"title":"numa感知的空间文本相似连接","authors":"Saransh Gautam, S. Ray, B. Nickerson","doi":"10.1145/3397536.3422227","DOIUrl":null,"url":null,"abstract":"Spatio-textual similarity join is an operation for finding documents, which are both spatially close and textually relevant. Joins in databases are considered to be the most expensive operation; similarly spatio-textual similarity join is a resource intensive operation. Therefore, it is natural to consider approaches to parallelize this operation. Many modern multi-core systems adopt a NUMA-based memory architecture. NUMA systems entail varying memory access latencies across nodes, which may adversely affect overall query latency. Recent work on spatio-textual similarity join have not addressed the effects of non-uniform access latencies in multi-node NUMA systems. In this paper, we propose a NUMA-aware parallel spatio-textual similarity join algorithm NA-STSJ-WS. It exploits topology-aware work-stealing with adaptive data placement. Experimental evaluation demonstrates that NA-STSJ-WS performs significantly better than existing approaches that are not NUMA-aware, and in the best case we observe 82× speedup over the sequential baseline.","PeriodicalId":233918,"journal":{"name":"Proceedings of the 28th International Conference on Advances in Geographic Information Systems","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"NUMA-Aware Spatio-Textual Similarity Join\",\"authors\":\"Saransh Gautam, S. Ray, B. Nickerson\",\"doi\":\"10.1145/3397536.3422227\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Spatio-textual similarity join is an operation for finding documents, which are both spatially close and textually relevant. Joins in databases are considered to be the most expensive operation; similarly spatio-textual similarity join is a resource intensive operation. Therefore, it is natural to consider approaches to parallelize this operation. Many modern multi-core systems adopt a NUMA-based memory architecture. NUMA systems entail varying memory access latencies across nodes, which may adversely affect overall query latency. Recent work on spatio-textual similarity join have not addressed the effects of non-uniform access latencies in multi-node NUMA systems. In this paper, we propose a NUMA-aware parallel spatio-textual similarity join algorithm NA-STSJ-WS. It exploits topology-aware work-stealing with adaptive data placement. Experimental evaluation demonstrates that NA-STSJ-WS performs significantly better than existing approaches that are not NUMA-aware, and in the best case we observe 82× speedup over the sequential baseline.\",\"PeriodicalId\":233918,\"journal\":{\"name\":\"Proceedings of the 28th International Conference on Advances in Geographic Information Systems\",\"volume\":\"116 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 28th International Conference on Advances in Geographic Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3397536.3422227\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 28th International Conference on Advances in Geographic Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3397536.3422227","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Spatio-textual similarity join is an operation for finding documents, which are both spatially close and textually relevant. Joins in databases are considered to be the most expensive operation; similarly spatio-textual similarity join is a resource intensive operation. Therefore, it is natural to consider approaches to parallelize this operation. Many modern multi-core systems adopt a NUMA-based memory architecture. NUMA systems entail varying memory access latencies across nodes, which may adversely affect overall query latency. Recent work on spatio-textual similarity join have not addressed the effects of non-uniform access latencies in multi-node NUMA systems. In this paper, we propose a NUMA-aware parallel spatio-textual similarity join algorithm NA-STSJ-WS. It exploits topology-aware work-stealing with adaptive data placement. Experimental evaluation demonstrates that NA-STSJ-WS performs significantly better than existing approaches that are not NUMA-aware, and in the best case we observe 82× speedup over the sequential baseline.