Approximate Algorithms for Distance-Based Queries in High-Dimensional Data Spaces Using R-Trees

@inproceedings{Corral2002ApproximateAF,
  title={Approximate Algorithms for Distance-Based Queries in High-Dimensional Data Spaces Using R-Trees},
  author={Antonio Corral and Joaqu{\'i}n Ca{\~n}adas and Michael Vassilakopoulos},
  booktitle={ADBIS},
  year={2002}
}
In modern database applications the similarity or dissimilarity of complex objects is examined by performing distance-based queries (DBQs) on data of high dimensionality. The R-tree and its variations are commonly cited multidimensional access methods that can be used for answering such queries. Although, the related algorithms work well for low-dimensional data spaces, their performance degrades as the number of dimensions increases (dimensionality curse). In order to obtain acceptable… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS
10 Citations
16 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Kriegel; “A Cost Model and Index Architecture for the Similarity Join

  • H.P.C. Bohm
  • Proceedings IEEE ICDE Conference,
  • 2001
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…