Hi there,
I've just started using extended stats cause the planner was giving me
terrible estimates for a certain table. MCV extended stats solved my
problem when values are in the extended MCV list, but estimates are still
terrible when they are not in the MCV list. Limited as my knowledge of
dat
On 5/1/21 3:59 AM, Wolfgang Rißler wrote:
This is my problem, I completely dont know, how to start compiling my
own actual 32bit libpq on windows (and I would like to do it with VS 2019).
For libpqxx there have been some hints how to do so in the past, and now
there is a complete project, which
Am 30.04.2021 um 16:16 schrieb Tom Lane:
=?UTF-8?Q?Wolfgang_Ri=c3=9fler?= writes:
The problem is, that our application (IDE MS-VisualStudio, C++) has to
be 32bit, because of some old 32bit-dll's, which we cant kick out at the
moment.
So I compiled a libpqxx with the last 32bit libpq (which is v
In case this helps anyone else, I found a simple way to get a rough
idea of what's going on, which is to run:
select (select count(distinct virtualtransaction) from pg_locks) as
tx_with_locks, (select count(*) from pg_stat_activity where state =
'active') as active_tx, (select count(*) from pg_loc
Thanks a lot.
I found out about this Youtube video (https://youtu.be/alJswNJ4P3U?t=1852),
in case you guys are interested.
This video really clarify about the time complixty of MergeSort.
On Sat, May 1, 2021 at 3:19 PM Gavan Schneider
wrote:
> On 1 May 2021, at 17:06, Jian He wrote:
>
> Been sel
On 1 May 2021, at 17:06, Jian He wrote:
Been self study Database, from database I deep dived into sorting
algorithms.
Databases can do in-memory QuickSort. It also has an on-disk
MergeSort.
For MergeSort: I follow this tutorial
https://youtu.be/6pV2IF0fgKY?t=1108
(around 1 minutes only)
Jian He:
On Sat, May 1, 2021 at 9:07 AM Jian He wrote:
> Been self study Database, from database I deep dived into sorting algorithms.
Peek a good book, because that is a hairy topic with lot of math and
other previous knowledge required.
> Databases can do in-memory QuickSort. It also has an o
Been self study Database, from database I deep dived into sorting
algorithms.
Databases can do in-memory QuickSort. It also has an on-disk MergeSort.
For MergeSort: I follow this tutorial https://youtu.be/6pV2IF0fgKY?t=1108
(around 1 minutes only)
But I am still not fully understanding about *nl
