Skip to content

Search with Permissions using Local Index #224

Answered by jon-whit
velmohan asked this question in Q&A
Discussion options

You must be logged in to vote

@velmohan you are correct. However, your described approach assumes that you index a single row per combination (x, y, z). This is an approach, but depending on the kinds of resource ids in the system you may be able to optimize using bitmaps. An alternative could be to store a single bitmap index per user. Since an index is typically serving queries for the end user (e.g. show me all of the objects that a specific user has access to), then it makes sense to index a bitmap representing the effective access a user has for a particular relationship.

For example, let's assume we have a len(objects)=3, len(users) =2, len(relations)=2, then the index would be of size len(users) * len(relations…

Replies: 1 comment 1 reply

Comment options

You must be logged in to vote
1 reply
@velmohan
Comment options

Answer selected by velmohan
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants