.png){kind=icon}
返回
Efficient computation of spatial joins with intersection predicates
.png){kind=icon}
PRE
AI
DOI：10.1080/13658810110095020.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce a new algorithm to compute the spatial join of two or more spatial data sets, when indexes are not available on them. Size Separation Spatial Join (S-3 J) imposes a hierarchical decomposition of the data space and, in contrast to previous approaches, requires no replication of entities from the input data sets. Thus its execution time depends only on the sizes of the joined data sets. We described S-3 J and present an analytical evaluation of its I/O and processor requirements comparing them with those of previously proposed algorithms for the same problem. We show that S-3 J has relatively simple cost estimation formulas that can be exploited by a query optimizer. S-3 J can be efficiently implemented using software already present in many relational systems. In addition, we introduce Dynamic Spatial Bitmaps (DSB), a new technique that enables S-3 J dynamically or statically to exploit bitmap query processing techniques. Finally, we present experimental results for a prototype implementation of S-3 J involving real and synthetic data sets for a variety of data distributions. Our experimental results are consistent with our analytical observations and demonstrate the performance benefits of S-3 J over alternative approaches that have been proposed recently.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.1
论文数:
2.7K
被引数:
9.3K
机构
暂无机构信息
引用论文
Comparison of chemical extraction and bioassay for measurement of metsulfuron in soil.png)
Weed Science
Weed ScienceIF0
PREAI
分享收藏
查看更多内容