Figure 4
From: K-NN query algorithm based on PB-tree with the parallel lines division
The disk access times comparison of the different number of k-NN objects.
Figure 4 | Communications in Mobile Computing
From: K-NN query algorithm based on PB-tree with the parallel lines division
The disk access times comparison of the different number of k-NN objects.
