Home Original page

Data/File Structure and Algorithm for Retrieving Sorted Data Chunk Efficiently

Alex Martelli aleaxit at yahoo.com
Fri Oct 8 11:52:37 EDT 2004 
On 2004 Oct 08, at 17:38, Josiah Carlson wrote:
    ...
> I would hope that bsddb keeps track of tree location information in an
> intelligent way, so even if it is slower, it still beats a flat text
> file hands-down.
>
> It would likely not beat a real dbms, but it all depends on if the
> original poster finds that necessary.

Hmmmm -- I could be wrong, but doesn't MySql _use_ bsddb as its lower 
level at least for some kinds of tables?  Yet (for simple query) the 
vox populi has it "faster" than "real dbms"s... just wondering aloud...


Alex
More information about the Python-list mailing list