In order to improve the matching rate for business data with massive rules,a fast matching algorithm of rule engines named Multi_Slot Hafuman Trie Tree ( MSTHTrie ) was proposed.It changed rule’s Linear matching into Multi_Slot matching by using the asymmetry of number between rule point's attributes and rules.The concepts of general rule was proposed,and the theorem of rule distributing in slot and action number was proved.The MSHTree algorithm was proposed by reducing operator,and the improved MSHTrie algorithm was proposed by extended operators.Extensive experiments over real data of Hub Airport showed the effectiveness of MSHTree algorithm and MSHTrie algorithm.The average Space complexity is decreased by 52.6% and matching time is decreased by 21.3% when it is compared with traditional Linear matching and Policytree.