X-Git-Url: http://git.indexdata.com/?a=blobdiff_plain;f=doc%2Fexamples.xml;h=298df4bc3fbdd20c0b8afff538294c6f93df924b;hb=c33ea56e3771c3b80ba66ef8fda3a09cad171ebb;hp=f8f9a203ef119a85280f242d1e5672faf4993635;hpb=e809d64f640790b2695a659bd2eb0ebd4e3cf963;p=idzebra-moved-to-github.git diff --git a/doc/examples.xml b/doc/examples.xml index f8f9a20..298df4b 100644 --- a/doc/examples.xml +++ b/doc/examples.xml @@ -1,8 +1,8 @@ - + Example Configurations - + Overview @@ -175,7 +175,7 @@ significantly because it ties searching semantics to the physical structure of the searched records. You can't use the same search specification to search two databases if their internal - representations are different. Consider an different taxonomy + representations are different. Consider a different taxonomy database in which the records have taxon names specified inside a <name> element nested within a <identification> element @@ -192,8 +192,8 @@ said about implementation: in a given database, an access point might be implemented as an index, a path into physical records, an algorithm for interrogating relational tables or whatever works. - The only important thing point is that the semantics of an access - point are fixed and well defined. + The only important thing is that the semantics of an access + point is fixed and well defined. For convenience, access points are gathered into attribute