Hi all, Does anyone know of a study which compares access-time on of the various python persistence technIques?
I'm working w. a dynamic dataset of some 3500 tables - each table grows sequentially. Total data ~= 5GB Don't mind if it's a bit awkward - but for a time-critical applic. so needs to be as fast as possible. I haven't been able to find even a simple comparative analysis. Can anyone point me in the right direction? thanks heaps, David _________________________________________________ experimental polymedia: www.avatar.com.au Sonic Communications Research Group, University of Canberra: creative.canberra.edu.au/scrg _______________________________________________ Pythonmac-SIG maillist - Pythonmac-SIG@python.org http://mail.python.org/mailman/listinfo/pythonmac-sig
