![]() More specifically, we proposed a new structure, partial bitvectors, and showed that it combines the benefits of bitvectors for dense data with the benefits of skips for sparse data. Finding all documents that match a query is a central requirement for search engines, and our goal is to do so efficiently.įirst, we have developed improved indexing techniques that are more compact and/or provide faster retrieval for conjunctive queries.
0 Comments
Leave a Reply. |