At least the implementation I proposed does not really use space efficiently when storing facet data, and memory consumption is not efficient. A compressed caching could reduce the storage space required for facet data, as per thispaper on Dynamic Faceted Search.
We could explore libraries or algs that support compressed indexing like Roaring bitmaps.
Yes you are right. The time and space complexity should be put into consideration as well. I will find time to go through the paper prior to the meeting. Thank you.
At least the implementation I proposed does not really use space efficiently when storing facet data, and memory consumption is not efficient. A compressed caching could reduce the storage space required for facet data, as per thispaper on Dynamic Faceted Search.
We could explore libraries or algs that support compressed indexing like Roaring bitmaps.