database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-30 11:03:19 +03:00
Code Activity

Fix two typos.

Browse Source
This commit is contained in:
Neil Conway
2006-11-08 19:06:15 +00:00
parent 092ed294fc
commit 9d6f26325f
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
contrib/tsearch2/README.tsearch2
View File

@ -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
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