In-Memory Spatial Join: The Data Matters
文献类型：会议论文
| 作者 | Qiang Qu; Sadegh Nobari; Christian S. Jensen |
| 出版日期 | 2017 |
| 会议日期 | 2017 |
| 会议地点 | 意大利威尼斯 |
| 英文摘要 | A spatial join computes all pairs of spatial objects in two data sets satisfying a distance constraint. An increasing demand in applications ranging from human brain analysis to transportation data analysis motivates studies on designing new in-memory spatial join algorithms. Among recent proposals, the following six algorithms can efficiently perform in-memory spatial joins: Size Separation Spatial Join (S3), Spatial Grid Hash join (SGrid), TOUCH, Partition Based Spatial-Merge Join (PBSM), Plane-Sweep Join (PS), and Nested-Loop Join (NL). This paper addresses the need for studies of aspects that may influence the performance of spatial join algorithms. In particular, given two datasets, A and B, the following aspects may affect performance: the datasets being real or synthetic data, the distributions with respect to density and location of the datasets, and the order of performing the spatial join (A 笨ｶ B or B 笨ｶ A). To study the effects on performance of these aspects, we implement the six spatial join algorithms in a single framework and conduct extensive experiments. The findings show that the data being real or synthetic, the data distribution, and the join order can influence substantially the performance of the algorithms. We present detailed findings that offer insight into different facets of each algorithm and that enable comparison across algorithms and datasets. Furthermore, we provide advice on choosing among the spatial join algorithms based on the empirical evaluation. |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/11928]  |
| 专题 | 深圳先进技术研究院_其他 |
| 作者单位 | 2017 |
| 推荐引用方式 GB/T 7714 | Qiang Qu,Sadegh Nobari,Christian S. Jensen. In-Memory Spatial Join: The Data Matters[C]. 见:. 意大利威尼斯. 2017. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。