The new algorithm adopts the binary slotted query tree algorithm, which largely reduces both query frequency and data iteration, and also improves identification efficiency.