On 2019-04-14 3:58 p.m., Jean-Luc CECCOLI wrote: > When applying a style to many pictures, having the prog reading the files to > and fro must necessarily be slower than accessing them in a row.
perhaps but I don't think that is likely. Unless the images were added in order to a virgin, otherwise blank database they are not going to be in order. Even that assumes that the ordering key is sequential and not generated on some other basis. No, realistically the speed of access is determined by the KEY. If they key is indexed than access is faster. If it is not indexed than it has to be searched for by whatever algorithm. THAT can be slow, since it is going to be dependent on the number of entries. Most database are about information blocks and pointers. The 'rows' have nothing to do with the physical ordering of the information stored in the database. When an entry is created the 'space allocator' returns a pointer to 'some space' according to whatever algorithm the designer chose. > And, even with "only" 23k photos, it might save me some time Having the right index for your mode of access is what will save time. IIR there was another thread recently about adding indexes to the database. Pascal Obry 2019-03-10 Re: [darktable-user] darktable 2.6 on Windows, performance issues with large database You may have to figure out what index fields you need and how to apply the 'search' for them. -- "Too many preachers use the bible as a stepladder for their soapbox." -- John Tandervold ____________________________________________________________________________ darktable user mailing list to unsubscribe send a mail to [email protected]
