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

More compact representation for search index #135

Open
alnkesq opened this issue Mar 4, 2025 · 0 comments
Open

More compact representation for search index #135

alnkesq opened this issue Mar 4, 2025 · 0 comments

Comments

@alnkesq
Copy link
Owner

alnkesq commented Mar 4, 2025

Current: ulong (word hash) -> uint32[] (each pointing to a 200ms slot)
Possible improvement:
ulong (word hash) -> { uint32 InitialSlot; BitmapOfSubsequentSlots }[] or { uint32 InitialSlot; UInt24[] OffsetsOfSubsequentSlots }[], depending on what is the most compact for this KV pair.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@alnkesq