time-consuming insert operation
-
Let's say you have a table with an index on the field "username". Is it true that eventually you'll have some really time-consuming inserts when the hash table has to resize itself? Hash table resize is O(n), I think. Thanks.
INSERT is costly if there's a lot of indexes. It is not that much about resizing, there's usually a lot of free spare space in a DB and hardly anything needs resizing. If you can come up with a better strategy than indexes, I'd love to hear it.
Bastard Programmer from Hell :suss: "If you just follow the bacon Eddy, wherever it leads you, then you won't have to think about politics." -- Some Bell.
-
Let's say you have a table with an index on the field "username". Is it true that eventually you'll have some really time-consuming inserts when the hash table has to resize itself? Hash table resize is O(n), I think. Thanks.
-
Let's say you have a table with an index on the field "username". Is it true that eventually you'll have some really time-consuming inserts when the hash table has to resize itself? Hash table resize is O(n), I think. Thanks.
On proposition yes, the control theory is abjugated to be a "Leris" account, or divinity of conspiracy, of demand, as pax Ti. eg matter as created as opposed to matter, as repleted, computer science, or applied, even theoretical.
-
Let's say you have a table with an index on the field "username". Is it true that eventually you'll have some really time-consuming inserts when the hash table has to resize itself? Hash table resize is O(n), I think. Thanks.