linksplatform / linksplatform/Data.Doublets
Implement simple BitString/BitArray index layer/decorator that can be attached to links storage
Nobody has claimed this yet.
- Dominant language
- C#
- Stars
- 14
- Forks
- 5
- PR merge metrics
- No merged PRs in 30d
Description
351 RUB reward can be claimed by anyone who completes this task.
All CRUD operations should support this index.
This index should store the same data as tree indexes, so we will be able to compare which one is faster in what situations.
So the result implementation should have enough options to modify the behavior of the index.
Read operation may use the index always or in some situations (should be configurable).
Write operations should update the index according to created/updated/deleted links, so the index is always in sync with data.
This issue is related to https://github.com/linksplatform/Data.Doublets/issues/185
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading related issue #185 and reviewing the existing tree indexes and links storage. Define how the BitString/BitArray index attaches to storage, how configurable reads use it, and how create, update, and delete operations keep it synchronized. Done means all CRUD operations support the index and its behavior can be compared with tree indexes.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- csharp
- Domain
- database
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Active
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100