KPYR: An Efficient Indexing Method

T. Urruty, F. Belkouch, C. Djeraba
2005 IEEE International Conference on Multimedia and Expo  
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clustering algorithm to partition the data space into subspaces on which we apply Pyramid Technique [1]. We thus reduce the search space concerned by a query and improve the performances. We show that our approach provides interesting and performing experimental results for both K-Nearest Neighbors and Window queries. 0-7803-9332
doi:10.1109/icme.2005.1521704 dblp:conf/icmcs/UrrutyBD05 fatcat:cd37j3vhsjbbhjlzf2eb6czkqu