A geometric framework for modelling similarity search
<|reference_start|>A geometric framework for modelling similarity search: The aim of this paper is to propose a geometric framework for modelling similarity search in large and multidimensional data spaces of general nature, which seems to be flexible enough to address such issues as analysis of complexity, indexability, and the `curse of dimensionality.' Such a framework is provided by the concept of the so-called similarity workload, which is a probability metric space $\Omega$ (query domain) with a distinguished finite subspace $X$ (dataset), together with an assembly of concepts, techniques, and results from metric geometry. They include such notions as metric transform, $\e$-entropy, and the phenomenon of concentration of measure on high-dimensional structures. In particular, we discuss the relevance of the latter to understanding the curse of dimensionality. As some of those concepts and techniques are being currently reinvented by the database community, it seems desirable to try and bridge the gap between database research and the relevant work already done in geometry and analysis.<|reference_end|>
@article{pestov1999a,
    title={A geometric framework for modelling similarity search},
    author={Vladimir Pestov},
    journal={Proc. 10-th Int. Workshop on Database and Expert Systems
  Applications (DEXA'99), Sept. 1-3, 1999, Florence, Italy, IEEE Comp. Soc.,
  pp. 150-154.},
    year={1999},
    doi={10.1109/DEXA.1999.795158},
    number={RP-99-12, School of Math and Comp Sci, Victoria University of
  Wellington, New Zealand},
    archivePrefix={arXiv},
    eprint={cs/9904002},
    primaryClass={cs.IR cs.DB cs.DS}
}