1. 23 Mar, 2004 5 commits
  2. 22 Mar, 2004 11 commits
  3. 21 Mar, 2004 3 commits
  4. 20 Mar, 2004 4 commits
  5. 19 Mar, 2004 3 commits
  6. 18 Mar, 2004 12 commits
  7. 17 Mar, 2004 2 commits
    • Bruce Momjian's avatar
      Done: · 3700335b
      Bruce Momjian authored
      > * -Order duplicate index entries on creation by tid for faster heap lookups
      3700335b
    • Tom Lane's avatar
      During btree index build, sort equal-keyed tuples according to their · fbac1272
      Tom Lane authored
      TID (heap position).  This doesn't do anything to the validity of the
      finished index, but by pretending to qsort() that there are no really
      equal keys in the sort, we can avoid performance problems with qsort
      implementations that have trouble with large numbers of equal keys.
      Patch from Manfred Koizar.
      fbac1272