refactor(storage): improve inverted index match phrase query

[b41sh]

I hereby agree to the terms of the CLA available at: https://docs.databend.com/dev/policies/cla/

Summary

• reimplement inverted index phrase query matching algorithm, fix some rows matching failure case and panic case.
• use RoaringTreemap instead of HashSet to improve the computing performance of bitand, bitor.
• use ok_or_else instead of ok_or to improve performance.
• remove some unused inverted index code.

The phrase query matches doc_ids as follows:

1. Collect the position for each term in the query.
2. Collect the doc_ids of each term and take the intersection to get the candidate doc_ids.
3. Iterate over the candidate doc_ids to check whether the position of terms matches the position of terms in query.
4. Each position in the first term is a possible query phrase beginning. Verify that the beginning is valid by checking whether corresponding positions in other terms exist. If not, delete the possible position in the first term. After traversing all terms, determine if there are any positions left in the first term. If there are, then the doc_id is matched.

Tests

• Unit Test
• Logic Test
• Benchmark Test
• No Test - Code refactoring, using previous test case to check

Type of change

• Bug Fix (non-breaking change which fixes an issue)
• New Feature (non-breaking change which adds functionality)
• Breaking Change (fix or feature that could cause existing functionality not to work as expected)
• Documentation Update
• Refactoring
• Performance Improvement
• Other (please describe):

---

This change is