Efficient geometry-based similarity search of 3D spatial databases
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Efficient k-NN search on vertically decomposed data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Automatic Selection and Combination of Descriptors for Effective 3D Similarity Search
ISMSE '04 Proceedings of the IEEE Sixth International Symposium on Multimedia Software Engineering
A pivot-based index structure for combination of feature vectors
Proceedings of the 2005 ACM symposium on Applied computing
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
On fast non-metric similarity search by metric access methods
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Nearest neighbours search using the PM-Tree
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
Dynamic user-defined similarity searching in semi-structured text retrieval
Proceedings of the 3rd international conference on Scalable information systems
New dynamic construction techniques for M-tree
Journal of Discrete Algorithms
Content-based video copy detection
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Improving the performance of M-tree family by nearest-neighbor graphs
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Index-supported similarity search using multiple representations
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Fuzzy Sets and Systems
Rank-mixer and rank-booster: improving the effectiveness of retrieval methods
ICPR'10 Proceedings of the 20th International conference on Recognizing patterns in signals, speech, images, and videos
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Automatic weight selection for multi-metric distances
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Improving 3D similarity search by enhancing and combining 3D descriptors
Multimedia Tools and Applications
Adapting metric indexes for searching in multi-metric spaces
Multimedia Tools and Applications
| Hi-index | 0.00 |
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multi-media databases, an exact search is not meaningful. Thus, much effort has been devoted to develop efficient and effective similarity search techniques. A recent approach, that has been shown to improve the effectiveness of similarity search in multimedia databases, resorts to the usage of combinations of metrics where the desirable contribution (weight) of each metric is chosen at query time. This paper presents the Multi-Metric M-tree (M 3 -tree), a metric access method that supports similarity queries with dynamic combinations of metric functions. The M 3-tree, an extension of the M-tree, stores partial distances to better estimate the weighed distances between routing/ground entries and each query, where a single distance function is used to build the whole index. An experimental evaluation shows that the M 3-tree may be as efficient as having multiple M-trees (one for each).