https://bugs.kde.org/show_bug.cgi?id=375700
Mario Frank <mario.fr...@uni-potsdam.de> changed: What |Removed |Added ---------------------------------------------------------------------------- CC| |mario.fr...@uni-potsdam.de --- Comment #3 from Mario Frank <mario.fr...@uni-potsdam.de> --- Hi Jens, This is a known problem. If the similarity range is too big or the minimum similarity too low, the process takes much time. And the application becomes unresponsive since the image signatures are located in the core DB currently. Thus, everything that wants to access the core DB is slowed down extremely. We will have to migrate everything concerning fuzzy search and duplicates search into a dedicated database. This would give us the opportunity to make searches in background easier. The search result you see is just a virtual album which is loaded every time you visit it. Thus, we cannot do it in background currently. Limiting the search by time is formally no good approach, I think. If we limit the time, we can only scan a limited amount of images. The result would be that images that would be scanned later and have a higher similarity would not be shown. Just because of timing constraints. I would now re-introduce a lower similarity bound for fuzzy and similarity searches. This bound was 40 %. And frankly said, I would not use fuzzy search with similarities lower than 40 % myself. The probability that images have such a low similarity is quite high. -- You are receiving this mail because: You are watching all bug changes.