|
The parent perms resultset
would be nice, but in my case I have, due to the nature of the many to many
relationships, the chance objects have different parents. In this case an
object would inherit from two parents. I’ve had some contact with a development
team which created a document management system, and they did the following.
They created a permission object. This object encapsulates, groups, users and
permissions and all these objects are cached. Once you put permissions, groups and users
on a page such a permission object would be created. Due to the cached nature
of the permission object comparisons between objects and permissions objects
were done with great speed. Micha Schopman Modern Media, Databankweg 12 M, 3821
AL Amersfoort ----------------------------------------------------------------------------------------------------------------------------------------------------- Modern Media, Making You Interact Smarter. Onze oplossingen
verbeteren de interactie met uw doelgroep. -----Original Message----- Thought
of one more option. You
could return two resultsets, one is your normal one and the other is a 'parent perms'
resultset, where it contains only the identifier and permissions for each
parent level item. Then when you're ouputting the tree nodes, if a child
does not contain its own permissions, then you can simply query of query the
second resultset for its parent permissions. Pretty low overhead. Kevin
|
Title: Message
- RE: [CFCDev] Speeding up lookups in a chain Micha Schopman
- Re: [CFCDev] Speeding up lookups in a chain Barney Boisvert
- [CFCDev] OT: Laszlo Brent Nicholas
- Re: [CFCDev] OT: Laszlo Scott Stroz
- Re: [CFCDev] OT: Laszlo Adam Haskell
