Fast Algorithm to Detect Conflict Rule Based on the Multi_Slot Sub_Bucket

To resolve the conflict within the massive rules in enterprise, this paper proposes a fast rule conflict-detection algorithm named multi_slot sub_bucket conflict cetection (MSSB) based on multi_slot and sub_bucket. It turns rule's complexity conflict detection into result of non-conflict rules in lineartime by the theorem of non-conflict. First, this research proposed the concepts of general rule's conflict and non-conflict, and proves three propositions and the theorem of non-conflict. Then it proposes the MSSB algorithm by the structure of Huffman tree and Triangular matrix. Extensive experiments over real data of Hub Airport show the effectiveness of new proposed MSSB algorithm. The average space complexity is decreased 33.6% and matching time is decreased 36.2% compared with traditional linear detection and policytree.