{"shas":[["469a1087e26fb4e17db9449c05fd9b0df2ab5b0c","c50e6bf7013fce877ffb25104d778a36de31e297@gmx.net","Remove README.mb.big5 and README.mb.jp\n\nThey were wildly outdated.","Peter Eisentraut"],["a99d45b805ae3ca230d54222fd25a020fcaa6d5c","c50e6bf7013fce877ffb25104d778a36de31e297@gmx.net","Small update on suggested startup file locations\n\nDebian/Ubuntu don't have a /etc/rc.d/ directory, so add some\nalternative names as suggestions.","Peter Eisentraut"],["f4678c205ab1394a5f0e4fe219027b26a507d941","c50e6bf7013fce877ffb25104d778a36de31e297@gmx.net","Set information_schema.routines.is_udt_dependent to NO\n\nIt previously said YES, but that is incorrect.","Peter Eisentraut"],["c529f8800e33bc969a9e5ce18294930837f279a2","3c84f0de6f8a0f296d36cdd9f57fa166641c96b1@alvh.no-ip.org","Fix broken markup","Alvaro Herrera"],["f3ff0433ab32fdc69da3c8f8e691ef6b4366559c","ffeaa947aef224da9ba99b6a18bdd74288df0e3e@sss.pgh.pa.us","In planner, don't assume that empty parent tables aren't really empty.\n\nThere's a heuristic in estimate_rel_size() to clamp the minimum size\nestimate for a table to 10 pages, unless we can see that vacuum or analyze\nhas been run (and set relpages to something nonzero, so this will always\nhappen for a table that's actually empty).  However, it would be better\nnot to do this for inheritance parent tables, which very commonly are\nreally empty and can be expected to stay that way.  Per discussion of a\nrecent pgsql-performance report from Anish Kejariwal.  Also prevent it\nfrom happening for indexes (although this is more in the nature of\ndocumentation, since CREATE INDEX normally initializes relpages to\nsomething nonzero anyway).\n\nBack-patch to 9.0, because the ability to collect statistics across a\nwhole inheritance tree has improved the planner's estimates to the point\nwhere this relatively small error makes a significant difference.  In the\nreferenced report, merge or hash joins were incorrectly estimated as\ncheaper than a nestloop with inner indexscan on the inherited table.\nThat was less likely before 9.0 because the lack of inherited stats would\nhave resulted in a default (and rather pessimistic) estimate of the cost\nof a merge or hash join.","Tom Lane"],["1be9cdf6aa635a038b37076c29943b7cb262eb4b","9ae9c44b775ee9b29f4f502415e02e61a9b1a6a0@momjian.us","In docs, start window function sentence with \"The asterisk (*)\" rather\nthan \"*\";  it is confusing to start a sentence with a symbol.","Bruce Momjian"],["bc175eb8051510a3edd2a561fcfac476e511177c","ac1e0af1ee8efe15f889b38482e897ff7d0f0432@iki.fi","Fix two ancient bugs in GiST code to re-find a parent after page split:\n\nFirst, when following a right-link, we incorrectly marked the current page\nas the parent of the right sibling. In reality, the parent of the right page\nis the same as the parent of the current page (or some page to the right of\nit, gistFindCorrectParent() will sort that out).\n\nSecondly, when we follow a right-link, we must prepend, not append, the right\npage to our list of pages to visit. That's because we assume that once we\nhit a leaf page in the list, all the rest are leaf pages too, and give up.\n\nTo hit these bugs, you need concurrent actions and several unlucky accidents.\nAnother backend must split the root page, while you're in process of\nsplitting a lower-level page. Furthermore, while you scan the internal nodes\nto re-find the parent, another backend needs to again split some more internal\npages. Even then, the bugs don't necessarily manifest as user-visible errors\nor index corruption.\n\nWhile we're at it, make the error reporting a bit better if gistFindPath()\nfails to re-find the parent. It used to be an assertion, but an elog() seems\nmore appropriate.\n\nBackpatch to all supported branches.","Heikki Linnakangas"],["8d260911e8de9c3e55bfcc4b4b9f0b5848a5c9f7","ac1e0af1ee8efe15f889b38482e897ff7d0f0432@iki.fi","Change the way the offset of downlink is stored in GISTInsertStack.\nGISTInsertStack.childoffnum used to mean \"offset of the downlink in this\nnode, pointing to the child node in the stack\". It's now replaced with\ndownlinkoffnum, which means \"offset of the downlink in the parent of this\nnode\". gistFindPath() already used childoffnum with this new meaning, and\nhad an extra step at the end to pull all the childoffnum values down one\nnode in the stack, to adjust the stack for the meaning that childoffnum had\nelsewhere. That's no longer required.\n\nThe reason to do this now is this new representation is more convenient for\nthe GiST fast build patch that Alexander Korotkov is working on.\n\nWhile we're at it, replace the linked list used in gistFindPath with a\nstandard List, and make gistFindPath() static.\n\nAlexander Korotkov, with some changes by me.","Heikki Linnakangas"],["c1129a14e192755e001ba7899d4a9ca216e4ec3c","9ae9c44b775ee9b29f4f502415e02e61a9b1a6a0@momjian.us","Doc clarification for pg_locks columns.\n\nFlorian Pflug","Bruce Momjian"],["bf3c5856818a88b963748402f4f7e0274fe3859d","c50e6bf7013fce877ffb25104d778a36de31e297@gmx.net","Set information_schema.tables.commit_action to null\n\nThe commit action of temporary tables is currently not cataloged, so\nwe can't easily show it.  The previous value was outdated from before\nwe had different commit actions.","Peter Eisentraut"],["d71197cd35db0b0e66120f37443be6a5dfc2669d","3c84f0de6f8a0f296d36cdd9f57fa166641c96b1@alvh.no-ip.org","Set different deadlock_timeout on each session in new isolation tests\n\nThis provides deterministic deadlock-detection ordering for new\nisolation tests, fixing the sporadic failures in them.\n\nAuthor: Noah Misch","Alvaro Herrera"],["f7c1344e9baa9b6d7c9b43b4259ce74f44d7dbed","9f4ca770b638615ac5c3e0d2da16b77c80c2f2c6@hagander.net","Merge remote branch 'origin/master' into sspibug","Magnus Hagander"]],"ref":"refs/heads/sspibug","size":12,"head":"f7c1344e9baa9b6d7c9b43b4259ce74f44d7dbed","push_id":39358966}