[
https://issues.apache.org/jira/browse/JAMES-3067?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17038883#comment-17038883
]
Benoit Tellier commented on JAMES-3067:
---------------------------------------
> All the question is here. From the examples I know there are more aliases
> than users. So can we consider this a tiny dataset?
I'm expecting aliases of aliases to be rare.
Actualy, if you ingore domain mappings the complexity is O(A) where A is the
number of alias.
Why? Without a loop you will perform one additional read per alias (to check if
it has itself an alias).
Then if you have a loop you wil perform maximum STEP\*A lookups which is
bounded and proportional to A.
Then the complexity of domain mappings (D), I have to check D times each alias.
Brings a complexity of *O(A\*D)*.
Nothing to be affraid of as far as I know.
> Allowed From headers recursion
> ------------------------------
>
> Key: JAMES-3067
> URL: https://issues.apache.org/jira/browse/JAMES-3067
> Project: James Server
> Issue Type: Improvement
> Components: JMAP, SMTPServer
> Affects Versions: 3.5.0
> Reporter: Gautier DI FOLCO
> Assignee: Antoine Duprat
> Priority: Minor
>
> In order to go further than the JAMES-3032 we need to go a recursion-level
> further.
> They are two propositions now:
> * Have a parameterized number of recursions, doing multiple queries on the
> current scheme
> * Have a specific projection maintaining all the connected aliases
> We should discuss it
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
---------------------------------------------------------------------
To unsubscribe, e-mail: server-dev-unsubscr...@james.apache.org
For additional commands, e-mail: server-dev-h...@james.apache.org
