On 13 Jan 2016, at 7:36pm, Warren Young <wyml at etr-usa.com> wrote:
> On Jan 13, 2016, at 5:29 AM, Simon Slavin <slavins at bigfraud.org> wrote: > >> My only concern with what you wrote is that you mention 100 tables. In >> order to find the table you specify SQLite has to go through a list of >> (hashed, I think) table names, and going through an average of 50 of them >> per command can be slow. > > Wouldn?t that be log2(100) = 6.6 or log(100 = 4.6 maximum node visits? > > Most hash table implementations have logarithmic lookup time, not linear. You're quite right. I wrote "50" first, then I remembered that the list was hashed. Thanks for the correction. Simon.
