多播环境下的增量式查询归并

Incremental Query Merging in Multicast Environment

在信息广播型应用中，数据从少数的“信息生产者”发送到广大的“信息消费者”．如果把“相似”查询归并，就可以通过多播技术避免重复数据发送，从而大大提高因特网上信息广播的效率．因为寻找最优查询归并集合属于ＮＰ完备问题，所以作者对此提出了复杂性较低的启发式算法，并讨论了如何增量式地维护所得到的查询归并集合。

An information broadcasting style application sends data from a few 'information producers' to a lot of 'information consumers'. Merging 'similar' queries can avoid delivering duplicate data through multicast technique, so that the efficiency of information broadcasting on Internet will be greatly increased. Because finding the best set of merged queries is a NP--complete problem, this paper proposes a heuristic algorithm with low complexity, whose result can be incrementally maintained.