Cache Performance Analysis of Spatial Join Algorithm Based on Hilbert R-tree
Hongsheng Chen · Modern Electronics Technique · 2011
As the diversity of performance between processor and memory getting larger and larger,Cache is ued to make up the growing gap.The purpose of the performance optimization has been transferred from the disk/memory level to the memory/Cache level for operations in spatial databases.Spatial Join algorithm is one of the most important operations in spatial databases and its efficiency has a direct influence on the performance of the spatial queries.However,most of the traditional spatial join algorithms haven't taken enough consideration in the utilization of Cache.Focusing on the utilization of Cache in spatial join algorithms,the influence brought by the locality of the code is analyzed,the performance of spatial join based on Hilbert R-tree in main memory is tested.Besides,the impact on spatial join and performance of access to cache with different node size are compared.These results are very useful for improving the efficiency of the Cache-conscious spatial join.