diff options
| author | Neil Conway <neilc@samurai.com> | 2006-11-08 19:06:15 +0000 |
|---|---|---|
| committer | Neil Conway <neilc@samurai.com> | 2006-11-08 19:06:15 +0000 |
| commit | 9d6f26325f2ae29e45d68eaad08a28369625ffca (patch) | |
| tree | add63c9d9245c80f5d1f8c0132ceeb2b0c4fc751 | |
| parent | 092ed294fcc71a186c62ebd4ea412a853bd3575e (diff) | |
| download | postgresql-9d6f26325f2ae29e45d68eaad08a28369625ffca.tar.gz postgresql-9d6f26325f2ae29e45d68eaad08a28369625ffca.zip | |
Fix two typos.
| -rw-r--r-- | contrib/tsearch2/README.tsearch2 | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/contrib/tsearch2/README.tsearch2 b/contrib/tsearch2/README.tsearch2 index 890868e59af..5d7b19d55f6 100644 --- a/contrib/tsearch2/README.tsearch2 +++ b/contrib/tsearch2/README.tsearch2 @@ -149,7 +149,7 @@ Development History introduced an interesting data structure suitable for sets - RD-tree (Russian Doll tree). Further research lead us to the idea to use GiST for implementing RD-tree, but at that time the - GiST code was intouched for a long time and contained several + GiST code was untouched for a long time and contained several bugs. After work on improving GiST for version 7.0.3 of PostgreSQL was done, we were able to implement RD-Tree and use it for index access to arrays of integers. This implementation @@ -159,7 +159,7 @@ Development History by a single bit-signature, a so-called superimposed signature (see "Index Structures for Databases Containing Data Items with Set-valued Attributes", 1997, Sven Helmer for details). We - developeded the contrib/intarray module and used it for full + developed the contrib/intarray module and used it for full text indexing. tsearch v1 |