1 /*-------------------------------------------------------------------------
4 * GiST index support for tsquery
6 * Portions Copyright (c) 1996-2007, PostgreSQL Global Development Group
10 * $PostgreSQL: pgsql/src/backend/utils/adt/tsquery_gist.c,v 1.1 2007/08/21 01:11:19 tgl Exp $
12 *-------------------------------------------------------------------------
17 #include "access/skey.h"
18 #include "access/gist.h"
19 #include "tsearch/ts_type.h"
20 #include "tsearch/ts_utils.h"
22 #define GETENTRY(vec,pos) ((TSQuerySign *) DatumGetPointer((vec)->vector[(pos)].key))
25 gtsquery_compress(PG_FUNCTION_ARGS)
27 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
28 GISTENTRY *retval = entry;
32 TSQuerySign *sign = (TSQuerySign *) palloc(sizeof(TSQuerySign));
34 retval = (GISTENTRY *) palloc(sizeof(GISTENTRY));
35 *sign = makeTSQuerySign(DatumGetTSQuery(entry->key));
37 gistentryinit(*retval, PointerGetDatum(sign),
38 entry->rel, entry->page,
39 entry->offset, FALSE);
42 PG_RETURN_POINTER(retval);
46 gtsquery_decompress(PG_FUNCTION_ARGS)
48 PG_RETURN_DATUM(PG_GETARG_DATUM(0));
52 gtsquery_consistent(PG_FUNCTION_ARGS)
54 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
55 TSQuerySign *key = (TSQuerySign *) DatumGetPointer(entry->key);
56 TSQuery query = PG_GETARG_TSQUERY(1);
57 StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
58 TSQuerySign sq = makeTSQuerySign(query);
63 case RTContainsStrategyNumber:
65 retval = (*key & sq) == sq;
67 retval = (*key & sq) != 0;
69 case RTContainedByStrategyNumber:
71 retval = (*key & sq) == *key;
73 retval = (*key & sq) != 0;
78 PG_RETURN_BOOL(retval);
82 gtsquery_union(PG_FUNCTION_ARGS)
84 GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
85 int *size = (int *) PG_GETARG_POINTER(1);
86 TSQuerySign *sign = (TSQuerySign *) palloc(sizeof(TSQuerySign));
89 memset(sign, 0, sizeof(TSQuerySign));
91 for (i = 0; i < entryvec->n; i++)
92 *sign |= *GETENTRY(entryvec, i);
94 *size = sizeof(TSQuerySign);
96 PG_RETURN_POINTER(sign);
100 gtsquery_same(PG_FUNCTION_ARGS)
102 TSQuerySign *a = (TSQuerySign *) PG_GETARG_POINTER(0);
103 TSQuerySign *b = (TSQuerySign *) PG_GETARG_POINTER(1);
105 PG_RETURN_POINTER(*a == *b);
109 sizebitvec(TSQuerySign sign)
114 for (i = 0; i < TSQS_SIGLEN; i++)
115 size += 0x01 & (sign >> i);
121 hemdist(TSQuerySign a, TSQuerySign b)
123 TSQuerySign res = a ^ b;
125 return sizebitvec(res);
129 gtsquery_penalty(PG_FUNCTION_ARGS)
131 TSQuerySign *origval = (TSQuerySign *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
132 TSQuerySign *newval = (TSQuerySign *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(1))->key);
133 float *penalty = (float *) PG_GETARG_POINTER(2);
135 *penalty = hemdist(*origval, *newval);
137 PG_RETURN_POINTER(penalty);
148 comparecost(const void *a, const void *b)
150 if (((SPLITCOST *) a)->cost == ((SPLITCOST *) b)->cost)
153 return (((SPLITCOST *) a)->cost > ((SPLITCOST *) b)->cost) ? 1 : -1;
156 #define WISH_F(a,b,c) (double)( -(double)(((a)-(b))*((a)-(b))*((a)-(b)))*(c) )
159 gtsquery_picksplit(PG_FUNCTION_ARGS)
161 GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
162 GIST_SPLITVEC *v = (GIST_SPLITVEC *) PG_GETARG_POINTER(1);
163 OffsetNumber maxoff = entryvec->n - 2;
167 TSQuerySign *datum_l,
174 OffsetNumber seed_1 = 0,
179 SPLITCOST *costvector;
181 nbytes = (maxoff + 2) * sizeof(OffsetNumber);
182 left = v->spl_left = (OffsetNumber *) palloc(nbytes);
183 right = v->spl_right = (OffsetNumber *) palloc(nbytes);
184 v->spl_nleft = v->spl_nright = 0;
186 for (k = FirstOffsetNumber; k < maxoff; k = OffsetNumberNext(k))
187 for (j = OffsetNumberNext(k); j <= maxoff; j = OffsetNumberNext(j))
189 size_waste = hemdist(*GETENTRY(entryvec, j), *GETENTRY(entryvec, k));
190 if (size_waste > waste)
199 if (seed_1 == 0 || seed_2 == 0)
205 datum_l = (TSQuerySign *) palloc(sizeof(TSQuerySign));
206 *datum_l = *GETENTRY(entryvec, seed_1);
207 datum_r = (TSQuerySign *) palloc(sizeof(TSQuerySign));
208 *datum_r = *GETENTRY(entryvec, seed_2);
211 maxoff = OffsetNumberNext(maxoff);
212 costvector = (SPLITCOST *) palloc(sizeof(SPLITCOST) * maxoff);
213 for (j = FirstOffsetNumber; j <= maxoff; j = OffsetNumberNext(j))
215 costvector[j - 1].pos = j;
216 size_alpha = hemdist(*GETENTRY(entryvec, seed_1), *GETENTRY(entryvec, j));
217 size_beta = hemdist(*GETENTRY(entryvec, seed_2), *GETENTRY(entryvec, j));
218 costvector[j - 1].cost = abs(size_alpha - size_beta);
220 qsort((void *) costvector, maxoff, sizeof(SPLITCOST), comparecost);
222 for (k = 0; k < maxoff; k++)
224 j = costvector[k].pos;
231 else if (j == seed_2)
237 size_alpha = hemdist(*datum_l, *GETENTRY(entryvec, j));
238 size_beta = hemdist(*datum_r, *GETENTRY(entryvec, j));
240 if (size_alpha < size_beta + WISH_F(v->spl_nleft, v->spl_nright, 0.05))
242 *datum_l |= *GETENTRY(entryvec, j);
248 *datum_r |= *GETENTRY(entryvec, j);
254 *right = *left = FirstOffsetNumber;
255 v->spl_ldatum = PointerGetDatum(datum_l);
256 v->spl_rdatum = PointerGetDatum(datum_r);
258 PG_RETURN_POINTER(v);