On Generalizing Permutation-Based Representations for Approximate Search

Abstract

In the domain of approximate metric search, the Permutationbased Indexing (PBI) approaches have been proved to be particularly suitable for dealing with large data collections. These methods employ a permutation-based representation of the data, which can be efficiently indexed using data structures such as inverted files. In the literature, the definition of the permutation of a metric object was derived by reordering the distances of the object to a set of pivots. In this paper, we aim at generalizing this definition in order to enlarge the class of permutations that can be used by PBI approaches. As a practical outcome, we defined a new type of permutation that is calculated using distances from pairs of pivots. The proposed technique permits us to produce longer permutations than traditional ones for the same number of object-pivot distance calculations. The advantage is that the use of inverted files built on permutation prefixes leads to greater efficiency in the search phase when longer permutations are used.

Learned Indexing in Proteins: Substituting Complex Distance Calculations with Embedding and Clustering Techniques

“…There are multiple similarity search indexes, falling under the umbrella of approximate searching, capable of adjusting to such use cases by lowering their accuracy thresholds or returning partial results [21]. However, in recent years, an entirely new approach has begun to gain traction -along with most other areas of computer science, the area of data retrieval has started to incorporate various machine learning approaches.…”

On Projections to Linear Subspaces

“…Methods like LAESA [7] use so-called pivot/reference/prototype points and the triangle inequality to prune Part of the work on this paper has been supported by Deutsche Forschungsgemeinschaft (DFG), project number 124020371, within the Collaborative Research Center SFB 876 "Providing Information by Resource-Constrained Analysis", project A2 the data set during spatial queries. Tree-based methods like the Balltree [8] use the triangle inequality to exclude entire subtrees, while permutation based indexing [3,14] uses the relative closeness to reference points to partition the data. The central points in these approaches fulfill a role equivalent to pivots.…”