On which database platform is it better to implement the search for the intersection of subsets (an example is given in the text)?

Question

Database

The problem is this:
- Users have a field in their profile, in which [separated by commas] they enter _arbitrary_ tags (the field is not necessarily text, mb and JSON, for example, as you say)))
- By request [by clicking on the button] the user can get a list of profiles , with the largest number of matches of the entered tags (ideally - ranked by the number of matches)
As if you immediately see several implementation mechanisms, you want to immediately choose the optimal one without too much pain
What do you advise?
And yes, I have not worked with NoSQL databases until now, maybe this is just the case when it is worth a try? For as far as I understand the situation, they are just about for this and created?
I just want to make such a selection purely by means of the database itself, without resorting to PHP, array comparison, and the like.
Is this even possible?
The database needs open source, not MSSQL ))
Thanks in advance for the good advice!

Answer 1

Redis, Neo4j, Datomic.