1 <chapter id="tools"><title>Supporting Tools</title>
4 In support of the service API - primarily the ASN module, which
5 provides the pro-grammatic interface to the Z39.50 APDUs, &yaz; contains
6 a collection of tools that support the development of applications.
9 <sect1 id="tools.query"><title>Query Syntax Parsers</title>
12 Since the type-1 (RPN) query structure has no direct, useful string
13 representation, every origin application needs to provide some form of
14 mapping from a local query notation or representation to a
15 <token>Z_RPNQuery</token> structure. Some programmers will prefer to
16 construct the query manually, perhaps using
17 <function>odr_malloc()</function> to simplify memory management.
18 The &yaz; distribution includes three separate, query-generating tools
19 that may be of use to you.
22 <sect2 id="PQF"><title>Prefix Query Format</title>
25 Since RPN or reverse polish notation is really just a fancy way of
26 describing a suffix notation format (operator follows operands), it
27 would seem that the confusion is total when we now introduce a prefix
28 notation for RPN. The reason is one of simple laziness - it's somewhat
29 simpler to interpret a prefix format, and this utility was designed
30 for maximum simplicity, to provide a baseline representation for use
31 in simple test applications and scripting environments (like Tcl). The
32 demonstration client included with YAZ uses the PQF.
37 The PQF have been adopted by other parties developing Z39.50
38 software. It is often referred to as Prefix Query Notation
43 The PQF is defined by the pquery module in the YAZ library.
44 There are two sets of function that have similar behavior. First
45 set operates on a PQF parser handle, second set doesn't. First set
46 set of functions are more flexible than the second set. Second set
47 is obsolete and is only provided to ensure backwards compatibility.
50 First set of functions all operate on a PQF parser handle:
53 #include <yaz/pquery.h>
55 YAZ_PQF_Parser yaz_pqf_create(void);
57 void yaz_pqf_destroy(YAZ_PQF_Parser p);
59 Z_RPNQuery *yaz_pqf_parse(YAZ_PQF_Parser p, ODR o, const char *qbuf);
61 Z_AttributesPlusTerm *yaz_pqf_scan(YAZ_PQF_Parser p, ODR o,
62 Odr_oid **attributeSetId, const char *qbuf);
64 int yaz_pqf_error(YAZ_PQF_Parser p, const char **msg, size_t *off);
67 A PQF parser is created and destructed by functions
68 <function>yaz_pqf_create</function> and
69 <function>yaz_pqf_destroy</function> respectively.
70 Function <function>yaz_pqf_parse</function> parses query given
71 by string <literal>qbuf</literal>. If parsing was successful,
72 a Z39.50 RPN Query is returned which is created using ODR stream
73 <literal>o</literal>. If parsing failed, a NULL pointer is
75 Function <function>yaz_pqf_scan</function> takes a scan query in
76 <literal>qbuf</literal>. If parsing was successful, the function
77 returns attributes plus term pointer and modifies
78 <literal>attributeSetId</literal> to hold attribute set for the
79 scan request - both allocated using ODR stream <literal>o</literal>.
80 If parsing failed, yaz_pqf_scan returns a NULL pointer.
81 Error information for bad queries can be obtained by a call to
82 <function>yaz_pqf_error</function> which returns an error code and
83 modifies <literal>*msg</literal> to point to an error description,
84 and modifies <literal>*off</literal> to the offset within last
85 query were parsing failed.
88 The second set of functions are declared as follows:
91 #include <yaz/pquery.h>
93 Z_RPNQuery *p_query_rpn(ODR o, oid_proto proto, const char *qbuf);
95 Z_AttributesPlusTerm *p_query_scan(ODR o, oid_proto proto,
96 Odr_oid **attributeSetP, const char *qbuf);
98 int p_query_attset(const char *arg);
101 The function <function>p_query_rpn()</function> takes as arguments an
102 &odr; stream (see section <link linkend="odr">The ODR Module</link>)
103 to provide a memory source (the structure created is released on
104 the next call to <function>odr_reset()</function> on the stream), a
105 protocol identifier (one of the constants <token>PROTO_Z3950</token> and
106 <token>PROTO_SR</token>), an attribute set reference, and
107 finally a null-terminated string holding the query string.
110 If the parse went well, <function>p_query_rpn()</function> returns a
111 pointer to a <literal>Z_RPNQuery</literal> structure which can be
112 placed directly into a <literal>Z_SearchRequest</literal>.
113 If parsing failed, due to syntax error, a NULL pointer is returned.
116 The <literal>p_query_attset</literal> specifies which attribute set
117 to use if the query doesn't specify one by the
118 <literal>@attrset</literal> operator.
119 The <literal>p_query_attset</literal> returns 0 if the argument is a
120 valid attribute set specifier; otherwise the function returns -1.
124 The grammar of the PQF is as follows:
128 query ::= top-set query-struct.
130 top-set ::= [ '@attrset' string ]
132 query-struct ::= attr-spec | simple | complex | '@term' term-type query
134 attr-spec ::= '@attr' [ string ] string query-struct
136 complex ::= operator query-struct query-struct.
138 operator ::= '@and' | '@or' | '@not' | '@prox' proximity.
140 simple ::= result-set | term.
142 result-set ::= '@set' string.
146 proximity ::= exclusion distance ordered relation which-code unit-code.
148 exclusion ::= '1' | '0' | 'void'.
150 distance ::= integer.
152 ordered ::= '1' | '0'.
154 relation ::= integer.
156 which-code ::= 'known' | 'private' | integer.
158 unit-code ::= integer.
160 term-type ::= 'general' | 'numeric' | 'string' | 'oid' | 'datetime' | 'null'.
164 You will note that the syntax above is a fairly faithful
165 representation of RPN, except for the Attribute, which has been
166 moved a step away from the term, allowing you to associate one or more
167 attributes with an entire query structure. The parser will
168 automatically apply the given attributes to each term as required.
172 The @attr operator is followed by an attribute specification
173 (<literal>attr-spec</literal> above). The specification consists
174 of an optional attribute set, an attribute type-value pair and
175 a sub-query. The attribute type-value pair is packed in one string:
176 an attribute type, an equals sign, and an attribute value, like this:
177 <literal>@attr 1=1003</literal>.
178 The type is always an integer but the value may be either an
179 integer or a string (if it doesn't start with a digit character).
180 A string attribute-value is encoded as a Type-1 ``complex''
181 attribute with the list of values containing the single string
182 specified, and including no semantic indicators.
186 Version 3 of the Z39.50 specification defines various encoding of terms.
187 Use <literal>@term </literal> <replaceable>type</replaceable>
188 <replaceable>string</replaceable>,
189 where type is one of: <literal>general</literal>,
190 <literal>numeric</literal> or <literal>string</literal>
191 (for InternationalString).
192 If no term type has been given, the <literal>general</literal> form
193 is used. This is the only encoding allowed in both versions 2 and 3
194 of the Z39.50 standard.
197 <sect3 id="PQF-prox">
198 <title>Using Proximity Operators with PQF</title>
201 This is an advanced topic, describing how to construct
202 queries that make very specific requirements on the
203 relative location of their operands.
204 You may wish to skip this section and go straight to
205 <link linkend="pqf-examples">the example PQF queries</link>.
210 Most Z39.50 servers do not support proximity searching, or
211 support only a small subset of the full functionality that
212 can be expressed using the PQF proximity operator. Be
213 aware that the ability to <emphasis>express</emphasis> a
214 query in PQF is no guarantee that any given server will
215 be able to <emphasis>execute</emphasis> it.
221 The proximity operator <literal>@prox</literal> is a special
222 and more restrictive version of the conjunction operator
223 <literal>@and</literal>. Its semantics are described in
224 section 3.7.2 (Proximity) of Z39.50 the standard itself, which
225 can be read on-line at
226 <ulink url="&url.z39.50.proximity;"/>
229 In PQF, the proximity operation is represented by a sequence
232 @prox <replaceable>exclusion</replaceable> <replaceable>distance</replaceable> <replaceable>ordered</replaceable> <replaceable>relation</replaceable> <replaceable>which-code</replaceable> <replaceable>unit-code</replaceable>
234 in which the meanings of the parameters are as described in in
235 the standard, and they can take the following values:
237 <listitem><formalpara><title>exclusion</title><para>
238 0 = false (i.e. the proximity condition specified by the
239 remaining parameters must be satisfied) or
240 1 = true (the proximity condition specified by the
241 remaining parameters must <emphasis>not</emphasis> be
243 </para></formalpara></listitem>
244 <listitem><formalpara><title>distance</title><para>
245 An integer specifying the difference between the locations
246 of the operands: e.g. two adjacent words would have
247 distance=1 since their locations differ by one unit.
248 </para></formalpara></listitem>
249 <listitem><formalpara><title>ordered</title><para>
250 1 = ordered (the operands must occur in the order the
251 query specifies them) or
252 0 = unordered (they may appear in either order).
253 </para></formalpara></listitem>
254 <listitem><formalpara><title>relation</title><para>
255 Recognised values are
259 4 (greaterThanOrEqual),
262 </para></formalpara></listitem>
263 <listitem><formalpara><title>which-code</title><para>
264 <literal>known</literal>
267 (the unit-code parameter is taken from the well-known list
268 of alternatives described in below) or
269 <literal>private</literal>
272 (the unit-code paramater has semantics specific to an
273 out-of-band agreement such as a profile).
274 </para></formalpara></listitem>
275 <listitem><formalpara><title>unit-code</title><para>
276 If the which-code parameter is <literal>known</literal>
277 then the recognised values are
289 If which-code is <literal>private</literal> then the
290 acceptable values are determined by the profile.
291 </para></formalpara></listitem>
293 (The numeric values of the relation and well-known unit-code
294 parameters are taken straight from
295 <ulink url="&url.z39.50.proximity.asn1;"
296 >the ASN.1</ulink> of the proximity structure in the standard.)
300 <sect3 id="pqf-examples"><title>PQF queries</title>
302 <example id="example.pqf.simple.terms">
303 <title>PQF queries using simple terms</title>
312 <example id="pqf.example.pqf.boolean.operators">
313 <title>PQF boolean operators</title>
316 @or "dylan" "zimmerman"
318 @and @or dylan zimmerman when
320 @and when @or dylan zimmerman
324 <example id="example.pqf.result.sets">
325 <title>PQF references to result sets</title>
330 @and @set seta @set setb
334 <example id="example.pqf.attributes">
335 <title>Attributes for terms</title>
340 @attr 1=4 @attr 4=1 "self portrait"
342 @attrset exp1 @attr 1=1 CategoryList
344 @attr gils 1=2008 Copenhagen
346 @attr 1=/book/title computer
350 <example id="example.pqf.proximity">
351 <title>PQF Proximity queries</title>
354 @prox 0 3 1 2 k 2 dylan zimmerman
357 Here the parameters 0, 3, 1, 2, k and 2 represent exclusion,
358 distance, ordered, relation, which-code and unit-code, in that
362 exclusion = 0: the proximity condition must hold
365 distance = 3: the terms must be three units apart
368 ordered = 1: they must occur in the order they are specified
371 relation = 2: lessThanOrEqual (to the distance of 3 units)
374 which-code is ``known'', so the standard unit-codes are used
380 So the whole proximity query means that the words
381 <literal>dylan</literal> and <literal>zimmerman</literal> must
382 both occur in the record, in that order, differing in position
383 by three or fewer words (i.e. with two or fewer words between
384 them.) The query would find ``Bob Dylan, aka. Robert
385 Zimmerman'', but not ``Bob Dylan, born as Robert Zimmerman''
386 since the distance in this case is four.
390 <example id="example.pqf.search.term.type">
391 <title>PQF specification of search term type</title>
394 @term string "a UTF-8 string, maybe?"
398 <example id="example.pqf.mixed.queries">
399 <title>PQF mixed queries</title>
402 @or @and bob dylan @set Result-1
404 @attr 4=1 @and @attr 1=1 "bob dylan" @attr 1=4 "slow train coming"
406 @and @attr 2=4 @attr gils 1=2038 -114 @attr 2=2 @attr gils 1=2039 -109
410 The last of these examples is a spatial search: in
411 <ulink url="http://www.gils.net/prof_v2.html#sec_7_4"
412 >the GILS attribute set</ulink>,
414 2038 indicates West Bounding Coordinate and
415 2030 indicates East Bounding Coordinate,
416 so the query is for areas extending from -114 degrees
417 to no more than -109 degrees.
424 <sect2 id="CCL"><title>CCL</title>
427 Not all users enjoy typing in prefix query structures and numerical
428 attribute values, even in a minimalistic test client. In the library
429 world, the more intuitive Common Command Language - CCL (ISO 8777)
430 has enjoyed some popularity - especially before the widespread
431 availability of graphical interfaces. It is still useful in
432 applications where you for some reason or other need to provide a
433 symbolic language for expressing boolean query structures.
436 <sect3 id="ccl.syntax">
437 <title>CCL Syntax</title>
440 The CCL parser obeys the following grammar for the FIND argument.
441 The syntax is annotated by in the lines prefixed by
442 <literal>--</literal>.
446 CCL-Find ::= CCL-Find Op Elements
449 Op ::= "and" | "or" | "not"
450 -- The above means that Elements are separated by boolean operators.
452 Elements ::= '(' CCL-Find ')'
455 | Qualifiers Relation Terms
456 | Qualifiers Relation '(' CCL-Find ')'
457 | Qualifiers '=' string '-' string
458 -- Elements is either a recursive definition, a result set reference, a
459 -- list of terms, qualifiers followed by terms, qualifiers followed
460 -- by a recursive definition or qualifiers in a range (lower - upper).
462 Set ::= 'set' = string
463 -- Reference to a result set
465 Terms ::= Terms Prox Term
467 -- Proximity of terms.
471 -- This basically means that a term may include a blank
473 Qualifiers ::= Qualifiers ',' string
475 -- Qualifiers is a list of strings separated by comma
477 Relation ::= '=' | '>=' | '<=' | '<>' | '>' | '<'
478 -- Relational operators. This really doesn't follow the ISO8777
482 -- Proximity operator
486 <example id="example.ccl.queries">
487 <title>CCL queries</title>
489 The following queries are all valid:
501 (dylan and bob) or set=1
511 Assuming that the qualifiers <literal>ti</literal>,
512 <literal>au</literal>
513 and <literal>date</literal> are defined we may use:
519 au=(bob dylan and slow train coming)
521 date>1980 and (ti=((self portrait)))
527 <sect3 id="ccl.qualifiers">
528 <title>CCL Qualifiers</title>
531 Qualifiers are used to direct the search to a particular searchable
532 index, such as title (ti) and author indexes (au). The CCL standard
533 itself doesn't specify a particular set of qualifiers, but it does
534 suggest a few short-hand notations. You can customize the CCL parser
535 to support a particular set of qualifiers to reflect the current target
536 profile. Traditionally, a qualifier would map to a particular
537 use-attribute within the BIB-1 attribute set. It is also
538 possible to set other attributes, such as the structure
543 A CCL profile is a set of predefined CCL qualifiers that may be
544 read from a file or set in the CCL API.
545 The YAZ client reads its CCL qualifiers from a file named
546 <filename>default.bib</filename>. There are four types of
547 lines in a CCL profile: qualifier specification,
548 qualifier alias, comments and directives.
550 <sect4 id="ccl.qualifier.specification">
551 <title>Qualifier specification</title>
553 A qualifier specification is of the form:
557 <replaceable>qualifier-name</replaceable>
558 [<replaceable>attributeset</replaceable><literal>,</literal>]<replaceable>type</replaceable><literal>=</literal><replaceable>val</replaceable>
559 [<replaceable>attributeset</replaceable><literal>,</literal>]<replaceable>type</replaceable><literal>=</literal><replaceable>val</replaceable> ...
563 where <replaceable>qualifier-name</replaceable> is the name of the
564 qualifier to be used (eg. <literal>ti</literal>),
565 <replaceable>type</replaceable> is attribute type in the attribute
566 set (Bib-1 is used if no attribute set is given) and
567 <replaceable>val</replaceable> is attribute value.
568 The <replaceable>type</replaceable> can be specified as an
569 integer or as it be specified either as a single-letter:
570 <literal>u</literal> for use,
571 <literal>r</literal> for relation,<literal>p</literal> for position,
572 <literal>s</literal> for structure,<literal>t</literal> for truncation
573 or <literal>c</literal> for completeness.
574 The attributes for the special qualifier name <literal>term</literal>
575 are used when no CCL qualifier is given in a query.
576 <table id="ccl.common.bib1.attributes">
577 <title>Common Bib-1 attributes</title>
579 <colspec colwidth="2*" colname="type"></colspec>
580 <colspec colwidth="9*" colname="description"></colspec>
584 <entry>Description</entry>
589 <entry><literal>u=</literal><replaceable>value</replaceable></entry>
591 Use attribute (1). Common use attributes are
592 1 Personal-name, 4 Title, 7 ISBN, 8 ISSN, 30 Date,
593 62 Subject, 1003 Author), 1016 Any. Specify value
599 <entry><literal>r=</literal><replaceable>value</replaceable></entry>
601 Relation attribute (2). Common values are
602 1 <, 2 <=, 3 =, 4 >=, 5 >, 6 <>,
603 100 phonetic, 101 stem, 102 relevance, 103 always matches.
608 <entry><literal>p=</literal><replaceable>value</replaceable></entry>
610 Position attribute (3). Values: 1 first in field, 2
611 first in any subfield, 3 any position in field.
616 <entry><literal>s=</literal><replaceable>value</replaceable></entry>
618 Structure attribute (4). Values: 1 phrase, 2 word,
619 3 key, 4 year, 5 date, 6 word list, 100 date (un),
620 101 name (norm), 102 name (un), 103 structure, 104 urx,
621 105 free-form-text, 106 document-text, 107 local-number,
622 108 string, 109 numeric string.
627 <entry><literal>t=</literal><replaceable>value</replaceable></entry>
629 Truncation attribute (5). Values: 1 right, 2 left,
630 3 left& right, 100 none, 101 process #, 102 regular-1,
631 103 regular-2, 104 CCL.
636 <entry><literal>c=</literal><replaceable>value</replaceable></entry>
638 Completeness attribute (6). Values: 1 incomplete subfield,
639 2 complete subfield, 3 complete field.
648 Refer to <xref linkend="bib1"/> or the complete
649 <ulink url="&url.z39.50.attset.bib1;">list of Bib-1 attributes</ulink>
652 It is also possible to specify non-numeric attribute values,
653 which are used in combination with certain types.
654 The special combinations are:
656 <table id="ccl.special.attribute.combos">
657 <title>Special attribute combos</title>
659 <colspec colwidth="2*" colname="name"></colspec>
660 <colspec colwidth="9*" colname="description"></colspec>
664 <entry>Description</entry>
669 <entry><literal>s=pw</literal></entry><entry>
670 The structure is set to either word or phrase depending
671 on the number of tokens in a term (phrase-word).
675 <entry><literal>s=al</literal></entry><entry>
676 Each token in the term is ANDed. (and-list).
677 This does not set the structure at all.
681 <row><entry><literal>s=ol</literal></entry><entry>
682 Each token in the term is ORed. (or-list).
683 This does not set the structure at all.
687 <row><entry><literal>s=ag</literal></entry><entry>
688 Tokens that appears as phrases (with blank in them) gets
689 structure phrase attached (4=1). Tokens that appear to be words
690 gets structure word attached (4=2). Phrases and words are
691 ANDed. This is a variant of s=al and s=pw, with the main
692 difference that words are not split (with operator AND)
693 but instead kept in one RPN token. This facility appeared
698 <row><entry><literal>r=o</literal></entry><entry>
699 Allows ranges and the operators greather-than, less-than, ...
701 This sets Bib-1 relation attribute accordingly (relation
702 ordered). A query construct is only treated as a range if
703 dash is used and that is surrounded by white-space. So
704 <literal>-1980</literal> is treated as term
705 <literal>"-1980"</literal> not <literal><= 1980</literal>.
706 If <literal>- 1980</literal> is used, however, that is
711 <row><entry><literal>r=r</literal></entry><entry>
712 Similar to <literal>r=o</literal> but assumes that terms
713 are non-negative (not prefixed with <literal>-</literal>).
714 Thus, a dash will always be treated as a range.
715 The construct <literal>1980-1990</literal> is
716 treated as a range with <literal>r=r</literal> but as a
717 single term <literal>"1980-1990"</literal> with
718 <literal>r=o</literal>. The special attribute
719 <literal>r=r</literal> is available in YAZ 2.0.24 or later.
723 <row><entry><literal>t=l</literal></entry><entry>
724 Allows term to be left-truncated.
725 If term is of the form <literal>?x</literal>, the resulting
726 Type-1 term is <literal>x</literal> and truncation is left.
730 <row><entry><literal>t=r</literal></entry><entry>
731 Allows term to be right-truncated.
732 If term is of the form <literal>x?</literal>, the resulting
733 Type-1 term is <literal>x</literal> and truncation is right.
737 <row><entry><literal>t=n</literal></entry><entry>
738 If term is does not include <literal>?</literal>, the
739 truncation attribute is set to none (100).
743 <row><entry><literal>t=b</literal></entry><entry>
744 Allows term to be both left&right truncated.
745 If term is of the form <literal>?x?</literal>, the
746 resulting term is <literal>x</literal> and trunctation is
747 set to both left&right.
751 <row><entry><literal>t=x</literal></entry><entry>
752 Allows masking anywhere in a term, thus fully supporting
753 # (mask one character) and ? (zero or more of any).
754 If masking is used, trunction is set to 102 (regexp-1 in term)
755 and the term is converted accordingly to a regular expression.
759 <row><entry><literal>t=z</literal></entry><entry>
760 Allows masking anywhere in a term, thus fully supporting
761 # (mask one character) and ? (zero or more of any).
762 If masking is used, trunction is set to 104 (Z39.58 in term)
763 and the term is converted accordingly to Z39.58 masking term -
764 actually the same truncation as CCL itself.
772 <example id="example.ccl.profile"><title>CCL profile</title>
774 Consider the following definition:
785 <literal>ti</literal> and <literal>au</literal> both set
786 structure attribute to phrase (s=1).
787 <literal>ti</literal>
788 sets the use-attribute to 4. <literal>au</literal> sets the
790 When no qualifiers are used in the query the structure-attribute is
791 set to free-form-text (105) (rule for <literal>term</literal>).
792 The <literal>date</literal> sets the relation attribute to
793 the relation used in the CCL query and sets the use attribute
797 You can combine attributes. To Search for "ranked title" you
800 ti,ranked=knuth computer
802 which will set relation=ranked, use=title, structure=phrase.
809 is a valid query. But
817 <sect4 id="ccl.qualifier.alias">
818 <title>Qualifier alias</title>
820 A qualifier alias is of the form:
823 <replaceable>q</replaceable>
824 <replaceable>q1</replaceable> <replaceable>q2</replaceable> ..
827 which declares <replaceable>q</replaceable> to
828 be an alias for <replaceable>q1</replaceable>,
829 <replaceable>q2</replaceable>... such that the CCL
830 query <replaceable>q=x</replaceable> is equivalent to
831 <replaceable>q1=x or q2=x or ...</replaceable>.
835 <sect4 id="ccl.comments">
836 <title>Comments</title>
838 Lines with white space or lines that begin with
839 character <literal>#</literal> are treated as comments.
843 <sect4 id="ccl.directives">
844 <title>Directives</title>
846 Directive specifications takes the form
848 <para><literal>@</literal><replaceable>directive</replaceable> <replaceable>value</replaceable>
850 <table id="ccl.directives.table">
851 <title>CCL directives</title>
853 <colspec colwidth="2*" colname="name"></colspec>
854 <colspec colwidth="8*" colname="description"></colspec>
855 <colspec colwidth="1*" colname="default"></colspec>
859 <entry>Description</entry>
860 <entry>Default</entry>
865 <entry>truncation</entry>
866 <entry>Truncation character</entry>
867 <entry><literal>?</literal></entry>
871 <entry>Masking character. Requires YAZ 4.2.58 or later</entry>
872 <entry><literal>#</literal></entry>
876 <entry>Specifies how multiple fields are to be
877 combined. There are two modes: <literal>or</literal>:
878 multiple qualifier fields are ORed,
879 <literal>merge</literal>: attributes for the qualifier
880 fields are merged and assigned to one term.
882 <entry><literal>merge</literal></entry>
886 <entry>Specifies if CCL operators and qualifiers should be
887 compared with case sensitivity or not. Specify 1 for
888 case sensitive; 0 for case insensitive.</entry>
889 <entry><literal>1</literal></entry>
894 <entry>Specifies token for CCL operator AND.</entry>
895 <entry><literal>and</literal></entry>
900 <entry>Specifies token for CCL operator OR.</entry>
901 <entry><literal>or</literal></entry>
906 <entry>Specifies token for CCL operator NOT.</entry>
907 <entry><literal>not</literal></entry>
912 <entry>Specifies token for CCL operator SET.</entry>
913 <entry><literal>set</literal></entry>
921 <title>CCL API</title>
923 All public definitions can be found in the header file
924 <filename>ccl.h</filename>. A profile identifier is of type
925 <literal>CCL_bibset</literal>. A profile must be created with the call
926 to the function <function>ccl_qual_mk</function> which returns a profile
927 handle of type <literal>CCL_bibset</literal>.
931 To read a file containing qualifier definitions the function
932 <function>ccl_qual_file</function> may be convenient. This function
933 takes an already opened <literal>FILE</literal> handle pointer as
934 argument along with a <literal>CCL_bibset</literal> handle.
938 To parse a simple string with a FIND query use the function
941 struct ccl_rpn_node *ccl_find_str(CCL_bibset bibset, const char *str,
942 int *error, int *pos);
945 which takes the CCL profile (<literal>bibset</literal>) and query
946 (<literal>str</literal>) as input. Upon successful completion the RPN
947 tree is returned. If an error occur, such as a syntax error, the integer
948 pointed to by <literal>error</literal> holds the error code and
949 <literal>pos</literal> holds the offset inside query string in which
954 An English representation of the error may be obtained by calling
955 the <literal>ccl_err_msg</literal> function. The error codes are
956 listed in <filename>ccl.h</filename>.
960 To convert the CCL RPN tree (type
961 <literal>struct ccl_rpn_node *</literal>)
962 to the Z_RPNQuery of YAZ the function <function>ccl_rpn_query</function>
963 must be used. This function which is part of YAZ is implemented in
964 <filename>yaz-ccl.c</filename>.
965 After calling this function the CCL RPN tree is probably no longer
966 needed. The <literal>ccl_rpn_delete</literal> destroys the CCL RPN tree.
970 A CCL profile may be destroyed by calling the
971 <function>ccl_qual_rm</function> function.
975 The token names for the CCL operators may be changed by setting the
976 globals (all type <literal>char *</literal>)
977 <literal>ccl_token_and</literal>, <literal>ccl_token_or</literal>,
978 <literal>ccl_token_not</literal> and <literal>ccl_token_set</literal>.
979 An operator may have aliases, i.e. there may be more than one name for
980 the operator. To do this, separate each alias with a space character.
984 <sect2 id="cql"><title>CQL</title>
986 <ulink url="&url.cql;">CQL</ulink>
987 - Common Query Language - was defined for the
988 <ulink url="&url.sru;">SRU</ulink> protocol.
989 In many ways CQL has a similar syntax to CCL.
990 The objective of CQL is different. Where CCL aims to be
991 an end-user language, CQL is <emphasis>the</emphasis> protocol
992 query language for SRU.
996 If you are new to CQL, read the
997 <ulink url="&url.cql.intro;">Gentle Introduction</ulink>.
1001 The CQL parser in &yaz; provides the following:
1005 It parses and validates a CQL query.
1010 It generates a C structure that allows you to convert
1011 a CQL query to some other query language, such as SQL.
1016 The parser converts a valid CQL query to PQF, thus providing a
1017 way to use CQL for both SRU servers and Z39.50 targets at the
1023 The parser converts CQL to
1024 <ulink url="&url.xcql;">XCQL</ulink>.
1025 XCQL is an XML representation of CQL.
1026 XCQL is part of the SRU specification. However, since SRU
1027 supports CQL only, we don't expect XCQL to be widely used.
1028 Furthermore, CQL has the advantage over XCQL that it is
1034 <sect3 id="cql.parsing"><title>CQL parsing</title>
1036 A CQL parser is represented by the <literal>CQL_parser</literal>
1037 handle. Its contents should be considered &yaz; internal (private).
1039 #include <yaz/cql.h>
1041 typedef struct cql_parser *CQL_parser;
1043 CQL_parser cql_parser_create(void);
1044 void cql_parser_destroy(CQL_parser cp);
1046 A parser is created by <function>cql_parser_create</function> and
1047 is destroyed by <function>cql_parser_destroy</function>.
1050 To parse a CQL query string, the following function
1053 int cql_parser_string(CQL_parser cp, const char *str);
1055 A CQL query is parsed by the <function>cql_parser_string</function>
1056 which takes a query <parameter>str</parameter>.
1057 If the query was valid (no syntax errors), then zero is returned;
1058 otherwise -1 is returned to indicate a syntax error.
1062 int cql_parser_stream(CQL_parser cp,
1063 int (*getbyte)(void *client_data),
1064 void (*ungetbyte)(int b, void *client_data),
1067 int cql_parser_stdio(CQL_parser cp, FILE *f);
1069 The functions <function>cql_parser_stream</function> and
1070 <function>cql_parser_stdio</function> parses a CQL query
1071 - just like <function>cql_parser_string</function>.
1072 The only difference is that the CQL query can be
1073 fed to the parser in different ways.
1074 The <function>cql_parser_stream</function> uses a generic
1075 byte stream as input. The <function>cql_parser_stdio</function>
1076 uses a <literal>FILE</literal> handle which is opened for reading.
1080 <sect3 id="cql.tree"><title>CQL tree</title>
1082 The the query string is valid, the CQL parser
1083 generates a tree representing the structure of the
1088 struct cql_node *cql_parser_result(CQL_parser cp);
1090 <function>cql_parser_result</function> returns the
1091 a pointer to the root node of the resulting tree.
1094 Each node in a CQL tree is represented by a
1095 <literal>struct cql_node</literal>.
1096 It is defined as follows:
1098 #define CQL_NODE_ST 1
1099 #define CQL_NODE_BOOL 2
1100 #define CQL_NODE_SORT 3
1110 struct cql_node *modifiers;
1114 struct cql_node *left;
1115 struct cql_node *right;
1116 struct cql_node *modifiers;
1120 struct cql_node *next;
1121 struct cql_node *modifiers;
1122 struct cql_node *search;
1127 There are three node types: search term (ST), boolean (BOOL)
1129 A modifier is treated as a search term too.
1132 The search term node has five members:
1136 <literal>index</literal>: index for search term.
1137 If an index is unspecified for a search term,
1138 <literal>index</literal> will be NULL.
1143 <literal>index_uri</literal>: index URi for search term
1144 or NULL if none could be resolved for the index.
1149 <literal>term</literal>: the search term itself.
1154 <literal>relation</literal>: relation for search term.
1159 <literal>relation_uri</literal>: relation URI for search term.
1164 <literal>modifiers</literal>: relation modifiers for search
1165 term. The <literal>modifiers</literal> list itself of cql_nodes
1166 each of type <literal>ST</literal>.
1173 The boolean node represents <literal>and</literal>,
1174 <literal>or</literal>, <literal>not</literal> +
1179 <literal>left</literal> and <literal>right</literal>: left
1180 - and right operand respectively.
1185 <literal>modifiers</literal>: proximity arguments.
1192 The sort node represents both the SORTBY clause.
1196 <sect3 id="cql.to.pqf"><title>CQL to PQF conversion</title>
1198 Conversion to PQF (and Z39.50 RPN) is tricky by the fact
1199 that the resulting RPN depends on the Z39.50 target
1200 capabilities (combinations of supported attributes).
1201 In addition, the CQL and SRU operates on index prefixes
1202 (URI or strings), whereas the RPN uses Object Identifiers
1206 The CQL library of &yaz; defines a <literal>cql_transform_t</literal>
1207 type. It represents a particular mapping between CQL and RPN.
1208 This handle is created and destroyed by the functions:
1210 cql_transform_t cql_transform_open_FILE (FILE *f);
1211 cql_transform_t cql_transform_open_fname(const char *fname);
1212 void cql_transform_close(cql_transform_t ct);
1214 The first two functions create a tranformation handle from
1215 either an already open FILE or from a filename respectively.
1218 The handle is destroyed by <function>cql_transform_close</function>
1219 in which case no further reference of the handle is allowed.
1222 When a <literal>cql_transform_t</literal> handle has been created
1223 you can convert to RPN.
1225 int cql_transform_buf(cql_transform_t ct,
1226 struct cql_node *cn, char *out, int max);
1228 This function converts the CQL tree <literal>cn</literal>
1229 using handle <literal>ct</literal>.
1230 For the resulting PQF, you supply a buffer <literal>out</literal>
1231 which must be able to hold at at least <literal>max</literal>
1235 If conversion failed, <function>cql_transform_buf</function>
1236 returns a non-zero SRU error code; otherwise zero is returned
1237 (conversion successful). The meanings of the numeric error
1238 codes are listed in the SRU specifications at
1239 <ulink url="&url.sru.diagnostics.list;"/>
1242 If conversion fails, more information can be obtained by calling
1244 int cql_transform_error(cql_transform_t ct, char **addinfop);
1246 This function returns the most recently returned numeric
1247 error-code and sets the string-pointer at
1248 <literal>*addinfop</literal> to point to a string containing
1249 additional information about the error that occurred: for
1250 example, if the error code is 15 (``Illegal or unsupported context
1251 set''), the additional information is the name of the requested
1252 context set that was not recognised.
1255 The SRU error-codes may be translated into brief human-readable
1256 error messages using
1258 const char *cql_strerror(int code);
1262 If you wish to be able to produce a PQF result in a different
1263 way, there are two alternatives.
1265 void cql_transform_pr(cql_transform_t ct,
1266 struct cql_node *cn,
1267 void (*pr)(const char *buf, void *client_data),
1270 int cql_transform_FILE(cql_transform_t ct,
1271 struct cql_node *cn, FILE *f);
1273 The former function produces output to a user-defined
1274 output stream. The latter writes the result to an already
1275 open <literal>FILE</literal>.
1278 <sect3 id="cql.to.rpn">
1279 <title>Specification of CQL to RPN mappings</title>
1281 The file supplied to functions
1282 <function>cql_transform_open_FILE</function>,
1283 <function>cql_transform_open_fname</function> follows
1284 a structure found in many Unix utilities.
1285 It consists of mapping specifications - one per line.
1286 Lines starting with <literal>#</literal> are ignored (comments).
1289 Each line is of the form
1291 <replaceable>CQL pattern</replaceable><literal> = </literal> <replaceable> RPN equivalent</replaceable>
1295 An RPN pattern is a simple attribute list. Each attribute pair
1298 [<replaceable>set</replaceable>] <replaceable>type</replaceable><literal>=</literal><replaceable>value</replaceable>
1300 The attribute <replaceable>set</replaceable> is optional.
1301 The <replaceable>type</replaceable> is the attribute type,
1302 <replaceable>value</replaceable> the attribute value.
1305 The character <literal>*</literal> (asterisk) has special meaning
1306 when used in the RPN pattern.
1307 Each occurrence of <literal>*</literal> is substituted with the
1308 CQL matching name (index, relation, qualifier etc).
1309 This facility can be used to copy a CQL name verbatim to the RPN result.
1312 The following CQL patterns are recognized:
1314 <varlistentry><term>
1315 <literal>index.</literal><replaceable>set</replaceable><literal>.</literal><replaceable>name</replaceable>
1319 This pattern is invoked when a CQL index, such as
1320 dc.title is converted. <replaceable>set</replaceable>
1321 and <replaceable>name</replaceable> are the context set and index
1323 Typically, the RPN specifies an equivalent use attribute.
1326 For terms not bound by an index the pattern
1327 <literal>index.cql.serverChoice</literal> is used.
1328 Here, the prefix <literal>cql</literal> is defined as
1329 <literal>http://www.loc.gov/zing/cql/cql-indexes/v1.0/</literal>.
1330 If this pattern is not defined, the mapping will fail.
1334 <literal>index.</literal><replaceable>set</replaceable><literal>.*</literal>
1335 is used when no other index pattern is matched.
1339 <varlistentry><term>
1340 <literal>qualifier.</literal><replaceable>set</replaceable><literal>.</literal><replaceable>name</replaceable>
1345 For backwards compatibility, this is recognised as a synonym of
1346 <literal>index.</literal><replaceable>set</replaceable><literal>.</literal><replaceable>name</replaceable>
1350 <varlistentry><term>
1351 <literal>relation.</literal><replaceable>relation</replaceable>
1355 This pattern specifies how a CQL relation is mapped to RPN.
1356 <replaceable>pattern</replaceable> is name of relation
1357 operator. Since <literal>=</literal> is used as
1358 separator between CQL pattern and RPN, CQL relations
1359 including <literal>=</literal> cannot be
1360 used directly. To avoid a conflict, the names
1361 <literal>ge</literal>,
1362 <literal>eq</literal>,
1363 <literal>le</literal>,
1364 must be used for CQL operators, greater-than-or-equal,
1365 equal, less-than-or-equal respectively.
1366 The RPN pattern is supposed to include a relation attribute.
1369 For terms not bound by a relation, the pattern
1370 <literal>relation.scr</literal> is used. If the pattern
1371 is not defined, the mapping will fail.
1374 The special pattern, <literal>relation.*</literal> is used
1375 when no other relation pattern is matched.
1380 <varlistentry><term>
1381 <literal>relationModifier.</literal><replaceable>mod</replaceable>
1385 This pattern specifies how a CQL relation modifier is mapped to RPN.
1386 The RPN pattern is usually a relation attribute.
1391 <varlistentry><term>
1392 <literal>structure.</literal><replaceable>type</replaceable>
1396 This pattern specifies how a CQL structure is mapped to RPN.
1397 Note that this CQL pattern is somewhat to similar to
1398 CQL pattern <literal>relation</literal>.
1399 The <replaceable>type</replaceable> is a CQL relation.
1402 The pattern, <literal>structure.*</literal> is used
1403 when no other structure pattern is matched.
1404 Usually, the RPN equivalent specifies a structure attribute.
1409 <varlistentry><term>
1410 <literal>position.</literal><replaceable>type</replaceable>
1414 This pattern specifies how the anchor (position) of
1415 CQL is mapped to RPN.
1416 The <replaceable>type</replaceable> is one
1417 of <literal>first</literal>, <literal>any</literal>,
1418 <literal>last</literal>, <literal>firstAndLast</literal>.
1421 The pattern, <literal>position.*</literal> is used
1422 when no other position pattern is matched.
1427 <varlistentry><term>
1428 <literal>set.</literal><replaceable>prefix</replaceable>
1432 This specification defines a CQL context set for a given prefix.
1433 The value on the right hand side is the URI for the set -
1434 <emphasis>not</emphasis> RPN. All prefixes used in
1435 index patterns must be defined this way.
1440 <varlistentry><term>
1441 <literal>set</literal>
1445 This specification defines a default CQL context set for index names.
1446 The value on the right hand side is the URI for the set.
1453 <example id="example.cql.to.rpn.mapping">
1454 <title>CQL to RPN mapping file</title>
1456 This simple file defines two context sets, three indexes and three
1457 relations, a position pattern and a default structure.
1459 <programlisting><![CDATA[
1460 set.cql = http://www.loc.gov/zing/cql/context-sets/cql/v1.1/
1461 set.dc = http://www.loc.gov/zing/cql/dc-indexes/v1.0/
1463 index.cql.serverChoice = 1=1016
1464 index.dc.title = 1=4
1465 index.dc.subject = 1=21
1471 position.any = 3=3 6=1
1477 With the mappings above, the CQL query
1481 is converted to the PQF:
1483 @attr 1=1016 @attr 2=3 @attr 4=1 @attr 3=3 @attr 6=1 "computer"
1485 by rules <literal>index.cql.serverChoice</literal>,
1486 <literal>relation.scr</literal>, <literal>structure.*</literal>,
1487 <literal>position.any</literal>.
1494 is rejected, since <literal>position.right</literal> is
1500 >my = "http://www.loc.gov/zing/cql/dc-indexes/v1.0/" my.title = x
1504 @attr 1=4 @attr 2=3 @attr 4=1 @attr 3=3 @attr 6=1 "x"
1508 <example id="example.cql.to.rpn.string">
1509 <title>CQL to RPN string attributes</title>
1511 In this example we allow any index to be passed to RPN as
1514 <programlisting><![CDATA[
1515 # Identifiers for prefixes used in this file. (index.*)
1516 set.cql = info:srw/cql-context-set/1/cql-v1.1
1517 set.rpn = http://bogus/rpn
1518 set = http://bogus/rpn
1520 # The default index when none is specified by the query
1521 index.cql.serverChoice = 1=any
1530 The <literal>http://bogus/rpn</literal> context set is also the default
1531 so we can make queries such as
1535 which is converted to
1537 @attr 2=3 @attr 4=1 @attr 3=3 @attr 1=title "a"
1541 <example id="example.cql.to.rpn.bathprofile">
1542 <title>CQL to RPN using Bath Profile</title>
1544 The file <filename>etc/pqf.properties</filename> has mappings from
1545 the Bath Profile and Dublin Core to RPN.
1546 If YAZ is installed as a package it's usually located
1547 in <filename>/usr/share/yaz/etc</filename> and part of the
1548 development package, such as <literal>libyaz-dev</literal>.
1552 <sect3 id="cql.xcql"><title>CQL to XCQL conversion</title>
1554 Conversion from CQL to XCQL is trivial and does not
1555 require a mapping to be defined.
1556 There three functions to choose from depending on the
1557 way you wish to store the resulting output (XML buffer
1560 int cql_to_xml_buf(struct cql_node *cn, char *out, int max);
1561 void cql_to_xml(struct cql_node *cn,
1562 void (*pr)(const char *buf, void *client_data),
1564 void cql_to_xml_stdio(struct cql_node *cn, FILE *f);
1566 Function <function>cql_to_xml_buf</function> converts
1567 to XCQL and stores result in a user supplied buffer of a given
1571 <function>cql_to_xml</function> writes the result in
1572 a user defined output stream.
1573 <function>cql_to_xml_stdio</function> writes to a
1577 <sect3 id="rpn.to.cql">
1578 <title>PQF to CQL conversion</title>
1580 Conversion from PQF to CQL is offered by the two functions shown
1581 below. The former uses a generic stream for result. The latter
1582 puts result in a WRBUF (string container).
1584 #include <yaz/rpn2cql.h>
1586 int cql_transform_rpn2cql_stream(cql_transform_t ct,
1587 void (*pr)(const char *buf, void *client_data),
1591 int cql_transform_rpn2cql_wrbuf(cql_transform_t ct,
1595 The configuration is the same as used in CQL to PQF conversions.
1600 <sect1 id="tools.oid"><title>Object Identifiers</title>
1603 The basic YAZ representation of an OID is an array of integers,
1604 terminated with the value -1. This integer is of type
1605 <literal>Odr_oid</literal>.
1608 Fundamental OID operations and the type <literal>Odr_oid</literal>
1609 are defined in <filename>yaz/oid_util.h</filename>.
1612 An OID can either be declared as a automatic variable or it can
1613 allocated using the memory utilities or ODR/NMEM. It's
1614 guaranteed that an OID can fit in <literal>OID_SIZE</literal> integers.
1616 <example id="tools.oid.bib1.1"><title>Create OID on stack</title>
1618 We can create an OID for the Bib-1 attribute set with:
1620 Odr_oid bib1[OID_SIZE];
1632 And OID may also be filled from a string-based representation using
1633 dots (.). This is achieved by function
1635 int oid_dotstring_to_oid(const char *name, Odr_oid *oid);
1637 This functions returns 0 if name could be converted; -1 otherwise.
1639 <example id="tools.oid.bib1.2"><title>Using oid_oiddotstring_to_oid</title>
1641 We can fill the Bib-1 attribute set OID easier with:
1643 Odr_oid bib1[OID_SIZE];
1644 oid_oiddotstring_to_oid("1.2.840.10003.3.1", bib1);
1649 We can also allocate an OID dynamically on a ODR stream with:
1651 Odr_oid *odr_getoidbystr(ODR o, const char *str);
1653 This creates an OID from string-based representation using dots.
1654 This function take an &odr; stream as parameter. This stream is used to
1655 allocate memory for the data elements, which is released on a
1656 subsequent call to <function>odr_reset()</function> on that stream.
1659 <example id="tools.oid.bib1.3"><title>Using odr_getoidbystr</title>
1661 We can create a OID for the Bib-1 attribute set with:
1663 Odr_oid *bib1 = odr_getoidbystr(odr, "1.2.840.10003.3.1");
1671 char *oid_oid_to_dotstring(const Odr_oid *oid, char *oidbuf)
1673 does the reverse of <function>oid_oiddotstring_to_oid</function>. It
1674 converts an OID to the string-based representation using dots.
1675 The supplied char buffer <literal>oidbuf</literal> holds the resulting
1676 string and must be at least <literal>OID_STR_MAX</literal> in size.
1680 OIDs can be copied with <function>oid_oidcpy</function> which takes
1681 two OID lists as arguments. Alternativly, an OID copy can be allocated
1682 on a ODR stream with:
1684 Odr_oid *odr_oiddup(ODR odr, const Odr_oid *o);
1689 OIDs can be compared with <function>oid_oidcmp</function> which returns
1690 zero if the two OIDs provided are identical; non-zero otherwise.
1693 <sect2 id="tools.oid.database"><title>OID database</title>
1695 From YAZ version 3 and later, the oident system has been replaced
1696 by an OID database. OID database is a misnomer .. the old odient
1697 system was also a database.
1700 The OID database is really just a map between named Object Identifiers
1701 (string) and their OID raw equivalents. Most operations either
1702 convert from string to OID or other way around.
1705 Unfortunately, whenever we supply a string we must also specify the
1706 <emphasis>OID class</emphasis>. The class is necessary because some
1707 strings correspond to multiple OIDs. An example of such a string is
1708 <literal>Bib-1</literal> which may either be an attribute-set
1709 or a diagnostic-set.
1712 Applications using the YAZ database should include
1713 <filename>yaz/oid_db.h</filename>.
1716 A YAZ database handle is of type <literal>yaz_oid_db_t</literal>.
1717 Actually that's a pointer. You need not think deal with that.
1718 YAZ has a built-in database which can be considered "constant" for
1720 We can get hold that by using function <function>yaz_oid_std</function>.
1723 All functions with prefix <function>yaz_string_to_oid</function>
1724 converts from class + string to OID. We have variants of this
1725 operation due to different memory allocation strategies.
1728 All functions with prefix
1729 <function>yaz_oid_to_string</function> converts from OID to string
1733 <example id="tools.oid.bib1.4"><title>Create OID with YAZ DB</title>
1735 We can create an OID for the Bib-1 attribute set on the ODR stream
1739 yaz_string_to_oid_odr(yaz_oid_std(), CLASS_ATTSET, "Bib-1", odr);
1741 This is more complex than using <function>odr_getoidbystr</function>.
1742 You would only use <function>yaz_string_to_oid_odr</function> when the
1743 string (here Bib-1) is supplied by a user or configuration.
1748 <sect2 id="tools.oid.std"><title>Standard OIDs</title>
1751 All the object identifers in the standard OID database as returned
1752 by <function>yaz_oid_std</function> can referenced directly in a
1753 program as a constant OID.
1754 Each constant OID is prefixed with <literal>yaz_oid_</literal> -
1755 followed by OID class (lowercase) - then by OID name (normalized and
1759 See <xref linkend="list-oids"/> for list of all object identifiers
1761 These are declared in <filename>yaz/oid_std.h</filename> but are
1762 included by <filename>yaz/oid_db.h</filename> as well.
1765 <example id="tools.oid.bib1.5"><title>Use a built-in OID</title>
1767 We can allocate our own OID filled with the constant OID for
1770 Odr_oid *bib1 = odr_oiddup(o, yaz_oid_attset_bib1);
1776 <sect1 id="tools.nmem"><title>Nibble Memory</title>
1779 Sometimes when you need to allocate and construct a large,
1780 interconnected complex of structures, it can be a bit of a pain to
1781 release the associated memory again. For the structures describing the
1782 Z39.50 PDUs and related structures, it is convenient to use the
1783 memory-management system of the &odr; subsystem (see
1784 <xref linkend="odr.use"/>). However, in some circumstances
1785 where you might otherwise benefit from using a simple nibble memory
1786 management system, it may be impractical to use
1787 <function>odr_malloc()</function> and <function>odr_reset()</function>.
1788 For this purpose, the memory manager which also supports the &odr;
1789 streams is made available in the NMEM module. The external interface
1790 to this module is given in the <filename>nmem.h</filename> file.
1794 The following prototypes are given:
1798 NMEM nmem_create(void);
1799 void nmem_destroy(NMEM n);
1800 void *nmem_malloc(NMEM n, size_t size);
1801 void nmem_reset(NMEM n);
1802 size_t nmem_total(NMEM n);
1803 void nmem_init(void);
1804 void nmem_exit(void);
1808 The <function>nmem_create()</function> function returns a pointer to a
1809 memory control handle, which can be released again by
1810 <function>nmem_destroy()</function> when no longer needed.
1811 The function <function>nmem_malloc()</function> allocates a block of
1812 memory of the requested size. A call to <function>nmem_reset()</function>
1813 or <function>nmem_destroy()</function> will release all memory allocated
1814 on the handle since it was created (or since the last call to
1815 <function>nmem_reset()</function>. The function
1816 <function>nmem_total()</function> returns the number of bytes currently
1817 allocated on the handle.
1821 The nibble memory pool is shared amongst threads. POSIX
1822 mutex'es and WIN32 Critical sections are introduced to keep the
1823 module thread safe. Function <function>nmem_init()</function>
1824 initializes the nibble memory library and it is called automatically
1825 the first time the <literal>YAZ.DLL</literal> is loaded. &yaz; uses
1826 function <function>DllMain</function> to achieve this. You should
1827 <emphasis>not</emphasis> call <function>nmem_init</function> or
1828 <function>nmem_exit</function> unless you're absolute sure what
1829 you're doing. Note that in previous &yaz; versions you'd have to call
1830 <function>nmem_init</function> yourself.
1835 <sect1 id="tools.log"><title>Log</title>
1837 &yaz; has evolved a fairly complex log system which should be useful both
1838 for debugging &yaz; itself, debugging applications that use &yaz;, and for
1839 production use of those applications.
1842 The log functions are declared in header <filename>yaz/log.h</filename>
1843 and implemented in <filename>src/log.c</filename>.
1844 Due to name clash with syslog and some math utilities the logging
1845 interface has been modified as of YAZ 2.0.29. The obsolete interface
1846 is still available if in header file <filename>yaz/log.h</filename>.
1847 The key points of the interface are:
1850 void yaz_log(int level, const char *fmt, ...)
1852 void yaz_log_init(int level, const char *prefix, const char *name);
1853 void yaz_log_init_file(const char *fname);
1854 void yaz_log_init_level(int level);
1855 void yaz_log_init_prefix(const char *prefix);
1856 void yaz_log_time_format(const char *fmt);
1857 void yaz_log_init_max_size(int mx);
1859 int yaz_log_mask_str(const char *str);
1860 int yaz_log_module_level(const char *name);
1864 The reason for the whole log module is the <function>yaz_log</function>
1865 function. It takes a bitmask indicating the log levels, a
1866 <literal>printf</literal>-like format string, and a variable number of
1871 The <literal>log level</literal> is a bit mask, that says on which level(s)
1872 the log entry should be made, and optionally set some behaviour of the
1873 logging. In the most simple cases, it can be one of <literal>YLOG_FATAL,
1874 YLOG_DEBUG, YLOG_WARN, YLOG_LOG</literal>. Those can be combined with bits
1875 that modify the way the log entry is written:<literal>YLOG_ERRNO,
1876 YLOG_NOTIME, YLOG_FLUSH</literal>.
1877 Most of the rest of the bits are deprecated, and should not be used. Use
1878 the dynamic log levels instead.
1882 Applications that use &yaz;, should not use the LOG_LOG for ordinary
1883 messages, but should make use of the dynamic loglevel system. This consists
1884 of two parts, defining the loglevel and checking it.
1888 To define the log levels, the (main) program should pass a string to
1889 <function>yaz_log_mask_str</function> to define which log levels are to be
1890 logged. This string should be a comma-separated list of log level names,
1891 and can contain both hard-coded names and dynamic ones. The log level
1892 calculation starts with <literal>YLOG_DEFAULT_LEVEL</literal> and adds a bit
1893 for each word it meets, unless the word starts with a '-', in which case it
1894 clears the bit. If the string <literal>'none'</literal> is found,
1895 all bits are cleared. Typically this string comes from the command-line,
1896 often identified by <literal>-v</literal>. The
1897 <function>yaz_log_mask_str</function> returns a log level that should be
1898 passed to <function>yaz_log_init_level</function> for it to take effect.
1902 Each module should check what log bits it should be used, by calling
1903 <function>yaz_log_module_level</function> with a suitable name for the
1904 module. The name is cleared from a preceding path and an extension, if any,
1905 so it is quite possible to use <literal>__FILE__</literal> for it. If the
1906 name has been passed to <function>yaz_log_mask_str</function>, the routine
1907 returns a non-zero bitmask, which should then be used in consequent calls
1908 to yaz_log. (It can also be tested, so as to avoid unnecessary calls to
1909 yaz_log, in time-critical places, or when the log entry would take time
1914 Yaz uses the following dynamic log levels:
1915 <literal>server, session, request, requestdetail</literal> for the server
1917 <literal>zoom</literal> for the zoom client api.
1918 <literal>ztest</literal> for the simple test server.
1919 <literal>malloc, nmem, odr, eventl</literal> for internal debugging of yaz itself.
1920 Of course, any program using yaz is welcome to define as many new ones, as
1925 By default the log is written to stderr, but this can be changed by a call
1926 to <function>yaz_log_init_file</function> or
1927 <function>yaz_log_init</function>. If the log is directed to a file, the
1928 file size is checked at every write, and if it exceeds the limit given in
1929 <function>yaz_log_init_max_size</function>, the log is rotated. The
1930 rotation keeps one old version (with a <literal>.1</literal> appended to
1931 the name). The size defaults to 1GB. Setting it to zero will disable the
1936 A typical yaz-log looks like this
1937 13:23:14-23/11 yaz-ztest(1) [session] Starting session from tcp:127.0.0.1 (pid=30968)
1938 13:23:14-23/11 yaz-ztest(1) [request] Init from 'YAZ' (81) (ver 2.0.28) OK
1939 13:23:17-23/11 yaz-ztest(1) [request] Search Z: @attrset Bib-1 foo OK:7 hits
1940 13:23:22-23/11 yaz-ztest(1) [request] Present: [1] 2+2 OK 2 records returned
1941 13:24:13-23/11 yaz-ztest(1) [request] Close OK
1945 The log entries start with a time stamp. This can be omitted by setting the
1946 <literal>YLOG_NOTIME</literal> bit in the loglevel. This way automatic tests
1947 can be hoped to produce identical log files, that are easy to diff. The
1948 format of the time stamp can be set with
1949 <function>yaz_log_time_format</function>, which takes a format string just
1950 like <function>strftime</function>.
1954 Next in a log line comes the prefix, often the name of the program. For
1955 yaz-based servers, it can also contain the session number. Then
1956 comes one or more logbits in square brackets, depending on the logging
1957 level set by <function>yaz_log_init_level</function> and the loglevel
1958 passed to <function>yaz_log_init_level</function>. Finally comes the format
1959 string and additional values passed to <function>yaz_log</function>
1963 The log level <literal>YLOG_LOGLVL</literal>, enabled by the string
1964 <literal>loglevel</literal>, will log all the log-level affecting
1965 operations. This can come in handy if you need to know what other log
1966 levels would be useful. Grep the logfile for <literal>[loglevel]</literal>.
1970 The log system is almost independent of the rest of &yaz;, the only
1971 important dependence is of <filename>nmem</filename>, and that only for
1972 using the semaphore definition there.
1976 The dynamic log levels and log rotation were introduced in &yaz; 2.0.28. At
1977 the same time, the log bit names were changed from
1978 <literal>LOG_something</literal> to <literal>YLOG_something</literal>,
1979 to avoid collision with <filename>syslog.h</filename>.
1984 <sect1 id="marc"><title>MARC</title>
1987 YAZ provides a fast utility for working with MARC records.
1988 Early versions of the MARC utility only allowed decoding of ISO2709.
1989 Today the utility may both encode - and decode to a varity of formats.
1992 #include <yaz/marcdisp.h>
1994 /* create handler */
1995 yaz_marc_t yaz_marc_create(void);
1997 void yaz_marc_destroy(yaz_marc_t mt);
1999 /* set XML mode YAZ_MARC_LINE, YAZ_MARC_SIMPLEXML, ... */
2000 void yaz_marc_xml(yaz_marc_t mt, int xmlmode);
2001 #define YAZ_MARC_LINE 0
2002 #define YAZ_MARC_SIMPLEXML 1
2003 #define YAZ_MARC_OAIMARC 2
2004 #define YAZ_MARC_MARCXML 3
2005 #define YAZ_MARC_ISO2709 4
2006 #define YAZ_MARC_XCHANGE 5
2007 #define YAZ_MARC_CHECK 6
2008 #define YAZ_MARC_TURBOMARC 7
2010 /* supply iconv handle for character set conversion .. */
2011 void yaz_marc_iconv(yaz_marc_t mt, yaz_iconv_t cd);
2013 /* set debug level, 0=none, 1=more, 2=even more, .. */
2014 void yaz_marc_debug(yaz_marc_t mt, int level);
2016 /* decode MARC in buf of size bsize. Returns >0 on success; <=0 on failure.
2017 On success, result in *result with size *rsize. */
2018 int yaz_marc_decode_buf(yaz_marc_t mt, const char *buf, int bsize,
2019 const char **result, size_t *rsize);
2021 /* decode MARC in buf of size bsize. Returns >0 on success; <=0 on failure.
2022 On success, result in WRBUF */
2023 int yaz_marc_decode_wrbuf(yaz_marc_t mt, const char *buf,
2024 int bsize, WRBUF wrbuf);
2029 The synopsis is just a basic subset of all functionality. Refer
2030 to the actual header file <filename>marcdisp.h</filename> for
2035 A MARC conversion handle must be created by using
2036 <function>yaz_marc_create</function> and destroyed
2037 by calling <function>yaz_marc_destroy</function>.
2040 All other function operate on a <literal>yaz_marc_t</literal> handle.
2041 The output is specified by a call to <function>yaz_marc_xml</function>.
2042 The <literal>xmlmode</literal> must be one of
2045 <term>YAZ_MARC_LINE</term>
2048 A simple line-by-line format suitable for display but not
2049 recommend for further (machine) processing.
2055 <term>YAZ_MARC_MARCXML</term>
2058 <ulink url="&url.marcxml;">MARCXML</ulink>.
2064 <term>YAZ_MARC_ISO2709</term>
2067 ISO2709 (sometimes just referred to as "MARC").
2073 <term>YAZ_MARC_XCHANGE</term>
2076 <ulink url="&url.marcxchange;">MarcXchange</ulink>.
2082 <term>YAZ_MARC_CHECK</term>
2085 Pseudo format for validation only. Does not generate
2086 any real output except diagnostics.
2092 <term>YAZ_MARC_TURBOMARC</term>
2095 XML format with same semantics as MARCXML but more compact
2096 and geared towards fast processing with XSLT. Refer to
2097 <xref linkend="tools.turbomarc"/> for more information.
2105 The actual conversion functions are
2106 <function>yaz_marc_decode_buf</function> and
2107 <function>yaz_marc_decode_wrbuf</function> which decodes and encodes
2108 a MARC record. The former function operates on simple buffers, the
2109 stores the resulting record in a WRBUF handle (WRBUF is a simple string
2112 <example id="example.marc.display">
2113 <title>Display of MARC record</title>
2115 The following program snippet illustrates how the MARC API may
2116 be used to convert a MARC record to the line-by-line format:
2117 <programlisting><![CDATA[
2118 void print_marc(const char *marc_buf, int marc_buf_size)
2120 char *result; /* for result buf */
2121 size_t result_len; /* for size of result */
2122 yaz_marc_t mt = yaz_marc_create();
2123 yaz_marc_xml(mt, YAZ_MARC_LINE);
2124 yaz_marc_decode_buf(mt, marc_buf, marc_buf_size,
2125 &result, &result_len);
2126 fwrite(result, result_len, 1, stdout);
2127 yaz_marc_destroy(mt); /* note that result is now freed... */
2133 <sect2 id="tools.turbomarc">
2134 <title>TurboMARC</title>
2136 TurboMARC is yet another XML encoding of a MARC record. The format
2137 was designed for fast processing with XSLT.
2141 Pazpar2 uses XSLT to convert an XML encoded MARC record to an internal
2142 representation. This conversion mostly check the tag of a MARC field
2143 to determine the basic rules in the conversion. This check is
2144 costly when that is tag is encoded as an attribute in MARCXML.
2145 By having the tag value as the element instead, makes processing
2146 many times faster (at least for Libxslt).
2149 TurboMARC is encoded as follows:
2152 Record elements is part of namespace
2153 "<literal>http://www.indexdata.com/turbomarc</literal>".
2156 A record is enclosed in element <literal>r</literal>.
2159 A collection of records is enclosed in element
2160 <literal>collection</literal>.
2163 The leader is encoded as element <literal>l</literal> with the
2164 leader content as its (text) value.
2167 A control field is encoded as element <literal>c</literal> concatenated
2168 with the tag value of the control field if the tag value
2169 matches the regular expression <literal>[a-zA-Z0-9]*</literal>.
2170 If the tag value do not match the regular expression
2171 <literal>[a-zA-Z0-9]*</literal> the control field is encoded
2172 as element <literal>c</literal> and attribute <literal>code</literal>
2173 will hold the tag value.
2174 This rule ensure that in the rare cases where a tag value might
2175 result in a non-wellformed XML YAZ encode it as a coded attribute
2179 The control field content is the the text value of this element.
2180 Indicators are encoded as attribute names
2181 <literal>i1</literal>, <literal>i2</literal>, etc.. and
2182 corresponding values for each indicator.
2185 A data field is encoded as element <literal>d</literal> concatenated
2186 with the tag value of the data field or using the attribute
2187 <literal>code</literal> as described in the rules for control fields.
2188 The children of the data field element is subfield elements.
2189 Each subfield element is encoded as <literal>s</literal>
2190 concatenated with the sub field code.
2191 The text of the subfield element is the contents of the subfield.
2192 Indicators are encoded as attributes for the data field element similar
2193 to the encoding for control fields.
2200 <sect1 id="tools.retrieval">
2201 <title>Retrieval Facility</title>
2203 YAZ version 2.1.20 or later includes a Retrieval facility tool
2204 which allows a SRU/Z39.50 to describe itself and perform record
2205 conversions. The idea is the following:
2210 An SRU/Z39.50 client sends a retrieval request which includes
2211 a combination of the following parameters: syntax (format),
2212 schema (or element set name).
2218 The retrieval facility is invoked with parameters in a
2219 server/proxy. The retrieval facility matches the parameters a set of
2220 "supported" retrieval types.
2221 If there is no match, the retrieval signals an error
2222 (syntax and / or schema not supported).
2228 For a successful match, the backend is invoked with the same
2229 or altered retrieval parameters (syntax, schema). If
2230 a record is received from the backend, it is converted to the
2231 frontend name / syntax.
2237 The resulting record is sent back the client and tagged with
2238 the frontend syntax / schema.
2245 The Retrieval facility is driven by an XML configuration. The
2246 configuration is neither Z39.50 ZeeRex or SRU ZeeRex. But it
2247 should be easy to generate both of them from the XML configuration.
2248 (unfortunately the two versions
2249 of ZeeRex differ substantially in this regard).
2251 <sect2 id="tools.retrieval.format">
2252 <title>Retrieval XML format</title>
2254 All elements should be covered by namespace
2255 <literal>http://indexdata.com/yaz</literal> .
2256 The root element node must be <literal>retrievalinfo</literal>.
2259 The <literal>retrievalinfo</literal> must include one or
2260 more <literal>retrieval</literal> elements. Each
2261 <literal>retrieval</literal> defines specific combination of
2262 syntax, name and identifier supported by this retrieval service.
2265 The <literal>retrieval</literal> element may include any of the
2266 following attributes:
2268 <varlistentry><term><literal>syntax</literal> (REQUIRED)</term>
2271 Defines the record syntax. Possible values is any
2272 of the names defined in YAZ' OID database or a raw
2277 <varlistentry><term><literal>name</literal> (OPTIONAL)</term>
2280 Defines the name of the retrieval format. This can be
2281 any string. For SRU, the value, is equivalent to schema (short-hand);
2282 for Z39.50 it's equivalent to simple element set name.
2283 For YAZ 3.0.24 and later this name may be specified as a glob
2284 expression with operators
2285 <literal>*</literal> and <literal>?</literal>.
2289 <varlistentry><term><literal>identifier</literal> (OPTIONAL)</term>
2292 Defines the URI schema name of the retrieval format. This can be
2293 any string. For SRU, the value, is equivalent to URI schema.
2294 For Z39.50, there is no equivalent.
2301 The <literal>retrieval</literal> may include one
2302 <literal>backend</literal> element. If a <literal>backend</literal>
2303 element is given, it specifies how the records are retrieved by
2304 some backend and how the records are converted from the backend to
2308 The attributes, <literal>name</literal> and <literal>syntax</literal>
2309 may be specified for the <literal>backend</literal> element. These
2310 semantics of these attributes is equivalent to those for the
2311 <literal>retrieval</literal>. However, these values are passed to
2315 The <literal>backend</literal> element may includes one or more
2316 conversion instructions (as children elements). The supported
2319 <varlistentry><term><literal>marc</literal></term>
2322 The <literal>marc</literal> element specifies a conversion
2323 to - and from ISO2709 encoded MARC and
2324 <ulink url="&url.marcxml;">&acro.marcxml;</ulink>/MarcXchange.
2325 The following attributes may be specified:
2328 <varlistentry><term><literal>inputformat</literal> (REQUIRED)</term>
2331 Format of input. Supported values are
2332 <literal>marc</literal> (for ISO2709); and <literal>xml</literal>
2333 for MARCXML/MarcXchange.
2338 <varlistentry><term><literal>outputformat</literal> (REQUIRED)</term>
2341 Format of output. Supported values are
2342 <literal>line</literal> (MARC line format);
2343 <literal>marcxml</literal> (for MARCXML),
2344 <literal>marc</literal> (ISO2709),
2345 <literal>marcxhcange</literal> (for MarcXchange).
2350 <varlistentry><term><literal>inputcharset</literal> (OPTIONAL)</term>
2353 Encoding of input. For XML input formats, this need not
2354 be given, but for ISO2709 based inputformats, this should
2355 be set to the encoding used. For MARC21 records, a common
2356 inputcharset value would be <literal>marc-8</literal>.
2361 <varlistentry><term><literal>outputcharset</literal> (OPTIONAL)</term>
2364 Encoding of output. If outputformat is XML based, it is
2365 strongly recommened to use <literal>utf-8</literal>.
2374 <varlistentry><term><literal>xslt</literal></term>
2377 The <literal>xslt</literal> element specifies a conversion
2378 via &acro.xslt;. The following attributes may be specified:
2381 <varlistentry><term><literal>stylesheet</literal> (REQUIRED)</term>
2396 <sect2 id="tools.retrieval.examples">
2397 <title>Retrieval Facility Examples</title>
2398 <example id="tools.retrieval.marc21">
2399 <title>MARC21 backend</title>
2401 A typical way to use the retrieval facility is to enable XML
2402 for servers that only supports ISO2709 encoded MARC21 records.
2404 <programlisting><![CDATA[
2406 <retrieval syntax="usmarc" name="F"/>
2407 <retrieval syntax="usmarc" name="B"/>
2408 <retrieval syntax="xml" name="marcxml"
2409 identifier="info:srw/schema/1/marcxml-v1.1">
2410 <backend syntax="usmarc" name="F">
2411 <marc inputformat="marc" outputformat="marcxml"
2412 inputcharset="marc-8"/>
2415 <retrieval syntax="xml" name="dc">
2416 <backend syntax="usmarc" name="F">
2417 <marc inputformat="marc" outputformat="marcxml"
2418 inputcharset="marc-8"/>
2419 <xslt stylesheet="MARC21slim2DC.xsl"/>
2426 This means that our frontend supports:
2430 MARC21 F(ull) records.
2435 MARC21 B(rief) records.
2447 Dublin core records.
2454 <example id="tools.retrieval.marcxml">
2455 <title>MARCXML backend</title>
2457 SRW/SRU and Solr backends returns records in XML.
2458 If they return MARCXML or MarcXchange, the retrieval module
2459 can convert those into ISO2709 formats, most commonly USMARC
2461 In this example, the backend returns MARCXML for schema="marcxml".
2463 <programlisting><![CDATA[
2465 <retrieval syntax="usmarc">
2466 <backend syntax="xml" name="marcxml">
2467 <marc inputformat="xml" outputformat="marc"
2468 outputcharset="marc-8"/>
2471 <retrieval syntax="xml" name="marcxml"
2472 identifier="info:srw/schema/1/marcxml-v1.1"/>
2473 <retrieval syntax="xml" name="dc">
2474 <backend syntax="xml" name="marcxml">
2475 <xslt stylesheet="MARC21slim2DC.xsl"/>
2482 This means that our frontend supports:
2486 MARC21 records (any element set name) in MARC-8 encoding.
2491 MARCXML records for element-set=marcxml
2496 Dublin core records for element-set=dc.
2504 <sect2 id="tools.retrieval.api">
2507 It should be easy to use the retrieval systems from applications. Refer
2509 <filename>yaz/retrieval.h</filename> and
2510 <filename>yaz/record_conv.h</filename>.
2514 <sect1><title>Sorting</title>
2516 This chapter describes sorting and how it is supported in YAZ.
2517 Sorting applies to a result-set.
2518 The <ulink url="http://www.loc.gov/z3950/agency/markup/05.html#3.2.7">
2519 Z39.50 sorting facility
2521 takes one or more input result-sets
2522 and one result-set as output. The most simple case is that
2523 the input-set is the same as the output-set.
2526 Z39.50 sorting has a separate APDU (service) that is, thus, performed
2527 following a search (two phases).
2530 In SRU/Solr, however, the model is different. Here, sorting is specified
2531 during the the search operation. Note, however, that SRU might
2532 perform sort as separate search, by referring to an existing result-set
2533 in the query (result-set reference).
2535 <sect2><title>Using the Z39.50 sort service</title>
2537 yaz-client and the ZOOM API supports the Z39.50 sort facility. In any
2538 case the sort sequence or sort critiera is using a string notation.
2539 This notation is a one-line notation suitable for being manually
2540 entered or generated and allows for easy logging (one liner).
2541 For the ZOOM API, the sort is specified in the call to ZOOM_query_sortby
2542 function. For yaz-client the sort is performed and specified using
2543 the sort and sort+ commands. For description of the sort criteria notation
2544 refer to the <link linkend="sortspec">sort command</link> in the
2548 The ZOOM API might choose one of several sort strategies for
2549 sorting. Refer to <xref linkend="zoom-sort-strategy"/>.
2552 <sect2><title>Type-7 sort</title>
2554 Type-7 sort is an extension to the Bib-1 based RPN query where the
2555 sort specification is embedded as an Attribute-Plus-Term.
2558 The objectives for introducing Type-7 sorting is that it allows
2559 a client to perform sorting even if it does not implement/support
2560 Z39.50 sort. Virtually all Z39.50 client software supports
2561 RPN queries. It also may improve performance because the sort
2562 critieria is specified along with the search query.
2565 The sort is triggered by the presence of type 7 and the value of type 7
2567 <ulink url="http://www.loc.gov/z3950/agency/asn1.html#SortKeySpec">
2570 The value for type 7 is 1 for ascending and 2 for descending.
2572 <ulink url="http://www.loc.gov/z3950/agency/asn1.html#SortElement">
2575 only the generic part is handled. If generic sortKey is of type
2576 sortField, then attribute type 1 is present and the value is
2577 sortField (InternationalString). If generic sortKey is of type
2578 sortAttributes, then the attributes in list is used . generic sortKey
2579 of type elementSpec is not supported.
2582 The term in the sorting Attribute-Plus-Term combo should hold
2583 an integer. The value is 0 for primary sorting criteria, 1 for second
2590 <!-- Keep this comment at the end of the file
2595 sgml-minimize-attributes:nil
2596 sgml-always-quote-attributes:t
2599 sgml-parent-document: "yaz.xml"
2600 sgml-local-catalogs: nil
2601 sgml-namecase-general:t