XMLWordPrintable

Details

    • Epic
    • Status: Stalled (View Workflow)
    • Critical
    • Resolution: Unresolved
    • N/A
    • Server

    Description

      A common operation for multi-dimensional vectors is to find k nearest vectors to the given one.
      This task is about implementing indexes that allow to do it fast.

      • ideally they'll be engine independent
      • indexes should be update-able
      • in this task we'll only do Euclidean distance
      • we'll benchmark it on real multi-million-rows data sets
      • what algorithm, exactly, to use is still unclear

      Attachments

        Issue Links

          Activity

            People

              serg Sergei Golubchik
              serg Sergei Golubchik
              Votes:
              2 Vote for this issue
              Watchers:
              19 Start watching this issue

              Dates

                Created:
                Updated:

                Git Integration

                  Error rendering 'com.xiplink.jira.git.jira_git_plugin:git-issue-webpanel'. Please contact your Jira administrators.