SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the performance of index. For equidistant envelope (bounding sphere), calculation of envelope is somewhat difficult because of the complexity of direct computation in high dimension space. In this paper we summarizethe envelopeused in similarityindexing structures, and discuss the envelope parameter calculation problem. We improved the 'i-spatial search algorithm proposed by R. Kuniawati and JoS.Jin for equidistant envelope parameter calculation, and applyit to various distance spaces. Basic thoughts andtheorem are provided in the paper, alsowith algorithmimplementation.