kNN searching order Efficiency depends on order in which regions are searched   Suppose k = 2   Starting with F results in better pruning than with L   For root T,S,O,R,Pi order is better thanP,R,O,Siorder Start with the region with lowest minimum   Sorting or comparison among regions Maintenance of heap More complex and time-consuming than range querying   Eorts to estimate range for neighbours