Compression of Search Range of VP-Tree for Multimedia Data Retrieval Applications

This paper presents an approach for improving the use of VP-tree in video indexing and search. VP-tree is one of the metric space-based indexing methods used in multimedia database search and data retrieval. The proposed approach focuses on the trigonometric inequality for compressing the search range, thus, improving the search performance. A test result of using 10, 000 video files shows that this method reduced search time by 5 - 12%, compared to the existing method using the AESA (Approximating and Eliminating Search Algorithm) algorithm.