Fig. 1 | Scientific Reports

Fig. 1

From: Telescope indexing for k-nearest neighbor search algorithms over high dimensional data & large data sets

Fig. 1

The figure on the left shows the data partitioning created by ti\(k\)-NN (B+ + \(ball\)-tree) of order 4. The blue sections are partitions created by the primary index (B+), and the green sections indicate the telescope index (\(ball\)-tree) at partition V5. The table on the right is the data, having two features \(X_1, X_2\) and a label Y. The tuple ID TID is used to identify individual data.

Back to article page