Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement a first 4-ary trie to represent posting lists #37

Open
wants to merge 4 commits into
base: main
Choose a base branch
from
Open

Implement a first 4-ary trie to represent posting lists #37

wants to merge 4 commits into from

Commits on Oct 30, 2024

  1. Implement a first 4-ary trie to represent posting lists. 

    This is our base-line implementation.
    @aneubeck
    aneubeck committed Oct 30, 2024
    Configuration menu
    Copy the full SHA
    16ce6ac View commit details
    Browse the repository at this point in the history

Commits on Oct 31, 2024

  1. Optimize implementations and make blocks fully configurable. 

    Fastest results are achieved with 32 bytes per block which results in a 12.5% overhead.
64 bytes per block seems like a reasonable compromise between speed and memory overhead (6.25%).
    @aneubeck
    aneubeck committed Oct 31, 2024
    Configuration menu
    Copy the full SHA
    2711809 View commit details
    Browse the repository at this point in the history

  2. Speeding things up further by avoiding rank computations and bit acce… 

    …ss from scratch.

Instead, we check whether the access still belongs within the same word that we cache locally.
    @aneubeck
    aneubeck committed Oct 31, 2024
    Configuration menu
    Copy the full SHA
    e6ad464 View commit details
    Browse the repository at this point in the history

  3. Add union implementation

    @aneubeck
    aneubeck committed Oct 31, 2024
    Configuration menu
    Copy the full SHA
    6a9a1f0 View commit details
    Browse the repository at this point in the history