Infrared and Laser Engineering, Volume. 31, Issue 1, 77(2002)
Study on the index of high dimensional data space
References(5)
[1] [1] Guttman A. R-Trees: A Dynamic Index Structure for Spatial Searching[A]. Proc. ACM SIGMOD Int. Conf. on Management of Data[C]. Boston, MA, 1984. 47-57.
[2] [2] Beckmann N, Kriegel H P, Schneider R, et al. The R-Tree: An Efficient Robust Access Method for Points and Rectangles[A]. Proc. ACM SIGMOD Int. Conf. on Management of Data[C]. Atlantic City, NJ, 1990. 322-331.
[3] [3] Berchtold S, Keim D, Kriegel H P. The X-Tree: An Index Structure for High-Dimensional Data[A]. 22nd Conf. on Very Large Databases[C]. Bombay, India, 1996. 28-39.
[4] [4] Lin K, Jagadish H V, Faloutsos C. The TV-Tree: An Index Structure for High-Dimensional Data[J]. VLDB Journal, 1995, 3:517-542.
[5] [5] Kamel I, Faloutsos C. Hilbert R-tree: An Improved R-Tree Using Fractals[A]. Proc. 20th Int. Conf. on Very Large Databases[C]. 1994. 500-509.
Tools
Get Citation
Copy Citation Text
[in Chinese], [in Chinese]. Study on the index of high dimensional data space[J]. Infrared and Laser Engineering, 2002, 31(1): 77
Paper Information
© Copyright 2018-2021 | Chinese Laser Press.
All Rights Reserved 沪ICP备15018463号-20