The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences. Vol. XXXVII. Part B4. Beijing 2008 
114 
REFERENCES 
Antomn Guttman, 1984. R-trees: a dynamic index structure for 
spatial searching. Proc. ACM SIGMOD Int. Conf. on 
Management of Data, Boston,MA, pp.47-57 
Benjamin Bustos, 2006. Dynamic Similarity Search in Multi- 
Metric Spaces. MIR’06. Santa Barbara, California, USA. pp. 
137-146. 
Beomseok Nam, 2004. A Comparative Study of Spatial 
Indexing Techniques for Multidimensional Scientific Datasets. 
Proc. of the I6' h Int. Conf. on Scientific and Statistical 
Database Management (SSDBM’04). pp. 171-180 
Christian Bohm, 2001. Searching in high-dimensional spaces: 
Index structures for improving the performance of multimedia 
databases. ACM Computing Surveys, 33(3), pp. 322-373 
Christian M.Garcia-Arellano, 2002. Quantization Techniques 
for Similarity Search in High-Dimensional Data Spaces. Ph.D 
thesis. University of Toronto, Toronto, Japan. 
C. Train Jr.,2000. Slim-Trees: High Performance Metric Trees 
Minimizing Overlap Between Nodes. International Conference 
on Extending Database Technologh(EDBT) 2000. Konstanz, 
Germany, pp. 51-65. 
Cui Jiangtao, 2005. Research on Vector Approximation Method 
in High-dimensional Index Technology. Ph.D thesis. Xidian 
University, Xi’an, China. 
David A. White, 1996. Similarity Indexing with the SS-tree. 
Proc. 12 th Int. Conf. on Data Engineering, New Orleans, LA. 
pp. 516-523. 
Dong Daoguo, 2005. Research on High-dimensional data index 
structures. Ph.D thesis. Fudan University, Shanghai, China. 
Edgar Chavez, 2001. Searching in Metric Spaces. ACM 
Computing Surveys. 33(3), pp. 273-321. 
Gisli R Hjaltason, 2003. Index-Driven Similarity Search in 
Metric Spaces. ACM Transactions on Database Systems. 28(4), 
517-580. 
Gonzalo Navarro, 2002. Searching in metric spaces by spatial 
approximation. The VLDB Journal 11, pp. 28-46 
Gang Qian, 2006. Dynamic Indexing for Multidimensional 
Non-ordered Discrete Data Spaces Using a Data-Partitioning 
Approach. ACM Transactions on Database Systems, 32(2), 
pp.439-484 
Guang-Ho Cha, 2002. An efficient indexing method for nearest 
neighbor searches in high-dimensional image databases. IEEE 
Transactions on multimedia, 4(1), pp. 76-87 
Hakan Ferhatosmanoglu, 2000. Vector Approximation based 
Indexing for Non-uniform High Dimensional Data Sets. ACM 
Int. Conf. on Information and Know-ledge Management. New 
York: ACM Press. New York, NY USA, pp. 202-209 
Jinhua Li, 2001. Efficient similarity search based on data 
distribution properties in high dimensions. Ph.D thesis. 
Michigan: Michigan State University. 
King-lp Lin, 1994. The TV-tree: An Index Structure for High- 
Dimensional Data. VLDB Journal, 3, pp. 517-542. 
Norio Katayama, 1997. The SR-tree: An Index Structure For 
High-Dimensional Nearest Neighbor Queries. Proc. ACM 
SIGMOD Int. Conf. on Management of Data, pp. 369-280. 
Norbert Beckmann, 1990. The R*-tree: An Efficient and Robust 
Access Method fro Points and Rectangles. Proc. ACM 
SIGMOD Int. Conf. on Management of Data, Atlantic City,NJ, 
pp.322-331. 
Paolo Ciaccia, 1997. M-Tree: An Efficient Access Method for 
Similarity Search in Metric Spaces. Proceedings of the 23rd 
International Conference on Very Large Databases (VLDB ’97). 
San Francisco, USA, pp. 426-435. 
Roger Weber, 1998. A quantitative analysis and performance 
study for similarity search in high dimensional spaces. 
Proceedings of the 24th International Conference ,on Very 
Large Data Bases (VLDB'98). NewYork,USA, pp. 194-205. 
Stefan Berchtold, 1996. The X-tree: An Index Structure For 
High-Dimensional Data. VLDB’96. Mumbai, India, pp. 28-39. 
Stefan Berchtold, 2000. H V Jagadish. Independent 
QuantizatiomAn Index Compression Technique for High- 
Dimensional Data Spaces. San Diego: Proc. of the 16th Int. Conf. 
on Data Engineering (ICDE'00). Ca California: IEEE Computer 
Science Society Press. California, USA pp.577-588. 
Timos Sellis, 1987. The R+-tree: a dynamic index for multi 
dimensional objects. VLDB'87. Brighton, England, pp.507-518. 
Tolga Bozkaya, 1997. Distance Based Indexing for High 
Dimensional Metric Spaces. ACM SIGMOD Record. 26(2), pp. 
357-368 
Tolga Bozkaya, 1999. Indexing Large Metric Spaces for 
Similarity Search Queries. ACM Transactions on Database 
Systems. 24(3), pp. 361-404. 
Xiaodong Fu, 1997. GPR-tree: A Global Parallel Index 
Structure for Multiattribute Declustering on Cluster of 
Workstations. Proc. of the 1997 Advances in Parallel and 
Distributed Computing Conference (APDC’97). pp. 300-306 
Ye Hangjun, 2003. Research on Indexing and Retrieval 
Techniques in Large-Scale Image Database. Ph.D thesis. 
Beijing: Tsinghua University. 
Yue Li, 2004. Efficient similarity in high-dimensional data 
spaces. Ph.D thesis. New Jersey: New Jersey Institute of 
Technology. 
ACKNOWLEDGEMENTS 
This work was supported by a grant from the National High 
Technology Research and Development Program of China (863 
Program) (No.2007AA12Z201) and the National Key 
Technologies Research and Development Program of China 
(No.2006BAB 10B03).