LookupQueue can be refactored into a memory-managed queue
- Dominant language
- Java
- Stars
- 2.1k
- Forks
- 625
- Avg merge
- 3d 14h
- Merged PRs (30d)
- 97
Description
### Search before asking
- [x] I searched in the [issues](https://github.com/apache/fluss/issues) and found nothing similar.
### Motivation
`LookupQueue` could be refactored into a memory-managed queue similar to `RecordAccumulator`, which would significantly improve the efficiency of lookup batching.
### Solution
_No response_
### Anything else?
_No response_
### Willingness to contribute
- [ ] I'm willing to submit a PR!
Contributor guide
No contributing guide indexed for this repository
Research direction
Start by locating the LookupQueue and RecordAccumulator implementations and the lookup-batching entry points that use them. Compare how each manages memory and batching, then define the refactor's completion criteria around equivalent lookup behavior with the intended memory-managed batching efficiency.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- data-engineering
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100