IBM Research Report Multidimensional Indexing Structures for Content-based Retrieval
暂无分享,去创建一个
[1] Andrew R. Webb,et al. Multidimensional scaling by iterative majorization using radial basis functions , 1995, Pattern Recognit..
[2] Hans-Peter Kriegel,et al. Techniques for Design and Implementation of Efficient Spatial Access Methods , 1988, VLDB.
[3] Peter N. Yianilos,et al. Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.
[4] Christos Faloutsos,et al. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.
[5] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.
[6] Hans-Peter Kriegel,et al. The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems , 1990, VLDB.
[7] Bernd-Uwe Pagel,et al. Are window queries representative for arbitrary range queries? , 1996, PODS.
[8] S. Meiser,et al. Point Location in Arrangements of Hyperplanes , 1993, Inf. Comput..
[9] Pavel Zezula,et al. Processing M-trees with parallel resources , 1998, Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications.
[10] Yannis Manolopoulos,et al. Overlapping linear quadtrees: a spatio-temporal access method , 1998, GIS '98.
[11] Jack A. Orenstein. Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.
[12] Ekow J. Otoo,et al. A Mapping Function for the Directory of a Multidimensional Extendible Hashing , 1984, VLDB.
[13] T. H. Merrett,et al. A class of data structures for associative searching , 1984, PODS.
[14] Christos Faloutsos,et al. Deflating the dimensionality curse using multiple fractal dimensions , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[15] Ambuj K. Singh,et al. Dimensionality reduction for similarity searching in dynamic databases , 1998, SIGMOD '98.
[16] Christos Faloutsos,et al. QBIC project: querying images by content, using color, texture, and shape , 1993, Electronic Imaging.
[17] Ramesh C. Jain,et al. Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[18] Aris M. Ouksel. The interpolation-based grid file , 1985, PODS '85.
[19] Mireille Régnier,et al. Analysis of grid file algorithms , 1985, BIT.
[20] Nick Roussopoulos,et al. Direct spatial search on pictorial databases using packed R-trees , 1985, SIGMOD Conference.
[21] Haim Mendelson,et al. Analysis of Extendible Hashing , 1982, IEEE Transactions on Software Engineering.
[22] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.
[23] Raymond T. Ng,et al. Evaluating multidimensional indexing structures for images transformed by principal component analysis , 1996, Electronic Imaging.
[24] Jack A. Orenstein. A comparison of spatial query processing techniques for native and parameter spaces , 1990, SIGMOD '90.
[25] B. S. Manjunath,et al. Edge flow: A framework of boundary detection and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[26] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .
[27] Alistair Moffat,et al. Index organization for multimedia database systems , 1995, CSUR.
[28] Edward M. McCreight,et al. Priority Search Trees , 1985, SIAM J. Comput..
[29] W. Torgerson. Multidimensional scaling: I. Theory and method , 1952 .
[30] Bruce F. Naylor,et al. Set operations on polyhedra using binary space partitioning trees , 1987, SIGGRAPH.
[31] Shree K. Nayar,et al. Closest point search in high dimensions , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[32] Haim J. Wolfson,et al. Model-Based Object Recognition by Geometric Hashing , 1990, ECCV.
[33] Kyuseok Shim,et al. High-dimensional similarity joins , 1997, Proceedings 13th International Conference on Data Engineering.
[34] Ekow J. Otoo,et al. Balanced multidimensional extendible hash tree , 1985, PODS.
[35] Gultekin Özsoyoglu,et al. A framework for feature-based indexing for spatial databases , 1994, Seventh International Working Conference on Scientific and Statistical Database Management.
[36] Sameer A. Nene,et al. A simple algorithm for nearest neighbor search in high dimensions , 1997 .
[37] Ramesh C. Jain,et al. Similarity indexing: algorithms and performance , 1996, Electronic Imaging.
[38] Aris M. Ouksel,et al. Storage mappings for multidimensional linear dynamic hashing , 1983, PODS.
[39] Jürg Nievergelt,et al. The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.
[40] J. T. Robinson,et al. The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.
[41] Jeffrey K. Uhlmann,et al. Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..
[42] Joan L. Mitchell,et al. JPEG: Still Image Data Compression Standard , 1992 .
[43] Jirí Matousek,et al. Reporting Points in Halfspaces , 1992, Comput. Geom..
[44] Thomas P. Yunck,et al. A Technique to Identify Nearest Neighbors , 1976, IEEE Transactions on Systems, Man, and Cybernetics.
[45] David B. Lomet,et al. The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.
[46] B. S. Manjunath. Image processing in the Alexandria Digital Library project , 1998, Proceedings IEEE International Forum on Research and Technology Advances in Digital Libraries -ADL'98-.
[47] Kuldip K. Paliwal,et al. Fast K-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding , 1992, IEEE Trans. Signal Process..
[48] Alexander Thomasian,et al. Clustering and singular value decomposition for approximate indexing in high dimensional spaces , 1998, CIKM '98.
[49] Markku Tamminen,et al. The extendible cell method for closest point problems , 1982, BIT.
[50] Qi Yang,et al. MB+-Tree: A New Index Structure for Multimedia Databases , 1995, IW-MMDBMS.