Hi all, Needed help in one use case : It is like when you have 2 sets of data suppose A and B, which are linked to each other. For example, each entity of set X can have 1 to many relationships to the set B, and as a result, I need the sorted/faceted values of the values from Set B. For example entity x(i) from Set A, can have a relation which all the values in the Set B. and another entity x(j) from Set A can have [y(i)... y(j)] values from set B.
* both the data sets are too larger. One Idea was too just have data of Set B, and we just put fq for all the values of which Set X can have and then we can do sort and faceting on them. but since the data size is +1000 it will never be a good approach. Another Idea is we can create a parent-child data relationship as 2 different collections and then perform join over them, Please review and suggest if there could be any other way possible of solving this problem. -- Warm Regards, Lucky Sharma Contact No: +91 9821559918
