本文選題：多媒體數(shù)據(jù)流 + 查詢�。� 參考：《計(jì)算機(jī)研究與發(fā)展》2013年05期

【摘要】：為了有效過濾數(shù)據(jù)流中的有害信息,通常在數(shù)據(jù)流上注冊大量查詢,同時(shí)構(gòu)建過濾器來計(jì)算這些查詢.在多媒體流環(huán)境中,查詢和過濾器常常是一種"多對多"的連接,也就是說,對于單個(gè)過濾器的計(jì)算可能會(huì)同時(shí)給出多個(gè)查詢的結(jié)果.在這種情況下,如何排序所有的過濾器來獲得最小的過濾代價(jià)變得非常重要.對于過濾器的排序一般依賴于3個(gè)指標(biāo):過濾器本身的執(zhí)行代價(jià)c、過濾器連接的查詢數(shù)目p以及過濾器對于隨機(jī)樣本判斷為真的概率s.目前基于貪心的排序算法雖然在一定程度上給出了近似最優(yōu)的結(jié)果,但是還存在以下兩個(gè)問題:1)指標(biāo)s只是簡單依據(jù)經(jīng)驗(yàn)值設(shè)定,不能隨著流的變化而自適應(yīng)變化;2)將3個(gè)指標(biāo)融合成一個(gè)代價(jià)函數(shù)進(jìn)行排序,而沒有深入分析各個(gè)指標(biāo)之間的關(guān)系.考慮到以上方法存在的不足,提出一個(gè)層次排序算法(adaptive hierarchal ordering,AHO)來高效地過濾多媒體數(shù)據(jù)流.該算法首先依據(jù)過濾器的指標(biāo)c和p進(jìn)行分類,然后再在每個(gè)類別上按照s進(jìn)行二次排序.在真實(shí)多媒體流環(huán)境中的過濾結(jié)果證明:AHO可以在不降低準(zhǔn)確度的情況下,自適應(yīng)調(diào)整過濾器順序,其性能優(yōu)于已有的貪心排序算法.
[Abstract]:In order to effectively filter the harmful information in the data stream, a large number of queries are usually registered on the data stream, and a filter is constructed to calculate these queries. In multimedia streaming environment, query and filter are often a kind of "many-to-many" connection, that is, the results of multiple queries may be given for the calculation of a single filter at the same time. In this case, how to sort all filters to get the minimum filter cost becomes very important. The ranking of filters generally depends on three indexes: the execution cost of the filter itself, the number of queries p of the filter join, and the probability of the filter judging to be true for random samples. Although the current greedy sorting algorithm gives an approximate optimal result to a certain extent, there are still two problems, namely, the following two problems: 1) the index s is simply set according to the empirical value. The three indexes can not be adaptively changed with the change of the flow. The three indexes are merged into a cost function to sort without analyzing the relationship between the indexes in depth. Considering the shortcomings of the above methods, a hierarchical sorting algorithm, adaptive hierarchal ordering algorithm (AHOO), is proposed to filter multimedia data streams efficiently. The algorithm first classifies according to the index c and p of the filter, and then reclassifies each category according to s. The filtering results in real multimedia streaming environment show that the proposed scheme can adaptively adjust the order of filters without reducing the accuracy, and its performance is superior to the existing greedy sorting algorithm.
【作者單位】： 國網(wǎng)能源研究院;中國科學(xué)院信息工程研究所;信息內(nèi)容安全技術(shù)國家工程實(shí)驗(yàn)室;
【基金】：國家自然科學(xué)基金項(xiàng)目(61003167) 國家“八六三”高技術(shù)研究發(fā)展計(jì)劃基金項(xiàng)目(2011AA010705)
【分類號】：TP393.08

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 張樹h，

本文編號：2039329