[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Are we losing out because of grammars? (Re: Schemaambiguitydetection algorithm for RELAX (1/4))
- From: "Thomas B. Passin" <email@example.com>
- To: "Bullard, Claude L (Len)" <firstname.lastname@example.org>,Rick Jelliffe <email@example.com>, firstname.lastname@example.org
- Date: Mon, 29 Jan 2001 21:38:57 -0500
Len Bullard wrote -
> Precisely. What that says to me is that
> we have to know the bounds of the system
> to determine the requirements for the
> means of valdiation, which is why I suggest a
> broadcast model at the high end.
This thought experiment might highlight what's needed in these cases Len keeps
talking about. Imagine that there is a Linda-like system, and its tuple space
is relatively public, or at least shared by Len's agencies. One agency puts
out a tuple with slots that are query templates asking to be filled.
Later, the agency retrieves the tuple and pulls out the field values. How can
it have some confidence that those field values are what it asked for? Or, to
bring the question closer to this thread, what has to be included with the
query so that another system can undertand what is being asked for and
evaluate whether it should respond?
Remember, in this Linda-like system, a responding agency only knows the
contents of the field in the tuple. Nothing more, unless the whole system is
set up with some ground rules.