1. 13 2月, 1997 2 次提交
    • M
      Various patches for nextstep by GregorHoffleit · a5494a2d
      Marc G. Fournier 提交于
      Replaced NEED_STRDUP by !HAVE_STRDUP
      a5494a2d
    • M
      Patch for: · 809ae06a
      Marc G. Fournier 提交于
      The following patch to src/backend/libpq/pqpacket.c provides additional
      checking for bad packet length data. It was tested with the Linux telnet
      client, with netcat using the numbers.txt and by dumping random numbers
      into the port.
      
      Patch by: Alvaro Martinez Echevarria <alvaro@lander.es>
      809ae06a
  2. 12 2月, 1997 5 次提交
    • M
      d937b4ef
    • M
      Patch from Massimo Dal Zotto <dz@cs.unitn.it> · fb70587c
      Marc G. Fournier 提交于
      The following patches add to the backend a new debugging flag -K which prints
      a debug trace of all locking operations on user relations (those with oid
      greater than 20000). The code is compiled only if LOCK_MGR_DEBUG is defined,
      so the patch should be harmless if not explicitly enabled.
      I'm using the code to trace deadlock conditions caused by application queries
      using the command "$POSTMASTER -D $PGDATA -o '-d 1 -K 1'.
      The patches are for version 6.0 dated 970126.
      fb70587c
    • M
      Make sure we have an irix port · ba82bb3e
      Marc G. Fournier 提交于
      Pointed out by: Dave Morrison  (mirrison@mail.phy.ornl.gov)
      ba82bb3e
    • M
      What looks like some *major* improvements to btree indexing... · 5d9f146c
      Marc G. Fournier 提交于
      Patches from: aoki@CS.Berkeley.EDU (Paul M. Aoki)
      
      i gave jolly my btree bulkload code a long, long time ago but never
      gave him a bunch of my bugfixes.  here's a diff against the 6.0
      baseline.
      
      for some reason, this code has slowed down somewhat relative to the
      insertion-build code on very small tables.  don't know why -- it used
      to be within about 10%.  anyway, here are some (highly unscientific!)
      timings on a dec 3000/300 for synthetic tables with 10k, 100k and
      1000k tuples (basically, 1mb, 10mb and 100mb heaps).  'c' means
      clustered (pre-sorted) inputs and 'u' means unclustered (randomly
      ordered) inputs.  the 10k table basically fits in the buffer pool, but
      the 100k and 1000k tables don't.  as you can see, insertion build is
      fine if you've sorted your heaps on your index key or if your heap
      fits in core, but is absolutely horrible on unordered data (yes,
      that's 7.5 hours to index 100mb of data...) because of the zillions of
      random i/os.
      
      if it doesn't work for you for whatever reason, you can always turn it
      back off by flipping the FastBuild flag in nbtree.c.  i don't have
      time to maintain it.
      
      good luck!
      
      baseline code:
      
      time psql -c 'create index c10 on k10 using btree (c int4_ops)' bttest
      real   8.6
      time psql -c 'create index u10 on k10 using btree (b int4_ops)' bttest
      real   9.1
      time psql -c 'create index c100 on k100 using btree (c int4_ops)' bttest
      real   59.2
      time psql -c 'create index u100 on k100 using btree (b int4_ops)' bttest
      real   652.4
      time psql -c 'create index c1000 on k1000 using btree (c int4_ops)' bttest
      real   636.1
      time psql -c 'create index u1000 on k1000 using btree (b int4_ops)' bttest
      real   26772.9
      
      bulkloading code:
      
      time psql -c 'create index c10 on k10 using btree (c int4_ops)' bttest
      real   11.3
      time psql -c 'create index u10 on k10 using btree (b int4_ops)' bttest
      real   10.4
      time psql -c 'create index c100 on k100 using btree (c int4_ops)' bttest
      real   59.5
      time psql -c 'create index u100 on k100 using btree (b int4_ops)' bttest
      real   63.5
      time psql -c 'create index c1000 on k1000 using btree (c int4_ops)' bttest
      real   636.9
      time psql -c 'create index u1000 on k1000 using btree (b int4_ops)' bttest
      real   701.0
      5d9f146c
    • B
      Assign priorities when creating jobs in lock queue. · d5a3f52d
      Bruce Momjian 提交于
      d5a3f52d
  3. 11 2月, 1997 2 次提交
  4. 09 2月, 1997 7 次提交
  5. 08 2月, 1997 3 次提交
  6. 07 2月, 1997 4 次提交
  7. 06 2月, 1997 9 次提交
  8. 05 2月, 1997 7 次提交
  9. 04 2月, 1997 1 次提交