In this paper we first analyze the hierarchy of combination query then we introduce an algorithm named as combination query tree algorithm . This algorithm could quantitatively determine the query efficiencies by computing and comparing the weighted path length and effectively measure every kind of combination .

本文先分析了组合查询的层次性，进而介绍了一种能定量比较查询效率的算法&组合查询树算法，该算法通过计算比较组合查询树的 带 权 路径 长度有效地度量每一种组合。

Simulation shows that when the number of data sinks is large frequency-divided data dissemination outperformed previous best data dissemination scheme SEAD about 15 % in weighted path length . Then energy consumption of data dissemination is reduced and system lifetime is prolonged .

实验表明，在数据接收者较多的情况下，分频数据分发协议比现有最好的数据分发协议SEAD的 加权 路径 长度要短15%左右，从而有效节省了分发数据的能量消耗，延长了系统生命期。