I’m glad that it worked!
Thanks for the feedback. I was only able to test it across a small subset of machines in a much smaller BigFix instance, so I really didn’t know for sure how fast it would work.
It is really a challenge when trying to write nested relevance like this. You often have to start on a smaller/test instance just to get something working, and then optimize it. You then need to test the optimized relevance on a larger instance to see what impact you are making with the optimizations because you can’t always tell in a BigFix instance with very few clients.
The real trick to this is that recursive relevance or multiple nested relevance can be very expensive. Using tuples can be more efficient and avoid some of the repetition of relevance, but the actual process of building the tuple and having very large tuples can also be expensive, even though @gearoid 's and my tuples contain effectively the same data, the number of actual entries in the tuple matters.
Can you try this for me:
(name of it, id of it) of items 0 of (bes computers, it) whose(name of item 0 of it is contained by item 1 of it) of ( set of unique values whose (multiplicity of it > 1) of names of bes computers )
This should either be exactly equivalent to my relevance above, or it should be slower, and I’m not actually sure which. It could also be slightly faster, but I’m doubtful of that. It would help me to know which is more efficient to know the best option.