Tom Lane 721e53785d Solve the problem of OID collisions by probing for duplicate OIDs ...

whenever we generate a new OID.  This prevents occasional duplicate-OID
errors that can otherwise occur once the OID counter has wrapped around.
Duplicate relfilenode values are also checked for when creating new
physical files.  Per my recent proposal.

2005-08-12 01:36:05 +00:00

..

common

Fix rtree and contrib/rtree_gist search behavior for the 1-D box and

2005-06-24 00:18:52 +00:00

gist

Migrate rtree_gist functionality into the core system, and add some

2005-07-01 19:19:05 +00:00

hash

Add hints to cases where indexes fail because of values that are too long.

2005-08-10 21:36:46 +00:00

heap

Solve the problem of OID collisions by probing for duplicate OIDs

2005-08-12 01:36:05 +00:00

index

Concurrency for GiST

2005-06-27 12:45:23 +00:00

nbtree

Mention MD5 function index for indexing long values.

2005-08-11 13:22:33 +00:00

rtree

Add hints to cases where indexes fail because of values that are too long.

2005-08-10 21:36:46 +00:00

transam

Solve the problem of OID collisions by probing for duplicate OIDs

2005-08-12 01:36:05 +00:00

Makefile

$Header: -> $PostgreSQL Changes ...

2003-11-29 19:52:15 +00:00