Aumento da Eficiência das Estruturas de Indexação Métricas com Uso de Conceitos da Lógica Nebulosa

The retrieval of complex data e.g. image, audio, video, genomic sequences etc. in Database Management Systems (DBMSs) has been in the focus of the academic community and of DBMSs developers. The most promising technique is the content-based search, in which a set of descriptors with high discrimination power is extracted from each data element, and a feature vector is obtained and used to index the data to fasten the search operations. The feature vectors are data in high dimensional spatial domains or metric domains, and its indexing requires the use of appropriate indexing structures. The most promising structures are the ones for metric domains, e.g. the M-tree, the Slim-tree, the OMNI-Family and the DF-tree. This paper shows that it is possible to enhance the performance of these structures by using Fuzzy Logic concepts, through an algorithm that uses more than one parameter to define how the most appropriate subtree must be chosen in insertion operations. Doing so, the construction of these structures is more “intelligent”, in other words, closer to human analysis and perception. Experiments with the proposed algorithm show that its performance is noticeably better than other existing structures found in literature at structure construction and performing of similarity queries.

[1]  Peter N. Yianilos,et al.  Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.

[2]  Christos Faloutsos,et al.  Fast Indexing and Visualization of Metric Data Sets using Slim-Trees , 2002, IEEE Trans. Knowl. Data Eng..

[3]  Z. Meral Özsoyoglu,et al.  Distance-based indexing for high-dimensional metric spaces , 1997, SIGMOD '97.

[4]  Jeffrey K. Uhlmann,et al.  Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..

[5]  Walter A. Burkhard,et al.  Some approaches to best-match file searching , 1973, Commun. ACM.

[6]  Christos Faloutsos,et al.  How to improve the pruning ability of dynamic metric access methods , 2002, CIKM '02.

[7]  Hyeran Byun,et al.  Image retrieval using flexible image subblocks , 2000, SAC '00.

[8]  Sergey Brin,et al.  Near Neighbor Search in Large Metric Spaces , 1995, VLDB.

[9]  Christos Faloutsos,et al.  Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes , 2000, EDBT.

[10]  Ricardo A. Baeza-Yates,et al.  Proximity Matching Using Fixed-Queries Trees , 1994, CPM.

[11]  Pavel Zezula,et al.  M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

[12]  Christos Faloutsos,et al.  Similarity search without tears: the OMNI-family of all-purpose access methods , 2001, Proceedings 17th International Conference on Data Engineering.

[13]  Shih-Fu Chang,et al.  Image Retrieval: Current Techniques, Promising Directions, and Open Issues , 1999, J. Vis. Commun. Image Represent..

[14]  Hugh E. Williams,et al.  Indexing and Retrieval for Genomic Databases , 2002, IEEE Trans. Knowl. Data Eng..

[15]  Marco Patella,et al.  The M2-tree: Processing Complex Multi-Feature Queries with Just One Index , 2000, DELOS.