In a report query, the user asks for all the features that comprise the queried window. In this kind of query the bitstring will play no role, since only when reaching the leaf level its bitstring is searched to return the features whose corresponding positions in the bitstring are set to 1. At the leaf level, the BHL-tree will work in exactly the same way as described in [11], i.e. similarly to the exist query.