1
- $PostgreSQL: pgsql/src/backend/access/gin/README,v 1.5 2008/03/20 17:55:14 momjian Exp $
1
+ $PostgreSQL: pgsql/src/backend/access/gin/README,v 1.6 2008/07/08 03:25:42 neilc Exp $
2
2
3
3
Gin for PostgreSQL
4
4
==================
@@ -25,8 +25,8 @@ for tsvector) and where each tuple in a leaf page is either a pointer to a
25
25
B-tree over item pointers (PT, posting tree), or a list of item pointers
26
26
(PL, posting list) if the tuple is small enough.
27
27
28
- Note: There is no delete operation for ET. The reason for this is thatfrom
29
- our experience,a set ofunique wordsover a largecollection change very
28
+ Note: There is no delete operation for ET. The reason for this is thatin
29
+ our experience,the set ofdistinct wordsin a largecorpus changes very
30
30
rarely. This greatly simplifies the code and concurrency algorithms.
31
31
32
32
Gin comes with built-in support for one-dimensional arrays (eg. integer[],
@@ -64,7 +64,7 @@ itself is very fast.)
64
64
65
65
Such queries usually contain very frequent lexemes, so the results are not
66
66
very helpful. To facilitate execution of such queries Gin has a configurable
67
- soft upper limitof the size of the returned set, determined by the
67
+ soft upper limiton the size of the returned set, determined by the
68
68
'gin_fuzzy_search_limit' GUC variable. This is set to 0 by default (no
69
69
limit).
70
70