[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Question on LCUP
I have a question on LCUP scalability.
Shall the LCUP be scalable on number of persistent search requests ?
I suppose the main use of LCUP is the following:
The client caches a well defined subset ( like one
subtree ) of the directory.
Then there is propably only one or some Persistent Searches
per client ?
But suppose the client keeps a more dynamic cache in the sense
that when the client "gets interested" in a certain entry,
the client allways makes a Persistent Search ?
Shall the LCUP scale for such situations ? The implementation
of LCUP can then not be:
Whenever an entry is modified go through all the Searches
At least an index is needed to find the relevant Searches.
Is the scalability a standardisation issue at all ?