Analysis of the relation of search method both inside a block and between blocks and its asymptotic time complexity gives a better block-divided method which makes the index search have the minimum asymptotic time complexity.

• 摘要分析索引查找算法中块内、块间查找方法的选择与时间复杂的关系，给出具有最小渐近时间复杂度的最佳分块方法。