帮我翻译成英语图8给出了不同算法随着查询次数变化导致的算法执行成功率差异。从该图可以看出算法查询次数是独立于算法执行成功率的也就是说算法执行的成功率不因查询次数的变化而增加或减少。这主要是由于用户每次查询可能成功也可能不成功在多次查询取平均值之后所有的执行不成功转化为不成功概率而这一概率在整体比较中并不明显。另外从该图中可以看出泛化类隐私保护算法例如属性基加密算法、关联概率不可区分算法的成功率要低

Figure 8 shows the difference in algorithm success rates caused by changes in query frequency for different algorithms. It can be seen from the figure that algorithm query frequency is independent of algorithm success rate, meaning that the success rate of algorithm execution does not increase or decrease with changes in query frequency. This is mainly because each user query may or may not be successful. After averaging multiple queries, all unsuccessful executions are converted into an unsuccessful probability, which is not significant in overall comparison. Additionally, the success rate of generalization-based privacy protection algorithms (such as attribute-based encryption algorithms and probabilistic indistinguishability-based algorithms) is lower than that of PIR retrieval-based privacy protection algorithms. This is because generalization-based algorithms need to find generalized users who can generalize real users to complete privacy protection processing. If there are fewer generalized users in the current area or their willingness to participate in generalization is low, it is difficult for these algorithms to find enough generalized users, resulting in lower execution success rates for their privacy protection algorithms than for PIR retrieval-based privacy protection algorithms. Among many PIR retrieval-based privacy protection algorithms, the algorithm proposed in this article has little difference in algorithm execution success rate affected by query frequency compared with other algorithms. It can be regarded as having a high algorithm execution success rate along with changes in query frequency among similar algorithms