BLB tree: An efficient index structure for fast search

TitreBLB tree: An efficient index structure for fast search
Publication TypeJournal Article
Year of Publication2016
AuthorsBahri, Aa, Zouaki, Ha, Thami, ROHb
JournalInternational Review on Computers and Software
Volume11
Pagination848-858
Abstract

Due of its interest in different areas, similarity search in high-dimensional spaces is one of the principal research axes today for CBIR Systems. The properties for high-dimensional data demand some adequate search methods to have a research in optimal time. Due to the curse of dimensionality, search time in the index structure exponentially increases, according the dimension of the descriptor. However, the performances of classical index structures become less than the sequential scan of data in search time when answering exact nearest neighbor queries. To overcome this problematic, two major approaches for high-dimensional data in CBIR systems have been proposed: The first approach permits to speed up the search by using multiple levels of lower bound distances, the second approach exploits the BTree index structure to speed up the search. We propose to combine both techniques to search for large nearest neighbors in a high-dimensional space. We develop a new multidimensional index structure, called BLBTree. In BLB Tree, instead of computing the distances in the high-dimensional original space to find the nearest neighbor, lot of candidates are to be rejected based on the lower bound distances: the research in BLB Tree does not calculate the distances in the high-dimensional original space to find the nearest neighbor if the lower bounding distance exceeds the threshold, because the distances in the high-dimensional cannot be lower than the distances in the low-dimensional. We note that each object in BLB Tree is described by a pyramid structure of histograms, with each histogram representing the lower resolution of the other histogram; due to this property, our index structure is well-suited for high-dimensional and large-scale problems. We have shown that our approach provides interesting and powerful experimental results. © 2016 Praise Worthy Prize S.r.l. - All rights reserved.

URLhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85011708729&doi=10.15866%2firecos.v11i10.9711&partnerID=40&md5=db12b847849b16d2e0b98f325a4022c5
DOI10.15866/irecos.v11i10.9711
Revues: 

Partenaires

Localisation


Location map

Suivez-nous sur

  

Contactez-nous

ENSIAS

Avenue Mohammed Ben Abdallah Regragui, Madinat Al Irfane, BP 713, Agdal Rabat, Maroc

Résultat de recherche d'images pour "icone fax" Télécopie : (+212) 5 37 77 72 30

    Compteur de visiteurs:310,215
    Education - This is a contributing Drupal Theme
    Design by WeebPal.