RE: Issue Query Key binding

I believe exact match is the best option, and the text below seems fine.
If the requestor wants a 'loose' match, so they can sort through all the
responses looking for ones that are interesting, they should send an
ambiguous query - such only a key value.
 
I would be concerned about 'best guess' or a 'service defined matching
criteria' as it makes it pretty hard for clients to know what to expect
back from any given query. 
 
I agree, we should not have a match flag.
 
Blair


________________________________

From: Hallam-Baker, Phillip [mailto:pbaker@verisign.com] 
Sent: Thursday, February 13, 2003 5:41 PM
To: Www-Xkms (E-mail)


 
I  am attempting to deal with the matching rules. What should we
specify, exact match, best guess? Should the result match all the terms
or match any of the terms?
 
In the past we discussed a match flag, is this really necessary? I hope
not. 



Do we need to do more than this?





Element <QueryKeyBinding>


The <QueryKeyBinding> element is derived from the KeyBindingAbstractType
and is used to perform a query that results in the return of one or more
matching key bindings.

A key binding matches the QueryKeyBinding if:

*	The key binding contains all the <UseKeyWith> elements contained
in the query, and 
*	The key binding contains all the <KeyInfo> elements contained in
the query

The <QueryKeyBinding> element extends the KeyBindingAbstractType with
the following additional elements:

		<TimeInstant> [Optional] 
		The Time Instant for which the query is made. If no time
instant is specified the default is the time the request was made.

The following schema defines the <QueryKeyBinding> element and
KeyBindingType: