I don't see much interest in insert-efficient indexes. These are the ones I've
- LSM-tree (used by Cassandra and SQLite4?)
- Fractal indexes (TokuDB, patented)
While I understand that b*trees are still the best compromise in
insertion/search speed, disk size, concurrency, and more in general in OLTP
workloads, they are useless when it comes to insertion in big data tables (>50M
rows) of random values (not ordered values).
I would like to know if the lack of development in this area (not only in
Postgresql, but in databases in general) is due to:
1) complex implementation
2) poor search performance
3) poor concurrency performance
4) not interesting for most users
5) something else???
I thought this was going to change due to the fast-insertion speeds needs of
"Social Applications", but only TokuDB seems to be the only "successful" player
in the area (I don't know how much of it is due to good marketing). Most other
DB technology claims faster insertion speed (MongoDB and the like...) but in
the end they rely on the old b*tree + sharding instead of using different
indexing mechanisms (with the exception of Cassandra).
Thank you in advance
Sent via pgsql-hackers mailing list (email@example.com)
To make changes to your subscription: