Re: PatternConflict exception

[blakley@us.ibm.com]

Bob,

You're making me worry :-)

What issues do you think will arise?

My mental model of a naive implementation is:

     Find all matching patterns (you'd have to do this anyway)
     Concatenate lists for each evaluator
     Eliminate duplicates.

Only the last step seems to have any interesting performance implications,
and I there's clearly
a log(n) algorithm for it (where n is the total number of evaluators in the
concatenated list).

I think it's also not a common case that a name will match multiple
patterns



--bob

Bob Blakley
IBM Lead Security Architect
Voice: +1 (512) 838-8133
Fax:    +1 (512) 838-0156
Post:    11400 Burnet Road, Mail Stop 9134, Austin, TX 78758 USA
Internet: blakley@us.ibm.com



Bob Burt <bburt@2ab.com> on 02/25/99 02:58:54 PM

To:   Bob Blakley/Austin/IBM, Konstantin Beznosov
      <beznosov@baptisthealth.net>
cc:   hrac-rfp@cs.fiu.edu
Subject:  Re: PatternConflict exception





Bob,

I assume that you have evaluated the runtime performance costs that might
be associated with the implementation technique described below.

Bob B.

At 11:31 AM 2/25/99 -0600, blakley@us.ibm.com wrote:
>
>
>Konstantin's view is correct.  I've provided Carol with text which says
>that the list of evaluators returned
>when more than one pattern matches the name provided via input argument is
>the union of the evaluators
>on the lists of all the matched patterns.
>


----------------
Broadcast message to hrac-rfp from Bob Burt <bburt@2ab.com>.
Go to http://cadse.cs.fiu.edu/omg/hrac-rfp to browse the mail list archive.



----------------
Broadcast message to hrac-rfp from blakley@us.ibm.com.
Go to http://cadse.cs.fiu.edu/omg/hrac-rfp to browse the mail list archive.