PostgreSQL La base de donnees la plus sophistiquee au monde.

Nouvelles hebdomadaires de PostgreSQL - 5 décembre 2010

Les nouveautés des produits dérivés

PostgreSQL Local

  • L'appel à projets de PostgreSQLFr a été lancé. Les projets doivent concerner PostgreSQL et la communauté francophone. Mail à appel-projets-2010 (AT) postgresql (DOT) fr.
  • Le FOSDEM est l'un des plus grand événements autour du Libre et de l'Open Source ; il a lieu annuellement à Bruxelles et rassemble environ 4000 personnes. La prochaine édition est programmée pour les 5 & 6 février 2011. Envoyez vos propositions à l'adresse fosdem AT postgresql POINT eu :
  • Un PGDay.US est au programme du Southern California Linux Exposition (SCALE) de cette année, tenu à l'hôtel LAX Hilton de Los Angeles (Californie) le vendredi 25 février 2011. Proposez vos conférences sur pgday-submissions (AT) googlegroups (DOT) com.
  • PGCon aura lieu les 19 & 20 mai 2011 à l'Université d'Ottawa, précédé par deux jours de tutoriels les 17 & 18 mai :

PostgreSQL dans les média

PostgreSQL Weekly News / les nouvelles hebdomadaires vous sont offertes cette semaine par David Fetter. Traduction par l'équipe PostgreSQLFr sous licence CC BY-NC-SA.

Proposez vos articles ou annonces avant dimanche 15:00 (heure du Pacifique). Merci de les envoyer en anglais à david (a), en allemand à pwn (a), en italien à pwn (a) et en espagnol à pwn (a)

(lien vers l'article original)


Correctifs appliqués

Heikki Linnakangas a poussé :

Tom Lane a poussé :

  • Simplify and speed up mapping of index opfamilies to pathkeys. Formerly we looked up the operators associated with each index (caching them in relcache) and then the planner looked up the btree opfamily containing such operators in order to build the btree-centric pathkey representation that describes the index's sort order. This is quite pointless for btree indexes: we might as well just use the index's opfamily information directly. That saves syscache lookup cycles during planning, and furthermore allows us to eliminate the relcache's caching of operators altogether, which may help in reducing backend startup time. I added code to plancat.c to perform the same type of double lookup on-the-fly if it's ever faced with a non-btree amcanorder index AM. If such a thing actually becomes interesting for production, we should replace that logic with some more-direct method for identifying the corresponding btree opfamily; but it's not worth spending effort on now. There is considerably more to do pursuant to my recent proposal to get rid of sort-operator-based representations of sort orderings, but this patch grabs some of the low-hanging fruit. I'll look at the remainder of that work after the current commitfest.;a=commitdiff;h=c0b5fac7010fa3468577d3a90ee8783639500fed
  • Prevent inlining a SQL function with multiple OUT parameters. There were corner cases in which the planner would attempt to inline such a function, which would result in a failure at runtime due to loss of information about exactly what the result record type is. Fix by disabling inlining when the function's recorded result type is RECORD. There might be some sub-cases where inlining could still be allowed, but this is a simple and backpatchable fix, so leave refinements for another day. Per bug #5777 from Nate Carson. Back-patch to all supported branches. 8.1 happens to avoid a core-dump here, but it still does the wrong thing.;a=commitdiff;h=225f0aa3dfef55554cbe2e6da73df5e41b9eec18
  • Create core infrastructure for KNNGIST. This is a heavily revised version of builtin_knngist_core-0.9. The ordering operators are no longer mixed in with actual quals, which would have confused not only humans but significant parts of the planner. Instead, ordering operators are carried separately throughout planning and execution. Since the API for ambeginscan and amrescan functions had to be changed anyway, this commit takes the opportunity to rationalize that a bit. RelationGetIndexScan no longer forces a premature index_rescan call; instead, callers of index_beginscan must call index_rescan too. Aside from making the AM-side initialization logic a bit less peculiar, this has the advantage that we do not make a useless extra am_rescan call when there are runtime key values. AMs formerly could not assume that the key values passed to amrescan were actually valid; now they can. Teodor Sigaev and Tom Lane.;a=commitdiff;h=d583f10b7e0b9e1ed18f339f3177ed42ac2f7570
  • Put back gistgettuple's check for backwards scan request. On reflection it's a bad idea for the KNNGIST patch to have removed that. We don't want it silently returning incorrect answers.;a=commitdiff;h=04910a3ad5cd2901558da2a4fad9a2e2819348aa
  • Add external documentation for KNNGIST.;a=commitdiff;h=b576757d7ee064ada5351c2e6a36c2f7234aa1d4
  • Add KNNGIST support to contrib/pg_trgm. Teodor Sigaev, with some revision by Tom Lane.;a=commitdiff;h=b525bf771e31a2254f28bf25c6ed7987d64c8afb
  • Update comment to match later code changes.;a=commitdiff;h=e194a942f98caf0b278e3ba30a85545ac790ea1d
  • Fix two small bugs in new gistget.c logic. 1. Complain, rather than silently doing nothing, if an "invalid" tuple is found on a leaf page. Per off-list discussion with Heikki Linnakangas. 2. Fix oversight in code that removes a GISTSearchItem from the search queue: we have to reset lastHeap if this was the last heap item in the parent GISTSearchTreeItem. Otherwise subsequent additions will do the wrong thing. This was probably masked in early testing because in typical cases the parent item would now be completely empty and would be deleted on next call. You'd need a queued non-leaf page at exactly the same distance as a heap tuple to expose the bug.;a=commitdiff;h=d1f5a92e18dcfc750e9d338597e66af920aad99e
  • Reduce memory consumption inside inheritance_planner(). Avoid eating quite so much memory for large inheritance trees, by reclaiming the space used by temporary copies of the original parsetree and range table, as well as the workspace needed during planning. The cost is needing to copy the finished plan trees out of the child memory context. Although this looks like it ought to slow things down, my testing shows it actually is faster, apparently because fewer interactions with malloc() are needed and/or we can do the work within a more readily cacheable amount of memory. That result might be platform-dependent, but I'll take it. Per a gripe from John Papandriopoulos, in which it was pointed out that the memory consumption actually grew as O(N2) for sufficiently many child tables, since we were creating N copies of the N-element range table.;a=commitdiff;h=d1001a78ce612a16ea622b558f5fc2b68c45ab4c

Alvaro Herrera a poussé :

ITAGAKI Takahiro a poussé :

Robert Haas a poussé :

Peter Eisentraut a poussé :

Correctifs rejetés (à ce jour)

  • Pas de déception cette semaine :-)

Correctifs en attente

  • Dimitri Fontaine and ITAGAKI Takahiro traded revisions of the patch to add pg_execute_from_file().
  • David Fetter and ITAGAKI Takahiro traded patches to add tab completion to psql for triggers on views.
  • Based on a review by Andy Colson, Robert Haas sent in another revision of the patch to add unlogged tables.
  • Greg Smith sent in another revision of the patch to spread out checkpoint syncs.
  • Dimitri Fontaine sent in another revision of the patch to add extensions.
  • Radoslaw Smogura sent in another revision of the JDBC driver.
  • Heikki Linnakangas sent in two more revisions of the patch to fix the "too many KnownAssignedXids" issue on hot standby.
  • Joachim Wieland sent in another flock of patches for parallel pg_dump.
  • Heikki Linnakangas sent in another revision of the patch to rewrite how GiST inserts happen.
  • Peter Eisentraut sent in another revision of the patch to add per-column collation.
  • Boxuan Zhai sent in another revision of the patch to add MERGE.
  • Andrew Dunstan sent in a patch to allow COPY routines to read arbitrary numbers of fields.
  • Greg Smith sent in another revision of the patch to instrument checkpoint sync calls.
  • Andrew Dunstan sent in a patch to allow COPY routines to read arbitrary numbers of fields.
  • Greg Smith sent in another revision of the patch to instrument checkpoint sync calls.

pgwn/5_decembre_2010.txt · Dernière modification: 2010/12/07 00:11 par buggy