2 * Copyright (C) 1994-1995, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.4 1995-09-14 07:48:56 adam
8 * Other score calculation.
10 * Revision 1.3 1995/09/11 15:23:40 adam
11 * More work on relevance search.
13 * Revision 1.2 1995/09/11 13:09:41 adam
14 * More work on relevance feedback.
16 * Revision 1.1 1995/09/08 14:52:42 adam
17 * Work on relevance feedback.
30 static rset_control *r_create(const struct rset_control *sel, void *parms);
31 static RSFD r_open (rset_control *ct, int wflag);
32 static void r_close (RSFD rfd);
33 static void r_delete (rset_control *ct);
34 static void r_rewind (RSFD rfd);
35 static int r_count (rset_control *ct);
36 static int r_read (RSFD rfd, void *buf);
37 static int r_write (RSFD rfd, const void *buf);
39 static const rset_control control =
53 const rset_control *rset_kind_relevance = &control;
55 struct rset_rel_info {
59 int (*cmp)(const void *p1, const void *p2);
64 struct rset_rel_rfd *rfd_list;
69 struct rset_rel_rfd *next;
70 struct rset_rel_info *info;
73 static void add_rec (struct rset_rel_info *info, double score, void *key)
77 logf (LOG_DEBUG, "add %f", score);
78 for (i = 0; i<info->no_rec; i++)
80 idx = info->sort_idx[i];
81 if (score <= info->score_buf[idx])
84 if (info->no_rec < info->max_rec)
86 for (j = info->no_rec; j > i; --j)
87 info->sort_idx[j] = info->sort_idx[j-1];
88 idx = info->sort_idx[j] = info->no_rec;
95 idx = info->sort_idx[0];
98 for (j = 0; j < i; ++j)
99 info->sort_idx[j] = info->sort_idx[j+1];
100 info->sort_idx[j] = idx;
102 memcpy (info->key_buf + idx*info->key_size, key, info->key_size);
103 info->score_buf[idx] = score;
106 static void relevance (struct rset_rel_info *info, rset_relevance_parms *parms)
116 logf (LOG_DEBUG, "relevance");
117 isam_buf = xmalloc (parms->no_isam_positions * sizeof(*isam_buf));
118 isam_r = xmalloc (sizeof (*isam_r) * parms->no_isam_positions);
119 isam_pt = xmalloc (sizeof (*isam_pt) * parms->no_isam_positions);
120 isam_tmp_buf = xmalloc (info->key_size);
121 max_tf = xmalloc (sizeof (*max_tf) * parms->no_isam_positions);
122 wgt = xmalloc (sizeof (*wgt) * parms->no_isam_positions);
124 for (i = 0; i<parms->no_isam_positions; i++)
126 isam_buf[i] = xmalloc (info->key_size);
127 isam_pt[i] = is_position (parms->is, parms->isam_positions[i]);
128 max_tf [i] = is_numkeys (isam_pt[i]);
129 isam_r[i] = is_readkey (isam_pt[i], isam_buf[i]);
130 logf (LOG_DEBUG, "max tf %d = %d", i, max_tf[i]);
137 /* find min with lowest sysno */
138 for (i = 0; i<parms->no_isam_positions; i++)
140 (min < 0 || (*parms->cmp)(isam_buf[i], isam_buf[min]) < 1))
144 memcpy (isam_tmp_buf, isam_buf[min], info->key_size);
145 /* calculate for all with those sysno */
146 for (i = 0; i<parms->no_isam_positions; i++)
151 r = (*parms->cmp)(isam_buf[i], isam_tmp_buf);
162 isam_r[i] = is_readkey (isam_pt[i], isam_buf[i]);
163 } while (isam_r[i] &&
164 (*parms->cmp)(isam_buf[i], isam_tmp_buf) <= 1);
165 wgt[i] = 0.1+tf*0.9/max_tf[i];
168 /* calculate relevance value */
170 for (i = 0; i<parms->no_isam_positions; i++)
172 /* if value is in the top score, then save it - don't emit yet */
173 add_rec (info, score, isam_tmp_buf);
175 for (i = 0; i<parms->no_isam_positions; i++)
177 is_pt_free (isam_pt[i]);
181 xfree (isam_tmp_buf);
188 static rset_control *r_create (const struct rset_control *sel, void *parms)
191 rset_relevance_parms *r_parms = parms;
192 struct rset_rel_info *info;
194 newct = xmalloc(sizeof(*newct));
195 memcpy(newct, sel, sizeof(*sel));
196 newct->buf = xmalloc (sizeof(struct rset_rel_info));
199 info->key_size = r_parms->key_size;
200 assert (info->key_size > 1);
201 info->max_rec = r_parms->max_rec;
202 assert (info->max_rec > 1);
203 info->cmp = r_parms->cmp;
205 info->key_buf = xmalloc (info->key_size * info->max_rec);
206 info->score_buf = xmalloc (sizeof(*info->score_buf) * info->max_rec);
207 info->sort_idx = xmalloc (sizeof(*info->sort_idx) * info->max_rec);
209 info->rfd_list = NULL;
211 relevance (info, r_parms);
215 static RSFD r_open (rset_control *ct, int wflag)
217 struct rset_rel_rfd *rfd;
218 struct rset_rel_info *info = ct->buf;
222 logf (LOG_FATAL, "relevance set type is read-only");
225 rfd = xmalloc (sizeof(*rfd));
226 rfd->next = info->rfd_list;
227 info->rfd_list = rfd;
228 rfd->position = info->no_rec;
233 static void r_close (RSFD rfd)
235 struct rset_rel_info *info = ((struct rset_rel_rfd*)rfd)->info;
236 struct rset_rel_rfd **rfdp;
238 for (rfdp = &info->rfd_list; *rfdp; rfdp = &(*rfdp)->next)
241 *rfdp = (*rfdp)->next;
245 logf (LOG_FATAL, "r_close but no rfd match!");
249 static void r_delete (rset_control *ct)
251 struct rset_rel_info *info = ct->buf;
253 assert (info->rfd_list == NULL);
254 xfree (info->key_buf);
255 xfree (info->score_buf);
256 xfree (info->sort_idx);
261 static void r_rewind (RSFD rfd)
263 struct rset_rel_rfd *p = rfd;
264 struct rset_rel_info *info = p->info;
266 p->position = info->no_rec;
269 static int r_count (rset_control *ct)
271 struct rset_rel_info *info = ct->buf;
276 static int r_read (RSFD rfd, void *buf)
278 struct rset_rel_rfd *p = rfd;
279 struct rset_rel_info *info = p->info;
281 if (p->position <= 0)
284 logf (LOG_DEBUG, "score: %f",
285 info->score_buf[info->sort_idx[p->position]]);
287 info->key_buf + info->key_size * info->sort_idx[p->position],
292 static int r_write (RSFD rfd, const void *buf)
294 logf (LOG_FATAL, "relevance set type is read-only");