Karol Bieniaszewski

Hi it is rather exception that in query: ```SQL select * from t1 where t1.fld1 in (select fld2 from t2); ``` t2 will be bigger then t1. So join order...

>> They could be views or table expressions. This does not change the assumption that `t2` is smaller than `t1` ;-)

Why is it looping to wipe byte by byte? This should be done by preallocating three "static" pages: the first filled with 0x00, the second with 0xFF, and the third...

> The optimizer cannot detect that value 42 matches the index range, as expressions are not evaluated at compile time. You need to specify that explicitly: > > `SELECT *...

What do you mean be better index? ```SQL SELECT D.DYR_ID FROM DYREKCJA D WHERE NOT EXISTS(SELECT * FROM ROZLICZENIE RL WHERE RL.DYR_ID=D.DYR_ID) ``` PLAN (RL INDEX (FK_ROZLICZENIE__DYREKCJA)) PLAN (D NATURAL)...

> [@livius2](https://github.com/livius2) in reply to your message: > > > What do you mean be better index?... > > Add 1 million records to the "changelog", then add 10 millions...

> I don't think that this is useful for domains or table columns. But it is useful for reducing the amount of code and parameters between stored procedures. Good feature,...

Nice analysis, I pray that the second sort will be less performance-intensive as the data is already sorted

> By description - it is not "connectionless", it is "restorable" or "resumable" or "re-attachable". yes, you have right, but in database world it is near connectionless ;-) > How...

In fact, even a few hours is too much. The normal scenario is that the interruption lasts a maximum of a few seconds, and perhaps even providing a token as...