Commit 9d6f2632 authored by Neil Conway's avatar Neil Conway

Fix two typos.

parent 092ed294
...@@ -149,7 +149,7 @@ Development History ...@@ -149,7 +149,7 @@ Development History
introduced an interesting data structure suitable for sets - introduced an interesting data structure suitable for sets -
RD-tree (Russian Doll tree). Further research lead us to the RD-tree (Russian Doll tree). Further research lead us to the
idea to use GiST for implementing RD-tree, but at that time 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 bugs. After work on improving GiST for version 7.0.3 of
PostgreSQL was done, we were able to implement RD-Tree and use PostgreSQL was done, we were able to implement RD-Tree and use
it for index access to arrays of integers. This implementation it for index access to arrays of integers. This implementation
...@@ -159,7 +159,7 @@ Development History ...@@ -159,7 +159,7 @@ Development History
by a single bit-signature, a so-called superimposed signature by a single bit-signature, a so-called superimposed signature
(see "Index Structures for Databases Containing Data Items with (see "Index Structures for Databases Containing Data Items with
Set-valued Attributes", 1997, Sven Helmer for details). We 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. text indexing.
tsearch v1 tsearch v1
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment