[
https://issues.apache.org/jira/browse/JAMES-3067?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17038872#comment-17038872
]
Matthieu Baechler commented on JAMES-3067:
------------------------------------------
What kind of projection would you want to build?
What about having a graph, in memory, to solve that problem?
The dataset is supposed to be tiny (is it?) and I guess having a graph allows
querying for aliases in a straightforward way
> 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
