Oct 6, 1998 · Indexing high-dimensional data spaces is an emerging research domain. It gains increas- ing importance by the need to support modern ...

Therefore, specialized indexing techniques for high dimensional spaces include e.g., ideas to scale up sequential scans, hybrid approaches combining elements of ...

This paper presents a randomized algorithm for fast similarity search in high dimensional spaces. We use random partition trees to obtain disjoint and complete ...

Independent quantization: an index compression technique for high-dimensional data spaces · Exploring the Color Histogram's Dataspace for Content Based Image ...

Generally speaking, the problem is that important parameters such as volume and area depend exponentially from the number of dimensions of the data space.

High dimensional similarity search in large scale databases becomes an impor- tant challenge due to the advent of Internet.

In this paper we propose a simple, (not simplistic) yet efficient indexing structure for high--dimensional data points of variable dimension, using dimension ...

This work presents a new family of indexing techniques that superimposes static partitioning over a dynamic partitioning scheme in order to improve the search ...

Abstract—In main memory systems, the L2 cache typically employs cache line sizes of 32-128 bytes. These values are relatively.

In this paper, we present a technique for dimensionality reduction by grouping d distinct attributes into k disjoint clusters and mapping each cluster to a ...