Thread
Commits
-
Remove <@ from contrib/intarray's GiST operator classes.
- 20e7e1fe3164 14.0 landed
-
Fix intarray's GiST opclasses to not fail for empty arrays with <@.
- ced272d2de7e 9.5.20 landed
- 614119d00306 9.4.25 landed
- efc77cf5f1de 13.0 landed
- e519eded6530 9.6.16 landed
- 5b3e6c13f753 10.11 landed
- 2f76f4182935 12.0 landed
- 113b3d903b34 11.6 landed
-
intarray GiST index gets wrong answers for '{}' <@ anything
Tom Lane <tgl@sss.pgh.pa.us> — 2019-08-06T17:55:41Z
While looking at the pending patch for faster GIN index searches on no-key queries, I was motivated to improve contrib/intarray's regression test to exercise the GIN_SEARCH_MODE_ALL case, because it didn't. And then I thought well, let's try to bring the code coverage of _int_gin.c up to something respectable, which led me to the regression test additions shown in the attached. And I was astonished to observe that the GiST index cases mostly got the wrong answer for the <@ query. Sometimes they got the right answer, but mostly not. After some digging I saw that the problem was that there are a number of empty arrays ('{}') in the data, and those should surely all match the WHERE a <@ '{73,23,20}' condition, but the GiST opclasses were not reliably finding them. The reason appears to be that the condition for descending through a non-leaf index key for the RTContainedBy case is incorrectly optimistic: it supposes that we only need to descend into subtrees whose union key overlaps the query array. But this does not guarantee to find subtrees that contain empty-array entries. Worse, such entries could be anywhere in the tree, and because of the way that the insertion penalty is calculated, they probably are. (We will compute a zero penalty to add an empty array item to any subtree.) The reason it sometimes works seems to be that GiST randomizes its insertion decisions when there are equal penalties (cf gistchoose()), and sometimes by luck it puts all of the empty-array entries into subtrees that the existing rule will search. So as far as I can see, we have little choice but to lobotomize the RTContainedBy case and force a whole-index search. This applies to both the gist__int_ops and gist__intbig_ops opclasses. This is pretty awful for any applications that are depending on such queries to be fast, but it's hard to argue with "it gets the wrong answer, and not even reproducibly so". In the future we might think about removing <@ from these opclasses, or making a non-backward-compatible change to segregate empty arrays from everything else in the index. But neither answer seems very back-patchable, and I'm not really sure I want to put so much work into a second-class-citizen contrib module anyway. Comments? regards, tom lane -
Re: intarray GiST index gets wrong answers for '{}' <@ anything
Alexander Korotkov <a.korotkov@postgrespro.ru> — 2019-08-06T18:18:41Z
Hi! On Tue, Aug 6, 2019 at 8:56 PM Tom Lane <tgl@sss.pgh.pa.us> wrote: > The reason appears to be that the condition for descending through a > non-leaf index key for the RTContainedBy case is incorrectly optimistic: > it supposes that we only need to descend into subtrees whose union key > overlaps the query array. But this does not guarantee to find subtrees > that contain empty-array entries. Worse, such entries could be anywhere > in the tree, and because of the way that the insertion penalty is > calculated, they probably are. (We will compute a zero penalty to add > an empty array item to any subtree.) The reason it sometimes works > seems to be that GiST randomizes its insertion decisions when there are > equal penalties (cf gistchoose()), and sometimes by luck it puts all > of the empty-array entries into subtrees that the existing rule will > search. Right, existing logic could work correctly, when dataset contains no empty arrays. But it clearly doesn't handle empty arrays. > So as far as I can see, we have little choice but to lobotomize the > RTContainedBy case and force a whole-index search. This applies to > both the gist__int_ops and gist__intbig_ops opclasses. This is > pretty awful for any applications that are depending on such queries > to be fast, but it's hard to argue with "it gets the wrong answer, > and not even reproducibly so". +1 for pushing this > In the future we might think about removing <@ from these opclasses, > or making a non-backward-compatible change to segregate empty arrays > from everything else in the index. But neither answer seems very > back-patchable, and I'm not really sure I want to put so much work > into a second-class-citizen contrib module anyway. +1 for removing <@ from opclasses. Trying to segregate empty arrays looks like invention of new opclass rather than bugfix for current one. One, who is interested in this piece of work, can implement this new opclass. Users, who likes existing behavior of handling <@ operator in intarray opclasses, may be advised to rewrite their queries as following. "col <@ const" => "col <@ const AND col && const" New queries would have opclass support and handle non-empty arrays in the same way. It will be slightly slower because of evaluation of two operators instead of one. But this doesn't seem critical. ------ Alexander Korotkov Postgres Professional: http://www.postgrespro.com The Russian Postgres Company
-
Re: intarray GiST index gets wrong answers for '{}' <@ anything
Tom Lane <tgl@sss.pgh.pa.us> — 2019-08-06T18:42:46Z
Alexander Korotkov <a.korotkov@postgrespro.ru> writes: > Users, who likes existing behavior of handling <@ operator in intarray > opclasses, may be advised to rewrite their queries as following. > "col <@ const" => "col <@ const AND col && const" Oh, that's a good suggestion --- it will work, and work reasonably well, with either unpatched or patched intarray code; and also with some future version that doesn't consider <@ indexable at all. regards, tom lane