A Data Organization Architecture for Efficient Transaction Processing and Approximate AP Query in HTAP Systems
摘要
This paper introduces a scalable HTAP architecture combining heterogeneous replication, dynamic partitioning, and batch processing to optimize OLTP throughput and OLAP query efficiency. By reducing cross-partition transactions and 2PC protocol overhead, it achieves 11x higher YCSB transactional throughput than existing systems while maintaining low latency. The design employs logical timestamp-based concurrency control and columnar sample datasets for efficient OLAP approximate queries, supported by epoch-based recovery for fault tolerance. Though batch processing introduces minor latency, the architecture balances scalability and consistency, with persistent logging ensuring resilience. Experiments validate significant throughput gains and analytical accuracy across workloads. Future work will enhance real-time data synchronization and extend support for machine learning/graph analytics. The solution addresses HTAP’s dual demands through integrated workload optimization, offering a robust foundation for data-intensive applications.