Skip to content


Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
branch: master
Commits on Nov 4, 2011
Commits on Oct 8, 2011
  1. Do not run compare_costs every time a join is recalculated.

    It makes known-good trees to fail to rebuild, triggering assertion
    errors in places where the code wants to back out a move and needs to
    rebuild a state that was previously built correctly.
Commits on Oct 2, 2011
  1. Use DTrace for debugging instrumentation instead of hand-rolled stuff.

    The saio_debug module is now unused (and not even compiled in). The
    rest of the code got cleaned up from adhoc debugging and instead now
    exposes a few strategically positioned DTrace entry points.
  2. Remove inferior algorithms, leave only "recalc".

    The other algorithms are clearly worse, there's no point in keeping
    them around, as well as maintaining a GUC to switch between them.
Commits on May 20, 2011
  1. Adapt to the new GUC variable assign hooks API.

    The API has been changed in a core commit dated 7-05-2011.
Commits on Dec 7, 2010
Commits on Jul 18, 2010
  1. Test script updates

Commits on Jun 20, 2010
  1. When checking acceptability, take the total cost of the tree.

    Taking the internediate cost of each subtree led to too many rejections.
Commits on Jun 19, 2010
  1. Check acceptability of each tree node, not just the root.

    Rejects bad soltions much faster, saves pointless joinrel creation.
  2. Make the SAIO_COST macro safe

Commits on Jun 18, 2010
Commits on Jun 16, 2010
Commits on Jun 14, 2010
  1. Enable the fastpath logic

  2. Structure algorithms as objects.

    An algorithm has a step() method, and optional initialize and
    finalize() methods. Adapt existing algorithms to that schema, which
    allows removing some special-case code from saio.c and moving it into
    the specific algorithm code.
Something went wrong with that request. Please try again.