Lines Matching refs:bf
82 enhance the access performance. Therefore there is the deductive {\bf KB} version
84 {\bf DB} version.
109 A database is created with the predicate {\bf createdb/1}. \index{createdb/1}
130 predicate {\bf opendb/1} \index{opendb/1} can be used.
138 {\bf closedb/0} \index{closedb/0} predicate is used.
145 {\bf $<=>$/2} predicate. \index{$<=>$/2}
179 The first argument of the {\bf \verb-<=>-} predicate is the name of the
185 In the permanent case the {\bf Relation\_Name} is an atom that
188 for {\bf Relation\_Name}, and this will be instantiated by the system
210 \item{{\bf Type}}
213 {\bf integer}, {\bf real} , {\bf atom}, and {\bf term}. Floating point numbers
219 \item{{\bf Name}}
227 \item{{\bf Length}}
239 \item{{\bf Index}}
246 ({\bf BANG} -- Balanced And Nested Grid file), which
251 The index field is {\bf +} to indicate preference in participation
252 in index and {\bf --} otherwise. Attributes of type term cannot be included
265 The default setting for index is {\bf --}, e.g.
284 {\bf \verb-<=>-} to find its schema.
304 where {\bf Relation\_Name} and {\bf Synonym} are atoms.
310 {\bf son} becoming a synonym for {\bf boy}.
329 the {\bf \verb-<=>/2-} predicate. The call
338 {\bf helpdb/0} lists the names of all the relations in the database;
339 {\bf helprel/1} gives information about a single relation.
361 relation along with the above information the {\bf printrel/1}
397 Just as a predicate {\bf is/2} is provided to allow the writing of arithmetic
398 expressions in Prolog, the predicate {\bf isr/2} \index{isr/2}
403 A call to the {\bf isr} predicate has the form
408 This creates a temporary relation and uses the {\bf Relational\_Expression}
410 If {\bf Relation\_Name} is an atom the relation takes it for its name,
414 {\bf Relational\_Expression} are added to it.
415 The {\bf Relational\_Expression} consists of relations, relational operators,
449 used in an {\bf isr} relational expression to perform selection
450 on a relation. This condition is introduced by the word {\bf where}.
469 by using the connective {\bf and}. Further examples
483 the example above, {\bf \verb-f_depts-} is created from all tuples of
484 {\bf department} whose manager attribute is a string beginning
533 An optional {\bf where} condition is given to indicate the condition on which
538 where {\bf JoinRel1} and {\bf JoinRel2} are relations
539 which are joined according to {\bf Condition}
540 to produce the relation {\bf ResultRel}. Some examples of
567 An optional {\bf where} condition is given to indicate the condition on which
593 An optional {\bf where} condition is given to indicate the condition on which
599 Note that argument names appearing in {\bf Condition} are used to select
600 in {\em both} {\bf UnionRel1} and {\bf UnionRel2}, therefore the
601 {\bf Condition} can only refer to attributes of both relations.
603 of {\bf isr} and {\bf \verb-<++-} achieves the same effect.
613 of the relations on the right hand side of the {\bf isr}
615 these attributes. The projection operator {\bf \verb-:^:-} acts as a filter
616 on the relation created by the selections, joins etc. in an {\bf isr}
624 First a relation is constructed from the {\bf Relational\_Expression} as
629 {\bf Projection\_List}.
636 This creates the relation {\bf man\_grade1/2}, with a schema that satisfies
642 The {\bf \verb-^-} notation may also be used in a projection list if there
665 {\bf isr/2} predicate.
683 The syntax of {\bf Relational_Expression} is described above, the
684 {\bf Projection_List} is optional. For example
691 inside a {\bf findall/3} operator as in the next example.
719 the right hand side of {\bf isr/2}.
744 will delete all tuples from {\bf r} which are in {\bf r}, leaving the
817 The predicates {\bf ins\_tup/1} and {\bf ins\_tup/2} insert single
840 as the satisfaction of a goal. The predicate {\bf retr\_\/tup/2}
872 The predicate {\bf retr\_\/tup} is resatisfiable. Successive calls
873 to {\bf retr\_\/tup} through backtracking will retrieve successive tuples
887 A variant is {\bf retr\_tup/1}. This views the tuples of the relation as
901 A third variant {\bf retr\_tup/3} allows the inclusion
908 is valid in an {\bf isr} clause behind the {\bf where}.
911 to {\bf retr\_tup/3} or as instantiation of the second argument.
941 {\bf tmp} and {\bf result}. If these relations are very big, a
953 Then a tuple can be retrieved from the relation {\bf p/2} with the
954 following form of goal instead of having to use the {\bf retr\_tup/1}
967 The predicates {\bf del\_tup/1} and {\bf del\_tup/2} delete single
979 There exists also a predicates {\bf del\_tup/3}, which is like
980 {\bf del\_tup/2} but takes a condition as third argument.