The X-tree : An Index Structure for High-Dimensional Data

@inproceedings{Berchtold1996TheX,
  title={The X-tree : An Index Structure for High-Dimensional Data},
  author={Stefan Berchtold and Daniel A. Keim and Hans-Peter Kriegel},
  booktitle={VLDB},
  year={1996}
}
In this paper, we propose a new method for indexing large amounts of point and spatial data in high-dimensional space. [...] Key Method To avoid this problem, we introduce a new organization of the directory which uses a split algorithm minimizing overlap and additionally utilizes the concept of supernodes. The basic idea of overlap-minimizing split and supernodes is to keep the directory as hierarchical as possible, and at the same time to avoid splits in the directory that would result in high overlap. Our…Expand
PK-tree: A Spatial Index Structure for High Dimensional Point Data
TLDR
Empirical evidence shows that the PK-tree outperforms the recently proposed spatial indexes based on the R-tree and X-tree by a wide margin and it is also significant that the relative performance advantage of thePK-tree grows with the dimensionality of the data set.
MKL-tree: an index structure for high-dimensional vector spaces
TLDR
MKL-tree is a novel hierarchical data structure for high dimensional data indexing based on dimensionality reduction operated by means of the MKL transform, a multi-space generalization of the KL transform, allowing more selective features to be extracted and thus increasing the discriminating power of the index.
PL-Tree: An Efficient Indexing Method for High-Dimensional Data
TLDR
A new indexing method to support efficient point queries, range queries, and k-nearest neighbor queries and it can substantially reduce the negative impacts of the "curse of dimensionality".
Efficient Indexing of High-Dimensional Data Through Dimensionality Reduction
TLDR
A technique for dimensionality reduction by grouping d distinct attributes into k disjoint clusters and mapping each cluster to a linear space so that the resulting k-dimensional space can be indexed using an R-tree efficiently.
PL-Tree : An Efficient Access Method for High-Dimensional Data
  • 2012
The quest for processing spatial data in high-dimensional space has resulted in a number of innovative indexing mechanisms. Most of the early methods index data according to their geometric
SC-Tree: An Efficient Structure for High-Dimensional Data Indexing
TLDR
A sorted clue tree (SC-tree) is proposed, which essentially modifies the nodes, entries, indexing algorithm, and query algorithm of the M-tree but reserves its advantages.
Spatial indexing of high-dimensional data based on relative approximation
TLDR
The basic idea of the A-tree is the introduction of virtual bounding rectangles (VBRs) which contain and approximate MBRs or data objects, and the validity of the cost model for synthetic and real data sets is verified.
Yet Another Spatial Indexing Structure
TLDR
A more declarative nature to the deenition of the PK-tree results in a structure that is unique for a given set of objects to be stored, which enables analysis that is simpler than if the structure were dependent on the order in which points were inserted, deleted, etc.
An indexing technique using relative approximation for high-dimensional data
TLDR
The VR-tree (Virtual/Real tree) is introduced, a new index structure which overcomes the problems and achieves higher search performance in high-dimensional vector space and introduces algorithms based on relative approximation for VBRs and relative cells.
The GC-tree: a high-dimensional index structure for similarity search in image databases
TLDR
The GC-tree is a new dynamic index structure based on a special subspace partitioning strategy which is optimized for a clustered high-dimensional image dataset and outperforms all other methods for efficient similarity search in image databases.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 54 REFERENCES
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
TLDR
A variation to Guttman’s Rtrees (R+-trees) that avoids overlapping rectangles in intermediate nodes of the tree is introduced and analytical results indicate that R+-Trees achieve up to 50% savings in disk accesses compared to an R-tree when searching files of thousands of rectangles.
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
TLDR
A new data structure, the K-D-B-tree, is presented as a solution to the problem of retrieving multikey records via range queries from a large, dynamic index, and it is expected that the multidimensional search effieciency of balanced K-Ds and the I/O efficiency of B-trees should both be approximated in this structure.
R-trees: a dynamic index structure for spatial searching
TLDR
A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
TLDR
The principles of the buddy-tree, the organization of its directory and the most important algorithms are introduced, and a performance comparison of the Buddy-tree with other access methods demonstrating the superiority and robustness of the friend-tree is presented.
The R*-tree: an efficient and robust access method for points and rectangles
TLDR
The R*-tree is designed which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory which clearly outperforms the existing R-tree variants.
Similarity indexing with the SS-tree
  • David A. White, R. Jain
  • Computer Science
    Proceedings of the Twelfth International Conference on Data Engineering
  • 1996
TLDR
This work describes the fundamental types of "similarity queries" that should be supported and proposes a new dynamic structure for similarity indexing called the similarity search tree or SS-tree, which performs better than the R*-tree in nearly every test.
Spatial database indices for large extended objects
TLDR
A new tool, called the oversize shelf to improve the performance of tree-based indices by minimizing redundancy, is optimized and evaluated.
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
TLDR
A fast algorithm to map objects into points in some k-dimensional space (k is user-defined), such that the dis-similarities are preserved, and this method is introduced from pattern recognition, namely, Multi-Dimensional Scaling (MDS).
The Grid File: An Adaptable, Symmetric Multikey File Structure
TLDR
This work discusses in detail the design decisions that led to the grid file, present simulation results of its behavior, and compare it to other multikey access file structures.
Efficient Similarity Search In Sequence Databases
TLDR
An indexing method for time sequences for processing similarity queries using R * -trees to index the sequences and efficiently answer similarity queries and provides experimental results which show that the method is superior to search based on sequential scanning.
...
1
2
3
4
5
...