1 /* $Id: zsets.c,v 1.73 2004-12-02 17:27:04 adam Exp $
2 Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002,2003,2004
5 This file is part of the Zebra server.
7 Zebra is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with Zebra; see the file LICENSE.zebra. If not, write to the
19 Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
35 #define SORT_IDX_ENTRYSIZE 64
36 #define ZSET_SORT_MAX_LEVEL 3
38 struct zebra_set_term_entry {
49 NMEM rset_nmem; /* for creating the rsets in */
54 struct zset_sort_info *sort_info;
55 struct zebra_set_term_entry *term_entries;
57 struct zebra_set *next;
61 struct zset_sort_entry {
64 char buf[ZSET_SORT_MAX_LEVEL][SORT_IDX_ENTRYSIZE];
67 struct zset_sort_info {
70 struct zset_sort_entry *all_entries;
71 struct zset_sort_entry **entries;
74 ZebraSet resultSetAddRPN (ZebraHandle zh, NMEM m,
75 Z_RPNQuery *rpn, int num_bases,
86 zebraSet = resultSetAdd (zh, setname, 1);
92 zebraSet->rset_nmem=nmem_create();
94 zebraSet->num_bases = num_bases;
96 nmem_malloc (zebraSet->nmem, num_bases * sizeof(*zebraSet->basenames));
97 for (i = 0; i<num_bases; i++)
98 zebraSet->basenames[i] = nmem_strdup (zebraSet->nmem, basenames[i]);
101 zebraSet->rset = rpn_search (zh, zebraSet->nmem, zebraSet->rset_nmem,
102 rpn, zebraSet->num_bases,
103 zebraSet->basenames, zebraSet->name,
105 zh->hits = zebraSet->hits;
108 zebraSet->locked = 0;
112 void resultSetAddTerm (ZebraHandle zh, ZebraSet s, int reg_type,
113 const char *db, int set,
114 int use, const char *term)
116 assert(zh); /* compiler shut up */
118 s->nmem = nmem_create ();
119 if (!s->term_entries)
122 s->term_entries_max = 1000;
124 nmem_malloc (s->nmem, s->term_entries_max *
125 sizeof(*s->term_entries));
126 for (i = 0; i < s->term_entries_max; i++)
127 s->term_entries[i].term = 0;
129 if (s->hits < s->term_entries_max)
131 s->term_entries[s->hits].reg_type = reg_type;
132 s->term_entries[s->hits].db = nmem_strdup (s->nmem, db);
133 s->term_entries[s->hits].set = set;
134 s->term_entries[s->hits].use = use;
135 s->term_entries[s->hits].term = nmem_strdup (s->nmem, term);
140 ZebraSet resultSetAdd (ZebraHandle zh, const char *name, int ov)
145 for (s = zh->sets; s; s = s->next)
146 if (!strcmp (s->name, name))
150 yaz_log(YLOG_DEBUG, "updating result set %s", name);
151 if (!ov || s->locked)
154 rset_delete (s->rset);
156 nmem_destroy (s->rset_nmem);
158 nmem_destroy (s->nmem);
162 const char *sort_max_str = zebra_get_resource(zh, "sortmax", "1000");
164 yaz_log(YLOG_DEBUG, "adding result set %s", name);
165 s = (ZebraSet) xmalloc (sizeof(*s));
168 s->name = (char *) xmalloc (strlen(name)+1);
169 strcpy (s->name, name);
171 s->sort_info = (struct zset_sort_info *)
172 xmalloc (sizeof(*s->sort_info));
173 s->sort_info->max_entries = atoi(sort_max_str);
174 if (s->sort_info->max_entries < 2)
175 s->sort_info->max_entries = 2;
177 s->sort_info->entries = (struct zset_sort_entry **)
178 xmalloc (sizeof(*s->sort_info->entries) *
179 s->sort_info->max_entries);
180 s->sort_info->all_entries = (struct zset_sort_entry *)
181 xmalloc (sizeof(*s->sort_info->all_entries) *
182 s->sort_info->max_entries);
183 for (i = 0; i < s->sort_info->max_entries; i++)
184 s->sort_info->entries[i] = s->sort_info->all_entries + i;
196 ZebraSet resultSetGet (ZebraHandle zh, const char *name)
200 for (s = zh->sets; s; s = s->next)
201 if (!strcmp (s->name, name))
203 if (!s->term_entries && !s->rset && s->rpn)
205 NMEM nmem = nmem_create ();
206 yaz_log(YLOG_LOG, "research %s", name);
208 s->rset_nmem=nmem_create();
210 rpn_search (zh, nmem, s->rset_nmem, s->rpn, s->num_bases,
211 s->basenames, s->name, s);
219 void resultSetInvalidate (ZebraHandle zh)
221 ZebraSet s = zh->sets;
223 for (; s; s = s->next)
226 rset_delete (s->rset);
229 nmem_destroy(s->rset_nmem);
234 void resultSetDestroy (ZebraHandle zh, int num, char **names,int *statuses)
236 ZebraSet * ss = &zh->sets;
240 for (i = 0; i<num; i++)
241 statuses[i] = Z_DeleteStatus_resultSetDidNotExist;
243 zh->errString = NULL;
250 for (i = 0; i<num; i++)
251 if (!strcmp (s->name, names[i]))
254 statuses[i] = Z_DeleteStatus_success;
263 xfree (s->sort_info->all_entries);
264 xfree (s->sort_info->entries);
265 xfree (s->sort_info);
268 nmem_destroy (s->nmem);
270 rset_delete (s->rset);
272 nmem_destroy(s->rset_nmem);
281 ZebraMetaRecord *zebra_meta_records_create_range (ZebraHandle zh,
286 zint *pos = pos_small;
290 if (num > 10000 || num <= 0)
294 pos = xmalloc(sizeof(*pos) * num);
296 for (i = 0; i<num; i++)
299 mr = zebra_meta_records_create(zh, name, num, pos);
306 ZebraMetaRecord *zebra_meta_records_create (ZebraHandle zh, const char *name,
307 int num, zint *positions)
310 ZebraMetaRecord *sr = 0;
313 struct zset_sort_info *sort_info;
315 if (!(sset = resultSetGet (zh, name)))
317 if (!(rset = sset->rset))
319 if (!sset->term_entries)
321 sr = (ZebraMetaRecord *) xmalloc (sizeof(*sr) * num);
322 for (i = 0; i<num; i++)
329 if (positions[i] <= sset->term_entries_max)
331 sr[i].term = sset->term_entries[positions[i]-1].term;
332 sr[i].db = sset->term_entries[positions[i]-1].db;
338 sr = (ZebraMetaRecord *) xmalloc (sizeof(*sr) * num);
339 for (i = 0; i<num; i++)
346 sort_info = sset->sort_info;
351 for (i = 0; i<num; i++)
353 position = positions[i];
354 if (position > 0 && position <= sort_info->num_entries)
356 yaz_log(YLOG_DEBUG, "got pos=%d (sorted)", position);
357 sr[i].sysno = sort_info->entries[position-1]->sysno;
358 sr[i].score = sort_info->entries[position-1]->score;
362 /* did we really get all entries using sort ? */
363 for (i = 0; i<num; i++)
368 if (i < num) /* nope, get the rest, unsorted - sorry */
377 position = sort_info->num_entries;
378 while (num_i < num && positions[num_i] < position)
380 rfd = rset_open (rset, RSETF_READ);
381 while (num_i < num && rset_read (rfd, &key, 0))
383 zint this_sys = key.mem[0];
384 yaz_log(YLOG_LOG, "RSET READ " ZINT_FORMAT, this_sys);
385 if (this_sys != psysno)
390 /* determine we alreay have this in our set */
391 for (i = sort_info->num_entries; --i >= 0; )
392 if (psysno == sort_info->entries[i]->sysno)
398 assert (num_i < num);
399 if (position == positions[num_i])
401 sr[num_i].sysno = psysno;
402 yaz_log(YLOG_DEBUG, "got pos=%d (unsorted)", position);
403 sr[num_i].score = -1;
414 void zebra_meta_records_destroy (ZebraHandle zh, ZebraMetaRecord *records,
417 assert(zh); /* compiler shut up about unused arg */
427 void resultSetInsertSort (ZebraHandle zh, ZebraSet sset,
428 struct sortKeyInfo *criteria, int num_criteria,
431 struct zset_sort_entry this_entry;
432 struct zset_sort_entry *new_entry = NULL;
433 struct zset_sort_info *sort_info = sset->sort_info;
436 sortIdx_sysno (zh->reg->sortIdx, sysno);
437 for (i = 0; i<num_criteria; i++)
439 sortIdx_type (zh->reg->sortIdx, criteria[i].attrUse);
440 sortIdx_read (zh->reg->sortIdx, this_entry.buf[i]);
442 i = sort_info->num_entries;
446 for (j = 0; j<num_criteria; j++)
448 if (criteria[j].numerical)
450 double diff = atof(this_entry.buf[j]) -
451 atof(sort_info->entries[i]->buf[j]);
460 rel = memcmp (this_entry.buf[j], sort_info->entries[i]->buf[j],
468 if (criteria[j].relation == 'A')
473 else if (criteria[j].relation == 'D')
480 j = sort_info->max_entries;
484 if (sort_info->num_entries == j)
487 j = (sort_info->num_entries)++;
488 new_entry = sort_info->entries[j];
491 sort_info->entries[j] = sort_info->entries[j-1];
494 sort_info->entries[i] = new_entry;
496 for (i = 0; i<num_criteria; i++)
497 memcpy (new_entry->buf[i], this_entry.buf[i], SORT_IDX_ENTRYSIZE);
498 new_entry->sysno = sysno;
499 new_entry->score = -1;
502 void resultSetInsertRank (ZebraHandle zh, struct zset_sort_info *sort_info,
503 zint sysno, int score, int relation)
505 struct zset_sort_entry *new_entry = NULL;
507 assert(zh); /* compiler shut up about unused arg */
509 i = sort_info->num_entries;
514 rel = score - sort_info->entries[i]->score;
521 else if (relation == 'A')
528 j = sort_info->max_entries;
532 if (sort_info->num_entries == j)
535 j = (sort_info->num_entries)++;
537 new_entry = sort_info->entries[j];
540 sort_info->entries[j] = sort_info->entries[j-1];
543 sort_info->entries[i] = new_entry;
545 new_entry->sysno = sysno;
546 new_entry->score = score;
549 void resultSetSort (ZebraHandle zh, NMEM nmem,
550 int num_input_setnames, const char **input_setnames,
551 const char *output_setname,
552 Z_SortKeySpecList *sort_sequence, int *sort_status)
557 if (num_input_setnames == 0)
562 if (num_input_setnames > 1)
567 yaz_log(YLOG_DEBUG, "result set sort input=%s output=%s",
568 *input_setnames, output_setname);
569 sset = resultSetGet (zh, input_setnames[0]);
573 zh->errString = nmem_strdup (nmem, input_setnames[0]);
576 if (!(rset = sset->rset))
579 zh->errString = nmem_strdup (nmem, input_setnames[0]);
582 if (strcmp (output_setname, input_setnames[0]))
584 rset = rset_dup (rset);
585 sset = resultSetAdd (zh, output_setname, 1);
588 resultSetSortSingle (zh, nmem, sset, rset, sort_sequence, sort_status);
591 void resultSetSortSingle (ZebraHandle zh, NMEM nmem,
592 ZebraSet sset, RSET rset,
593 Z_SortKeySpecList *sort_sequence, int *sort_status)
600 struct sortKeyInfo sort_criteria[3];
607 assert(nmem); /* compiler shut up about unused param */
608 sset->sort_info->num_entries = 0;
610 rset_getterms(rset, 0, 0, &n);
611 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
612 rset_getterms(rset, terms, n, &numTerms);
615 num_criteria = sort_sequence->num_specs;
616 if (num_criteria > 3)
618 for (i = 0; i < num_criteria; i++)
620 Z_SortKeySpec *sks = sort_sequence->specs[i];
623 if (*sks->sortRelation == Z_SortKeySpec_ascending)
624 sort_criteria[i].relation = 'A';
625 else if (*sks->sortRelation == Z_SortKeySpec_descending)
626 sort_criteria[i].relation = 'D';
632 if (sks->sortElement->which == Z_SortElement_databaseSpecific)
637 else if (sks->sortElement->which != Z_SortElement_generic)
642 sk = sks->sortElement->u.generic;
645 case Z_SortKey_sortField:
646 yaz_log(YLOG_DEBUG, "Sort: key %d is of type sortField", i+1);
649 case Z_SortKey_elementSpec:
650 yaz_log(YLOG_DEBUG, "Sort: key %d is of type elementSpec", i+1);
653 case Z_SortKey_sortAttributes:
654 yaz_log(YLOG_DEBUG, "Sort: key %d is of type sortAttributes", i+1);
655 sort_criteria[i].attrUse =
656 zebra_maps_sort (zh->reg->zebra_maps,
657 sk->u.sortAttributes,
658 &sort_criteria[i].numerical);
659 yaz_log(YLOG_DEBUG, "use value = %d", sort_criteria[i].attrUse);
660 if (sort_criteria[i].attrUse == -1)
665 if (sortIdx_type (zh->reg->sortIdx, sort_criteria[i].attrUse))
673 rfd = rset_open (rset, RSETF_READ);
674 while (rset_read (rfd, &key, &termid))
675 /* FIXME - pass a TERMID *, and use it for something below !! */
677 zint this_sys = key.mem[0];
679 if (this_sys != psysno)
683 resultSetInsertSort (zh, sset,
684 sort_criteria, num_criteria, psysno);
688 yaz_log(YLOG_DEBUG, ZINT_FORMAT " keys, " ZINT_FORMAT " sysnos, sort",
690 for (i = 0; i < numTerms; i++)
691 yaz_log(YLOG_LOG, "term=\"%s\" type=%s count=" ZINT_FORMAT,
692 terms[i]->name, terms[i]->flags, rset_count(terms[i]->rset));
693 *sort_status = Z_SortResponse_success;
696 RSET resultSetRef (ZebraHandle zh, const char *resultSetId)
700 if ((s = resultSetGet (zh, resultSetId)))
705 void resultSetRank (ZebraHandle zh, ZebraSet zebraSet, RSET rset, NMEM nmem)
715 ZebraRankClass rank_class;
716 struct rank_control *rc;
717 struct zset_sort_info *sort_info;
718 const char *rank_handler_name = res_get_def(zh->res, "rank", "rank-1");
720 zint est=-2; /* -2 not done, -1 can't do, >0 actual estimate*/
724 sort_info = zebraSet->sort_info;
725 sort_info->num_entries = 0;
727 rset_getterms(rset, 0, 0, &n);
728 terms = (TERMID *) nmem_malloc(nmem, sizeof(*terms)*n);
729 rset_getterms(rset, terms, n, &numTerms);
731 rfd = rset_open (rset, RSETF_READ);
733 rank_class = zebraRankLookup (zh, rank_handler_name);
736 yaz_log(YLOG_WARN, "No such rank handler: %s", rank_handler_name);
739 rc = rank_class->control;
741 if (rset_read (rfd, &key, &termid))
743 zint psysno = key.mem[0];
746 (*rc->begin) (zh->reg, rank_class->class_handle, rset, nmem,
749 esthits = atoi(res_get_def(zh->res, "estimatehits","0"));
751 est = -1; /* can not do */
754 zint this_sys = key.mem[0]; /* FIXME - assumes scope==2 */
755 zint seqno = key.mem[key.len-1]; /* FIXME - assumes scope==2 */
757 yaz_log(YLOG_LOG, "got sysno=%lld", this_sys);
758 if (this_sys != psysno)
760 score = (*rc->calc) (handle, psysno);
762 resultSetInsertRank (zh, sort_info, psysno, score, 'A');
766 (*rc->add) (handle, seqno, termid);
768 if ((est==-2) && (zebraSet->hits==esthits))
769 { /* time to estimate the hits */
770 rset_pos(rfd,&cur,&tot);
773 est = (zint)(0.5+zebraSet->hits/ratio);
774 yaz_log(YLOG_LOG, "Estimating hits (%s) "
775 "%0.1f->" ZINT_FORMAT
776 "; %0.1f->" ZINT_FORMAT,
780 i = 0; /* round to 3 significant digits */
787 zebraSet->hits = est;
791 while (rset_read (rfd, &key,&termid) && (est<0) );
792 score = (*rc->calc)(handle, psysno);
793 resultSetInsertRank(zh, sort_info, psysno, score, 'A');
794 (*rc->end) (zh->reg, handle);
798 yaz_log(YLOG_DEBUG, ZINT_FORMAT " keys, " ZINT_FORMAT " sysnos, rank",
799 kno, zebraSet->hits);
800 for (i = 0; i < numTerms; i++)
802 yaz_log(YLOG_LOG, "term=\"%s\" type=%s count=" ZINT_FORMAT,
803 terms[i]->name, terms[i]->flags, rset_count(terms[i]->rset));
807 ZebraRankClass zebraRankLookup (ZebraHandle zh, const char *name)
809 ZebraRankClass p = zh->reg->rank_classes;
810 while (p && strcmp (p->control->name, name))
812 if (p && !p->init_flag)
814 if (p->control->create)
815 p->class_handle = (*p->control->create)(zh);
821 void zebraRankInstall (struct zebra_register *reg, struct rank_control *ctrl)
823 ZebraRankClass p = (ZebraRankClass) xmalloc (sizeof(*p));
824 p->control = (struct rank_control *) xmalloc (sizeof(*p->control));
825 memcpy (p->control, ctrl, sizeof(*p->control));
826 p->control->name = xstrdup (ctrl->name);
828 p->next = reg->rank_classes;
829 reg->rank_classes = p;
832 void zebraRankDestroy (struct zebra_register *reg)
834 ZebraRankClass p = reg->rank_classes;
837 ZebraRankClass p_next = p->next;
838 if (p->init_flag && p->control->destroy)
839 (*p->control->destroy)(reg, p->class_handle);
840 xfree(p->control->name);
845 reg->rank_classes = NULL;