The　anti-collision　technology　is　a　key　technology　in　the　radio　frequency　identification　(RFID)　system.　In　order　to　avoid　the　low　efficiency　problem　of　reading　massive　data　labels　via　the　binary-tree　search　algorithm,　by　analyzing　the　character　of　mass　data　and　the　regularity　of　tags　encoding,　a　flat-N-tree　search　anti-collision　algorithm　is　proposed　according　to　the　regularity　of　massive　data　tags　encoding　and　the　principle　of　binary-tree　search　algorithm　in　the　management　systems,　which　is　suitable　for　reading　massive　data　RFID　labels.　The　result　shows　that　the　reading　efficiency　of　the　multi-tree　search　algorithm　is　better　than　that　of　the　binary-tree　search　algorithm　when　the　total　quantity　of　tags　is　greater　than　a　certain　value.　©,　2014,　Beijing　University　of　Posts　and　Telecommunications.　All　right　reserved.