Evaluable criteria

[Cantor, Scott]

On 6/2/15, 4:19 PM, "dev on behalf of Brent Putman" <dev-bounces at shibboleth.net on behalf of putmanb at georgetown.edu> wrote:

>For those we need (in batch) secondary indexes.  That's going to be a bit of conceptual work.  I'm not even actually sure how to support non-equality-based index lookups.  It's sort of analagous I guess to whatever RDBMS's do to efficiently support substring matching on indexed columns on e.g. a "where name like '%Joe%'. Or what search software like Lucene does to support full text searching.  I get the sense that there's a whole bunch of computer science in there that I don't know.  Hopefully there are some libraries to help us out... (maybe even Lucene?).

True sub-matching would be complex, but for something URL-based (and I don't recall exactly what Marvin and Walter settled on as a proposal), the way I usually do it brute force is by path segmentation, and indexing each partial URL.

e.g. https://foo.com/path/to/endpoint

	-> https://foo.com
	-> https://foo.com/path
	-> https://foo.com/path/to
	-> https://foo.com/path/to/endpoint

Another way is to build trees out of the URLs so you walk into the tree as you go looking for matches.

This assumes the matching isn't partial-path obviously, though a tree approach can give you some ways of attaching that too.

None of this is stellar efficiency, but it works for current order of magnitude stuff probably.

It isn't as though this is likely to be used much in large batches, it's not something you do with federations, more of a local thing for some specific metadata sources that probably have a handful of entity descriptors for different URL patterns.

SAML artifact of course is much simpler since it's just SourceIDs or whole endpoints.

-- Scott