Earticle

This paper proposes a hash index for spatiotemporal continuous query processing rules for filtering, classifying, analyzing, and responding to consecutively collected target objects. The Rete technique for improving the performance of rule-based complex event processing shows better performance than the rule interpretation method as it creates a compiled data structure for the rule. This paper proposes a performance improvement method that eliminates the rule search overhead by creating a spatiotemporal index for the Rete nodes expressing spatiotemporal continuity query rules and stabbing the Rete node of the rule by employing hash indexing on the stream data.

Aiming to solve the problem of long table look-up time in table look-up of CAVLC (Context-based Adaptive Variable Length Coding) for H.264/ AVC, a quick table look-up algorithm based on hash query (TLHQ) is proposed to reduce table look-up time for CAVLC decoding in this paper. The basic idea of the new algorithm is that it uses query technology of hash table to rapidly determine code length based on the number of zero in code prefix, As a result, it can save a lot of time of table looking-up and code judging. Experimental results show that our supposed new algorithm could reduce about 20% table look-up time and save 1056 byte storage space for CAVLC decoding in H.264/AVC.