Hi,
In database systems implementation, there is a type of index called
bit map indexing. The bitset implementation could borrow idea from the
database engine implementation.
You could squeeze all the 0's together and write how many of those
0's, that might be very memory saving.
There are
True, the span query accomplishes large part of the passage search.
However, correct me if I am wrong, it seems to me that the span query
only matches all words you specified. there is a limitation there
compared to passage search or cover density search, which matches some
of the user input
