3 ms·
The most important and overlooked characteristic is that most RDBMS use b-tree for their table-space, meaning all the operations (including search / lookup) are
by tonymet 7y ago
The most important and overlooked characteristic is that most RDBMS use b-tree for their table-space, meaning all the operations (including search / lookup) are O(log n). For online (OLTP) applications, this means you will have to shard sooner or later (assuming your audience is growing)
- mtVessel 7y agoI agree with your first statement, but could you explain how b-trees logically lead to sharding (at some growth point)? What storage structure doesn't lead to sharding eventually?