>>>>> "PK" == P Kishor <P> writes: >> As expected, as the table grows, the underlying B-tree >> implementation for SQLite means that the number of disks accesses >> to (a) find, and (b) add a chunk, grows larger and larger. We¹ve >> tested up to 20 million chunks represented in the table: as >> expected performance exponentially decreases as the number of table >> entries grows.
PK> Why don't you use, or at least test, with BerkeleyDB? Since you have PK> only one table, you can hardly benefit from the SQLness of an rdb. If PK> nothing, you will have a point of comparison with another technology, PK> and know for sure if SQLite is the appropriate solution for you. Perhaps http://tokyocabinet.sf.net might be a better choice. David _______________________________________________ sqlite-users mailing list sqlite-users@sqlite.org http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
