A Study of Spatial Clustering techniques
暂无分享,去创建一个
[1] Paul G. Sorenson,et al. Algorithms for BD trees , 1986, Softw. Pract. Exp..
[2] Hanan Samet,et al. Hierarchical Spatial Data Structures , 1989, SSD.
[3] J. T. Robinson,et al. The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.
[4] Christos Faloutsos,et al. Gray Codes for Partial Match and Range Queries , 1988, IEEE Trans. Software Eng..
[5] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[6] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[7] T. H. Merrett,et al. A class of data structures for associative searching , 1984, PODS.
[8] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .
[9] Christos Faloutsos,et al. Fractals for secondary key retrieval , 1989, PODS.
[10] Klaus H. Hinrichs,et al. Implementation of the grid file: Design concepts and experience , 1985, BIT.
[11] Jürg Nievergelt,et al. The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.
[12] H. V. Jagadish,et al. Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.
[13] Jack A. Orenstein. Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.