Re: [Dovecot] Search for (any of) multiple terms slow
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1
On Wed, 13 Aug 2008 17:18:37 -0400, Timo Sirainen <tss@iki.fi> wrote:
Heh, I see ;)
As it is, the FTS plugin is quite useless to us though :( most of the time people are doing a (real world) search, they don't remember the exact word they're looking for. For example they only remember that the mail they're looking for contained "English" and "automobile" - or was it "Englisch" and "Automobil", because the mail was in German? So to get a list of all possible mails, they want to make use of the OR connection of search terms...
Requires a lot
more complexity to the code though..
Couldn't Dovecot just search the index with each single word (as it does now without OR), and then merge the results, filtering out double UIDs? This is probably not the most efficient way to solve this, but it would be definitely *much* faster than not using the indexes at all - and doesn't sound too complex to me.
Are there any other not-yet-implemented SEARCH features that don't work with the FTS plugin?
Thanks, Patrick.
STAR Software (Shanghai) Co., Ltd. http://www.star-group.net/ Phone: +86 (21) 3462 7688 x 826 Fax: +86 (21) 3462 7779
PGP key: https://stshacom1.star-china.net/keys/patrick_nagel.asc Fingerprint: E09A D65E 855F B334 E5C3 5386 EF23 20FC E883 A005 -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.9 (GNU/Linux) Comment: http://getfiregpg.org
iEYEARECAAYFAkijga4ACgkQ7yMg/OiDoAUnFwCfXDUDHR+UdlMKkqwn2/nkB61I X3MAn1nK8KVW8RbtzQ6qQGipGb3uMXRa =I8Eh -----END PGP SIGNATURE-----
On Aug 13, 2008, at 8:52 PM, Patrick Nagel wrote:
It would be nice to allow the FTS backend to handle as much of this as
possible. For example with Lucene you could merge several AND/ORs into
a single query. But maybe it's not worth the trouble to do all that
complexity. But at least the OR-only search could be a special case
where all the words are sent to backend. In a mixed AND/OR query then
it could do several queries and merge the results. And sure, it's not
*that* complex but it'll require a few hours of work.
Shouldn't be. Or perhaps things related to header searches could be
better optimized.
participants (2)
-
Patrick Nagel
-
Timo Sirainen