[Feature] introduce key-value separation for big values
- Dominant language
- Java
- Stars
- 3.4k
- Forks
- 1.4k
- Avg merge
- 1d 11h
- Merged PRs (30d)
- 396
Description
### Search before asking
- [X] I searched in the [issues](https://github.com/apache/incubator-paimon/issues) and found nothing similar.
### Motivation
If the values is very big, we can separate key and value in the LSM tree,so that we avoid copying the values over and over again during compaction to improve the performance .
refer to https://rocksdb.org/blog/2021/05/26/integrated-blob-db.html
### Solution
_No response_
### Anything else?
_No response_
### Are you willing to submit a PR?
- [ ] I'm willing to submit a PR!
Contributor guide
No contributing guide indexed for this repository
Research direction
The issue names no files, tests, or entry points. Start by locating the LSM-tree implementation, then read the linked RocksDB Integrated Blob DB design to understand the proposed key-value separation; the scope and definition of done still need to be established.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- databases
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100