KPYR: An Efficient Indexing Method

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.

• Type: Conference
• Year: 2005
• Where: ICMCS
• Authors: Thierry Urruty, Fatima Belkouch, Chabane Djeraba
• Keywords: Clustering Algorithm, Efficient Indexing Structures, ICMCS 2005, Indexing Structure