All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Improving the Performance of M-tree Family by Nearest-Neighbor Graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F07%3A00206190" target="_blank" >RIV/00216208:11320/07:00206190 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Improving the Performance of M-tree Family by Nearest-Neighbor Graphs

  • Original language description

    The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we propose an extension of the M-tree family, which makes use of nearest-neighbor (NN) graphs. Each tree node maintains its own NN-graph, a structure that stores for each node entry a reference (and distance) to its nearest neighbor, considering just entries of the node. The NN-graph can be used to improve filtering of non-relevantsubtrees when searching (or inserting new data). The filtering is based on using ?sacrifices? ? selected entries in the node serving as pivots to all entries being their reverse nearest neighbors (RNNs). We propose several heuristics for sacrifice selection; modified insertion; range and kNN query algorithms. The experiments have shown the M-tree (and variants) enhanced by NN-graphs can perform significantly faster, while keeping the construction cheap.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP201%2F05%2FP036" target="_blank" >GP201/05/P036: Efficient metric search in large multimedia databases</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2007

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    11th East-European Conference on Advances in Databases and Information Systems ADBIS 2007

  • ISBN

    978-3-540-75184-7

  • ISSN

  • e-ISSN

  • Number of pages

    17

  • Pages from-to

  • Publisher name

    Springer

  • Place of publication

    Varna, Bulgaria

  • Event location

    Varna, Bulgaria

  • Event date

    Jan 1, 2007

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000250283400014