zhangjun0x01 opened a new issue, #1769: URL: https://github.com/apache/incubator-paimon/issues/1769
### Search before asking - [X] I searched in the [issues](https://github.com/apache/incubator-paimon/issues) and found nothing similar. ### Motivation Now, for universal compaction, when the condition for size amplification are met, [we select all the input sorted run to compaction](https://github.com/apache/incubator-paimon/blob/edaac231dbccce9cddd48937e37c74e84eb638f0/paimon-core/src/main/java/org/apache/paimon/mergetree/compact/UniversalCompaction.java#L104). , which is high cost, we can reduce the cost of the compression by selecting partial sorted runs. Dividing one compaction process into multiple sub compaction will make the entire compaction process smoother A simple optimization would be to compact so that just enough files are merged into the bottommost level (Lmax) to satisfy condition. It would work if we only need to pick some files from Lmax-1 or other level. refer to. https://rocksdb.org/blog/2021/04/12/universal-improvements.html ### Solution _No response_ ### Anything else? _No response_ ### Are you willing to submit a PR? - [X] I'm willing to submit a PR! -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
