A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
When dealing with large quantities of clauses, the use of persistent knowledge is inevitable, and indexing methods are essential to answer queries efficiently. We introduce PerKMan...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
In this paper we present the design and implementation of a distributed index architecture to facilitate metadata discovery on large networks. Many current information discovery s...
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
In this paper, we tackle the problem of matching of objects in video in the context of the rough indexing paradigm. The approach developed is based on matching of region adjacency...
F. Chevalier, Jean-Philippe Domenger, Jenny Benois...