第三部分，针对如何找到最优序列，提出一种关键请求局部邻近搜索方法。

Thirdly, for how to find the optimal sequence, giving a critical request local neighborhood search method.

youdao

我们遇到带有通配符和邻近搜索的复杂查询，有时需要超过15秒才能获得前100个文档。

We encounter complex queries having wild CARDS and proximity searches together and it sometimes takes more than 15 secs to get top 100 documents.

youdao

因此，这个算法一般被归类为带合并的最佳适合算法：释放的邻近的块被合并，并被保存在按大小搜索的箱子里。

Thus, the general categorization of this algorithm is best-first with coalescing: Freed chunks are coalesced with neighboring ones, and held in bins that are searched in size order.

youdao