1 评论 (1 评论)0 反应 (0 反应)0 负责人 (0 负责人)Java4,212 star (4,212 star)1,469 fork (1,469 fork)batch import
featureshelp wantedquestion
描述
为了控制事务提交时间,将从最终一致性跨越成为强一致性。
贡献者指南
- 技术栈
- java
- 领域
- backenddatabase
- 议题类型
- feature
- 难度面向新贡献者的预计实现难度,1 表示很小改动,5 表示专家级工作。
- 5
- 预计时间有经验贡献者完成调查、实现、测试并准备 pull request 的粗略时间范围。
- over 1 week
- 活动状态议题当前的可参与程度:新鲜、活跃、陈旧、阻塞或等待维护者输入。
- stale
- 清晰度议题是否清楚说明期望改动、验收标准和下一步。
- needs investigation
- 前置要求
- Knowledge of distributed systemsUnderstanding consensus algorithmsFamiliarity with Java
- 新手友好度1-100 的估计分数,表示该议题对首次贡献者的友好程度。
- 10
- 研究方向
- This issue proposes implementing an atomic clock algorithm to transition from eventual consistency to strong consistency in transaction commit times. The description is high level and lacks specific technical requirements. A newcomer should first review existing atomic clock algorithms (e.g., Google's TrueTime, Hybrid Logical Clocks) and consider how they could be integrated into the tx lcn framework. Additionally, examining the single comment in the issue and related repository discussions may provide context. No concrete design or implementation details are provided, so the initial step would be to propose a detailed design document.