Index Clustering for High-Performance Sequential Index Access
暂无分享,去创建一个
[1] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[2] Peter Widmayer,et al. The LSD tree: spatial access to multidimensional and non-point objects , 1989, VLDB 1989.
[3] Bernhard Seeger,et al. A Generic Approach to Bulk Loading Multidimensional Index Structures , 1997, VLDB.
[4] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[5] Jeffrey Scott Vitter,et al. Faster methods for random sampling , 1984, CACM.
[6] Andreas Henrich,et al. The LSD/sup h/-tree: an access structure for feature vectors , 1998, Proceedings 14th International Conference on Data Engineering.
[7] Bernd-Uwe Pagel,et al. Towards an analysis of range query performance in spatial data structures , 1993, PODS '93.
[8] Jeffrey Scott Vitter,et al. Random sampling with a reservoir , 1985, TOMS.
[9] Dragutin Petkovic,et al. Query by Image and Video Content: The QBIC System , 1995, Computer.
[10] Oliver Günther,et al. Multidimensional access methods , 1998, CSUR.
[11] David B. Lomet,et al. A simple bounded disorder file organization with good performance , 1988, TODS.
[12] Christos Faloutsos,et al. Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension , 1994, PODS.
[13] Patrick E. O'Neil. TheSB-tree an index-sequential structure for high-performance sequential access , 2005, Acta Informatica.
[14] Witold Litwin,et al. The bounded disorder access method , 1986, 1986 IEEE Second International Conference on Data Engineering.
[15] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[16] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .