[
https://issues.apache.org/jira/browse/SLING-4216?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14238020#comment-14238020
]
Carsten Ziegeler commented on SLING-4216:
-----------------------------------------
Ok, I see - I agree that a bloom filter looks like a good solution to decide
whether to "search" if a value is not in the in-memory cache. The question is
really what is the fastest way to get to the final answer. If an Oak search is
fast enough, it sounds like the easiest way. If not, we have to come up with a
different solution; I want to avoid that the number of queries is making the
system unresponsive if the cache hit rate is low. If we would know that a LRU
cache helps in getting a high hit rate, we could neglect this problem, but I
think we can't tell this in generell.
What data structure are we actually dealing with (what's the input/output)?
> Limit the number of vanityPath MapEntry
> ----------------------------------------
>
> Key: SLING-4216
> URL: https://issues.apache.org/jira/browse/SLING-4216
> Project: Sling
> Issue Type: Improvement
> Components: ResourceResolver
> Reporter: Antonio Sanso
> Assignee: Antonio Sanso
>
> At the moment there isn't any limit to the number of MapEntry that are cached
> in memory.
> If the number of vanityPaths/alias is extremely high this can cause OOM.
> It would be good to have a way to limit the amount of memory used by the
> MapEntry cache.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
