A retrieval technique for high-dimensional data and partially specified queries
暂无分享,去创建一个
[1] Oliver Günther,et al. Multidimensional access methods , 1998, CSUR.
[2] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[3] Jonathan Goldstein,et al. When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.
[4] Douglas Comer,et al. Ubiquitous B-Tree , 1979, CSUR.
[5] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[6] R. Orlandic,et al. Implementing KDB-trees to support high-dimensional data , 2001, Proceedings 2001 International Database Engineering and Applications Symposium.
[7] Arie Shoshani,et al. Multidimensional indexing and query coordination for tertiary storage management , 1999, Proceedings. Eleventh International Conference on Scientific and Statistical Database Management.
[8] Byunggu Yu,et al. Simple QSF-trees: an efficient and scalable spatial access method , 1999, CIKM '99.
[9] Hans-Peter Kriegel,et al. The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems , 1990, VLDB.
[10] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[11] Hans-Peter Kriegel,et al. The pyramid-technique: towards breaking the curse of dimensionality , 1998, SIGMOD '98.
[12] Beng Chin Ooi,et al. Efficient Indexing of High-Dimensional Data Through Dimensionality Reduction , 2000, Data Knowl. Eng..
[13] J. T. Robinson,et al. The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.
[14] Arie Shoshani,et al. Coordinating simultaneous caching of file bundles from tertiary storage , 2000, Proceedings. 12th International Conference on Scientific and Statistica Database Management.
[15] Kenneth A. Ross,et al. Optimizing selections over datacubes , 2000, Proceedings. 12th International Conference on Scientific and Statistica Database Management.
[16] Chun Zhang,et al. Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.
[17] Volker Markl,et al. Integrating the UB-Tree into a Database System Kernel , 2000, VLDB.
[18] Ricardo A. Baeza-Yates,et al. Expected behaviour of B+-trees under random insertions , 1989, Acta Informatica.
[19] Ramesh C. Jain,et al. Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[20] Alfonso F. Cardenas. Analysis and performance of inverted data base structures , 1975, CACM.
[21] Helen J. Wang,et al. Online aggregation , 1997, SIGMOD '97.
[22] Masatoshi Yoshikawa,et al. The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation , 2000, VLDB.
[23] Hans-Jörg Schek,et al. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.
[24] Christian Böhm,et al. Independent quantization: an index compression technique for high-dimensional data spaces , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).