0000000000953502
AUTHOR
Mônica Ribeiro Porto Ferreira
Optimisation des requêtes de similarité dans les espaces métriques répondant aux besoins des usagers
The complexity of data stored in large databases has increased at very fast paces. Hence, operations more elaborated than traditional queries are essential in order to extract all required information from the database. Therefore, the interest of the database community in similarity search has increased significantly. Two of the well-known types of similarity search are the Range (Rq) and the k-Nearest Neighbor (kNNq) queries, which, as any of the traditional ones, can be sped up by indexing structures of the Database Management System (DBMS). Another way of speeding up queries is to perform query optimization. In this process, metrics about data are collected and employed to adjust the par…
Integrating user preference to similarity queries over medical images datasets
International audience; Large amounts of images from medical exams are being stored in databases, so developing retrieval techniques is an important research problem. Retrieval based on the image visual content is usually better than using textual descriptions, as they seldom gives every nuances that the user may be interested in. Content-based image retrieval employs the similarity among images for retrieval. However, similarity is evaluated using numeric methods, and they often orders the images by similarity in a way rather distinct from the user's intention. In this paper, we propose a technique to allow expressing the user's preference over attributes associated to the images, so simil…
Algebraic Properties to Optimize kNN Queries
International audience; New applications that are being required to employ Database Management Systems (DBMSs), such as storing and retrieving complex data (images, sound, temporal series, genetic data, etc.) and analytical data processing (data mining, social networks analysis, etc.), increasingly impose the need for new ways of expressing predicates. Among the new most studied predicates are the similarity-based ones, where the two commonest are the similarity range and the k-nearest neighbor predicates. The k-nearest neighbor predicate is surely the most interesting for several applications, including Content-Based Image Retrieval (CBIR) and Data Mining (DM) tasks, yet it is also the mos…