A cost model for query processing in high dimensional data spaces
ACM Transactions on Database Systems (TODS)
Similarity queries in the DISIMA image DBMS
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Processing a multimedia join through the method of nearest neighbor search
Information Processing Letters
An Efficient Framework for Order Optimization
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Content-based multimedia information retrieval: State of the art and challenges
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
High dimensional nearest neighbor searching
Information Systems
Image retrieval: Ideas, influences, and trends of the new age
ACM Computing Surveys (CSUR)
Large-scale similarity-based join processing in multimedia databases
MMM'12 Proceedings of the 18th international conference on Advances in Multimedia Modeling
| Hi-index | 0.00 |
Commonly used content-based image retrieval systems focus on the problem of finding similar images for a given single query object out of a database of media objects. We consider a similarity-based image join of two image tables, where the image data components are represented by their respective feature vectors. For each image of the first table, similar images are looked up in the second table. Matching tuples are combined. We consider multiple joins which allows one to join a previous join result to another image table, and so on. Thus, each multiple join result tuple contains n images, if n tables are joined. An image of the result tuple is therefore not only similar to the image from its join partner, but also to the image similar to it. In this context, the paper presents processing and optimizing strategies for multiple similarity-based image joins and a cost model for integrating them in a multimedia database. The cost model is validated by an X-tree reference implementation. The presented strategies in this paper are currently been implemented in Oracle Multimedia.