3 ms·
I don’t know exactly how to represent that in Big O, but I think it would look something like O(WTFxN). If WTF is a constant, then O(WTFxN) == O(kN) == O(N)
by stcredzero 10y ago
I don’t know exactly how to represent that in Big O, but I think it would look something like O(WTFxN).
If WTF is a constant, then O(WTFxN) == O(kN) == O(N)
- vog 10y agoI don't think the author meant "WTF" to be a constant. It was defined to be whatever complexity index creation has. However, I still disagree with "O(WTF*N)", because "WTF" almost certainly depends of the number of rows in the table (large tables take longer to index than small tables), and that number becomes lower in the multi-tenancy approach, because the individual tables are smaller.