Am Tue, 13 Jun 2017 10:17:53 -0400 (EDT) schrieb wie...@porcupine.org (Wietse Venema):
> Patrick Ben Koetter: > > > > At which message throughput rate will this make a difference? > > > > > > Always. Because you're replacing hashing with linear search. > > > > If you compare hashing to linear search, yes. But I am not sure > > this is what the OPs question was about? > > > > He wrote "would it be faster to have several smaller files (...) or > > have one giant file". The way I understood it, he would not compare > > hashing vs. linear search, but many small(er) hashed maps vs. one > > large hashed map. > @Patrick: You understood me correctly there > You are doing N/2 table lookups to find the table that contains the > data. That is, you're doing linear search on top of hashing. > > Wietse @Wietse: N/2 is a little pessimistic, but thats only because I know the makeup of my mailboxes… 90% of it is in one virtual domain and that would of course be the first file I take a look at. The other files would be sorted descending by relevance. Anyway, I am going for a single big file now. I assume its not a problem that this map is 40MB big? Julian -- --------------------------------------------------------- | | Julian Kippels | | M.Sc. Informatik | | | | Zentrum für Informations- und Medientechnologie | | Heinrich-Heine-Universität Düsseldorf | | Universitätsstr. 1 | | Raum 25.41.O1.36 | | 40225 Düsseldorf / Germany | | | | Tel: +49-211-811-4920 | | mail: kipp...@hhu.de | | jabber: jukip...@xmpp.hhu.de ---------------------------------------------------------
