numa感知的空间文本相似连接

Saransh Gautam, S. Ray, B. Nickerson
{"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}
引用次数: 0

摘要

空间-文本相似连接是一种查找空间相近和文本相关的文档的操作。数据库中的连接被认为是最昂贵的操作;同样,空间-文本相似性连接也是一种资源密集型操作。因此,考虑并行化此操作的方法是很自然的。许多现代多核系统采用基于numa的内存体系结构。NUMA系统需要跨节点的不同内存访问延迟,这可能会对总体查询延迟产生不利影响。最近关于空间文本相似连接的研究没有解决多节点NUMA系统中非均匀访问延迟的影响。本文提出了一种numa感知的并行空间文本相似度连接算法NA-STSJ-WS。它利用自适应数据放置的拓扑感知工作窃取。实验评估表明,NA-STSJ-WS的性能明显优于不支持numa的现有方法,在最佳情况下,我们观察到顺序基线上的82倍加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
NUMA-Aware Spatio-Textual Similarity Join
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Poet Distributed Spatiotemporal Trajectory Query Processing in SQL A Time-Windowed Data Structure for Spatial Density Maps Distributed Spatial-Keyword kNN Monitoring for Location-aware Pub/Sub Platooning Graph for Safer Traffic Management
×
引用
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