2 * Copyright (C) 1994-1995, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.11 1996-10-07 16:05:29 quinn
10 * Revision 1.9 1995/12/11 09:15:26 adam
11 * New set types: sand/sor/snot - ranked versions of and/or/not in
12 * ranked/semi-ranked result sets.
13 * Note: the snot not finished yet.
14 * New rset member: flag.
15 * Bug fix: r_delete in rsrel.c did free bad memory block.
17 * Revision 1.8 1995/12/05 11:25:45 adam
18 * Doesn't include math.h.
20 * Revision 1.7 1995/10/12 12:41:57 adam
21 * Private info (buf) moved from struct rset_control to struct rset.
22 * Bug fixes in relevance.
24 * Revision 1.6 1995/10/10 14:00:04 adam
25 * Function rset_open changed its wflag parameter to general flags.
27 * Revision 1.5 1995/10/06 14:38:06 adam
28 * New result set method: r_score.
29 * Local no (sysno) and score is transferred to retrieveCtrl.
31 * Revision 1.4 1995/09/14 07:48:56 adam
32 * Other score calculation.
34 * Revision 1.3 1995/09/11 15:23:40 adam
35 * More work on relevance search.
37 * Revision 1.2 1995/09/11 13:09:41 adam
38 * More work on relevance feedback.
40 * Revision 1.1 1995/09/08 14:52:42 adam
41 * Work on relevance feedback.
53 static void *r_create(const struct rset_control *sel, void *parms,
55 static RSFD r_open (RSET ct, int flag);
56 static void r_close (RSFD rfd);
57 static void r_delete (RSET ct);
58 static void r_rewind (RSFD rfd);
59 static int r_count (RSET ct);
60 static int r_read (RSFD rfd, void *buf);
61 static int r_write (RSFD rfd, const void *buf);
62 static int r_score (RSFD rfd, int *score);
64 static const rset_control control =
78 const rset_control *rset_kind_relevance = &control;
80 struct rset_rel_info {
84 int (*cmp)(const void *p1, const void *p2);
85 char *key_buf; /* key buffer */
86 float *score_buf; /* score buffer */
87 int *sort_idx; /* score sorted index */
88 int *sysno_idx; /* sysno sorted index (ring buffer) */
89 struct rset_rel_rfd *rfd_list;
96 struct rset_rel_rfd *next;
97 struct rset_rel_info *info;
100 static void add_rec (struct rset_rel_info *info, double score, void *key)
104 for (i = 0; i<info->no_rec; i++)
106 idx = info->sort_idx[i];
107 if (score <= info->score_buf[idx])
110 if (info->no_rec < info->max_rec)
111 { /* there is room for this entry */
112 for (j = info->no_rec; j > i; --j)
113 info->sort_idx[j] = info->sort_idx[j-1];
114 idx = info->sort_idx[j] = info->no_rec;
118 return; /* score too low */
121 idx = info->sort_idx[0]; /* remove this entry */
124 for (j = 0; j < i; ++j) /* make room */
125 info->sort_idx[j] = info->sort_idx[j+1];
126 info->sort_idx[j] = idx; /* allocate sort entry */
128 memcpy (info->key_buf + idx*info->key_size, key, info->key_size);
129 info->score_buf[idx] = score;
133 static struct rset_rel_info *qsort_info;
135 static int qcomp (const void *p1, const void *p2)
140 return qsort_info->cmp (qsort_info->key_buf + i1*qsort_info->key_size,
141 qsort_info->key_buf + i2*qsort_info->key_size);
144 #define SCORE_SHOW 0.0 /* base score for showing up */
145 #define SCORE_COOC 0.3 /* component dependent on co-oc */
146 #define SCORE_DYN (1-(SCORE_SHOW+SCORE_COOC)) /* dynamic component of score */
148 static void relevance (struct rset_rel_info *info, rset_relevance_parms *parms)
157 logf (LOG_DEBUG, "relevance");
158 isam_buf = xmalloc (parms->no_isam_positions * sizeof(*isam_buf));
159 isam_r = xmalloc (sizeof (*isam_r) * parms->no_isam_positions);
160 isam_pt = xmalloc (sizeof (*isam_pt) * parms->no_isam_positions);
161 isam_tmp_buf = xmalloc (info->key_size);
162 max_tf = xmalloc (sizeof (*max_tf) * parms->no_terms);
163 tf = xmalloc (sizeof (*tf) * parms->no_terms);
165 for (i = 0; i<parms->no_terms; i++)
167 for (i = 0; i<parms->no_isam_positions; i++)
169 isam_buf[i] = xmalloc (info->key_size);
170 isam_pt[i] = is_position (parms->is, parms->isam_positions[i]);
171 max_tf [parms->term_no[i]] = is_numkeys (isam_pt[i]);
172 isam_r[i] = is_readkey (isam_pt[i], isam_buf[i]);
173 logf (LOG_DEBUG, "max tf %d = %d", i, max_tf[i]);
179 int co_oc, last_term; /* Number of co-occurrences */
182 /* find min with lowest sysno */
183 for (i = 0; i<parms->no_isam_positions; i++)
186 (min < 0 || (r = (*parms->cmp)(isam_buf[i], isam_buf[min])) < 2))
191 else if (!r && last_term != parms->term_no[i]) /* new occurrence */
193 last_term = parms->term_no[i];
198 memcpy (isam_tmp_buf, isam_buf[min], info->key_size);
199 /* calculate for all with those sysno */
200 for (i = 0; i < parms->no_terms; i++)
202 for (i = 0; i<parms->no_isam_positions; i++)
207 r = (*parms->cmp)(isam_buf[i], isam_tmp_buf);
212 wgt[parms->term_no[i]] = 0.0;
214 if (r <= 1 && r >= -1)
218 tf[parms->term_no[i]]++;
219 isam_r[i] = is_readkey (isam_pt[i], isam_buf[i]);
220 } while (isam_r[i] &&
221 (*parms->cmp)(isam_buf[i], isam_tmp_buf) <= 1);
224 /* calculate relevance value */
226 for (i = 0; i<parms->no_terms; i++)
228 score += SCORE_SHOW + SCORE_COOC*co_oc/parms->no_terms +
229 SCORE_DYN*tf[i]/max_tf[i];
230 /* if value is in the top score, then save it - don't emit yet */
231 add_rec (info, score/parms->no_terms, isam_tmp_buf);
233 for (i = 0; i<info->no_rec; i++)
234 info->sysno_idx[i] = i;
236 qsort (info->sysno_idx, info->no_rec, sizeof(*info->sysno_idx), qcomp);
237 for (i = 0; i<parms->no_isam_positions; i++)
239 is_pt_free (isam_pt[i]);
243 xfree (isam_tmp_buf);
250 static void *r_create (const struct rset_control *sel, void *parms,
253 rset_relevance_parms *r_parms = parms;
254 struct rset_rel_info *info;
256 *flags |= RSET_FLAG_RANKED;
257 info = xmalloc (sizeof(struct rset_rel_info));
258 info->key_size = r_parms->key_size;
259 assert (info->key_size > 1);
260 info->max_rec = r_parms->max_rec;
261 assert (info->max_rec > 1);
262 info->cmp = r_parms->cmp;
264 info->key_buf = xmalloc (info->key_size * info->max_rec);
265 info->score_buf = xmalloc (sizeof(*info->score_buf) * info->max_rec);
266 info->sort_idx = xmalloc (sizeof(*info->sort_idx) * info->max_rec);
267 info->sysno_idx = xmalloc (sizeof(*info->sysno_idx) * info->max_rec);
269 info->rfd_list = NULL;
271 relevance (info, r_parms);
275 static RSFD r_open (RSET ct, int flag)
277 struct rset_rel_rfd *rfd;
278 struct rset_rel_info *info = ct->buf;
280 if (flag & RSETF_WRITE)
282 logf (LOG_FATAL, "relevance set type is read-only");
285 rfd = xmalloc (sizeof(*rfd));
287 rfd->next = info->rfd_list;
289 info->rfd_list = rfd;
294 static void r_close (RSFD rfd)
296 struct rset_rel_info *info = ((struct rset_rel_rfd*)rfd)->info;
297 struct rset_rel_rfd **rfdp;
299 for (rfdp = &info->rfd_list; *rfdp; rfdp = &(*rfdp)->next)
302 *rfdp = (*rfdp)->next;
306 logf (LOG_FATAL, "r_close but no rfd match!");
310 static void r_delete (RSET ct)
312 struct rset_rel_info *info = ct->buf;
314 assert (info->rfd_list == NULL);
315 xfree (info->key_buf);
316 xfree (info->score_buf);
317 xfree (info->sort_idx);
318 xfree (info->sysno_idx);
322 static void r_rewind (RSFD rfd)
324 struct rset_rel_rfd *p = rfd;
325 struct rset_rel_info *info = p->info;
327 if (p->flag & RSETF_SORT_RANK)
328 p->position = info->no_rec;
333 static int r_count (RSET ct)
335 struct rset_rel_info *info = ct->buf;
340 static int r_read (RSFD rfd, void *buf)
342 struct rset_rel_rfd *p = rfd;
343 struct rset_rel_info *info = p->info;
345 if (p->flag & RSETF_SORT_RANK)
347 if (p->position <= 0)
350 p->last_read_pos = info->sort_idx[p->position];
354 if (p->position == info->no_rec)
356 p->last_read_pos = info->sysno_idx[p->position];
360 info->key_buf + info->key_size * p->last_read_pos,
365 static int r_score (RSFD rfd, int *score)
367 struct rset_rel_rfd *p = rfd;
368 struct rset_rel_info *info = p->info;
370 *score = (int) (1000*info->score_buf[p->last_read_pos]);
374 static int r_write (RSFD rfd, const void *buf)
376 logf (LOG_FATAL, "relevance set type is read-only");