[Pytables-users] Speed of in-kernel Full-Table Search

[Wagner S. <Seb...@ai...>]

Dear PyTables-Users,

For testing purposes I use a PyTables DB with 4 columns (1x Uint8 and 3xFloat) with 750k rows, the total file size about 90MB. As the free version does no support indexing I thought that a search (full-table) on this database would last a least one or two seconds, because the file has to be loaded first (throttleneck I/O), and then the search over ~20k rows can begin. But PyTables took only 0.05 seconds for a full table search (in-kernel, so near C-speed, but nevertheless full table), while my bisecting algorithm with a precomputed sorted list wrapped around PyTables (but saved in there), took about 0.5 seconds.

So the thing I don't understand: How can PyTables be so fast without any Indexing?

I'm using 3.0.0rc2 coming with WinPython

Regards,
Sebastian