5Aggarwal C C. Re-designing Distance Functions and Dis tance-Based Applications for High Dimensional Data[J]. ACM SIGMOD Record, 2001, 30(1):13-18.
6Aggarwal C C. On the Effects of Dimensionality Reduction on High Dimensional Similarity Search[C]//Proc of the 20th ACM SIGMODSIGACT-SIGART Symp on Principles of Database Systems, 2001 : 256-266.
7Hinneburg, Aggarwal C C, Keim D. What Is the Nearest Neighbor in High Dimensional Spaces? [C]//Proc of the 26th Int'l Conf on Very large Data Bases, 2000:506-515.
8Beyer K, Goldstein J, Ramakrishnan R, et al. When Is Nearest Neighbors Meaningful? [C]//Proc of ICDT'99, 1999:217-235.
9A Guttman. R-Tree: A dynamic index structure for spatial searching. The ACM SIGMOD Int'l Conf on Management of Data, Boston, MA, 1984
10T Sellis, N Roussopoulos, C Faloutsos. The R+ tree: A dynamic index for multidimensional objects. The 13th Int'l Conf on Very Large Data Bases, Brighton, England, 1987
