Le 15 sept. 2017 20:05, "Stefan Ram" <r...@zedat.fu-berlin.de> a écrit :
When one is building an in-memory database that has a single
table that is built at the start of the program and then one
writes some complex queries to the table, what can be expected
to be faster:
- implementing the table as a builtins.list of builtins.tuples
with builtins.dicts as indexes for faster lookups and
additional sorted builtins.lists for sorted "views" on the
table
- implementing the table as a database table in sqlite3
(":memory:") and using SQL commands for insertion
There is other solutions like shelve mentioned previously or plyvel (easy
api) or my preferred wiredtiger. But the issue with maintenance costs is
still valid. Choose the later if nothing else works.
--
https://mail.python.org/mailman/listinfo/python-list
