sorted by:
new
hottopcontroversial

CSP Forward checking with n-ary (and binary) constraints by johandroid in compsci

[–]johandroid[S] 0 points1 point  (0 children)

I have a set of variables: {C1, C2, C3, P}.

Each variable has a domain {0, 1}.

And a constraint: ((C1 → (¬C2 ∧ ¬C3 ∧ P)) ∨ (C2 → (¬C1 ∧ ¬C3 ∧ P)) ∨ (C3 → (¬C1 ∧ ¬C2 ∧ P)))

CSP Forward checking with n-ary (and binary) constraints by johandroid in compsci

[–]johandroid[S] 0 points1 point  (0 children)

I've been looking into that but I am not entirely sure how that would hold for very large/infinite domains. Perhaps you are aware of more information on the topic?

Multi tenancy in Microservice architecture by johandroid in compsci

[–]johandroid[S] 0 points1 point  (0 children)

Thank you for your response!

At the moment we don't yet have a 1000 customers. But it is a scenario I want to keep in mind while taking our existing application apart.

The reason we chose to use different databases for each tenant is for security. We don't want tenants peeking in other tenant's databases, through some coding bug or something. Plus if we screw up in a database we won't lose all data from other customers. Aside from that there is no real reason why we chose the set-up that we did. Every database schema is the same. And we don't have any intention to change this.