The general structure and the method of constructing index tree and typical query types in high－dimensional data space are investigated. Analytical comparison among several representative high dimensional indexing methods as K－D－Tree, R－Tree, R;+*－Tree, X－Tree, TV－Tree, Hilbert R－Tree is represented in such aspects as node shape, overlapping, insert principle, division principle and re－insert at the end.