1. Lecture Notes in Computer Science;R. Agrawal,1993
2. An, J., Chen, H., Furuse, K., Ishikawa, M., Ohbo, N.: The convex polyhedra technique: An index strucrture for high-dimensional space. In: Proc. of the 13th Australasian Database Conference, pp. 33–40 (2002)
3. An, J., Chen, H., Furuse, K., Ishikawa, M., Ohbo, N.: A vector-wise dimensionality reduction for indexing high dimensional data. In: Proc. of Pan-Yellw-Sea International Workshop on Information Technologies for Network Era, pp. 135– 142 (2002)
4. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree:an efficient and robust access method for points and rectangles. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 322–331 (1990)
5. Chakrabarti, K., Mehrotra, S.: Locally dimensionality reduction: A new approach to indexing high dimensional spaces. In: Proceedings of 26th International Conference on Very Large Data Bases, pp. 151–162 (2000)