RFID tags are increasingly used for identifying and tracking purposes. In many applications, such as shop gateways, it is possible that more than one tag come within the range of the reader, which may interfere with the detection of tags or the data exchange. This paper presents a method based on the combination of CSMA and query tree to manage multiple accesses and avoid collision. This method is implemented in two stages. First, the tags with the unique short addresses are detected, and then remaining tags are identified in the next stage. The simulation results of the proposed method in MATLAB Software show improved common access parameters and reduced latency compared to the similar methods, which is due to the processing of the shortened address rather than the whole address.