For RFID-based applications, the uniqueness of ID assigned to each RFID tag should be guaranteed. Several research/standard organizations such as EPCglobal, ISO/IEC, Ubiquitous ID Center, and so on, have developed their own Unique Item ID (UII) specifications. The existence of various UII schemes may cause interoperability problems between applications using different UII schemes when those applications are operated on future global Internet network environment. In addition, it is expected that the traffic for UII query will be increased ten-times higher than that for DNS query in the current Internet. In order to overcome these problems, this paper proposes a fast tree-based classification algorithm applicable for various UII schemes, which can make it efficient to construct global directory lookup services for RFID applications with various UII schemes. Since the proposed scheme can be operated on readers, it can not only distribute traffic loads for UII queries, but also global RFID networks.