您当前的位置：
首页 >
文章列表页 >
Research on kd-tree Cache Optimization Based on Particle Index Sorting Algorithm
INTELLIGENCE INTERDISCIPLINARY SCIENCE AND ENGINEERING | 更新时间：2026-01-29

    • Research on kd-tree Cache Optimization Based on Particle Index Sorting Algorithm

    • “In the field of large-scale random particle nearest neighbor search, experts have proposed the MAD index sort cache optimization strategy, which can improve performance by up to 30.3% by automatically changing the sorting direction.”
    • Advanced Engineering Sciences   Vol. 58, Issue 1, Pages: 313-323(2026)

    • DOI：10.12454/j.jsuese.202400163    

      CLC： O35

    • Received：01 March 2024，

      Revised：2024-08-14，

      Published Online：16 October 2024，

      Published：20 January 2026

    移动端阅览

  • Zhang Ting,Lin Zhenhuan,Yang Dingying,et al.Research on kd-tree cache optimization based on particle index sorting algorithm[J].Advanced Engineering Sciences,2026,58(1):313‒323. DOI： 10.12454/j.jsuese.202400163.

  •  
  •  

0

Views

359

下载量

0

CNKI被引量

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Improved Kd-tree Particle Nearest Neighbor Search Based on Automatic Termination Criterion
Comparative Analysis of the New and Old Versions of AERMOD in Atmospheric Environmental Impact Assessment in China
Interpretation of the Policies and Regulations for Wetland Protection and the Countermeasures Related to Railway Route Selection
Study of the Vacuum Tank Sewage Discharge System for Railway Station
The Crew Driving Adaptability Analysis

Related Author

张挺
林震寰
杨丁颖
王宗锴
陈轶凡
Xianghan ZHENG
Zhenhuan LIN
Zongkai WANG

Related Institution

福州大学 土木工程学院
College of Mathematics and Computer Science, Fuzhou University
College of Civil Engineering, Fuzhou Univ.
College of Mathematics and Computer Sci. , Fuzhou Univ.
0