<![CDATA[In high-performance computing (HPC) environments, the need to balance memory efficiency and query performance is crucial for ensuring optimal system performance. Traditional data structures, such as B-trees and hash tables, often prioritize either memory usage or query speed, leading to suboptimal performance in memory-constrained systems. This paper proposes a hybrid data structure that combines the strengths of multiple traditional data structures to optimize both memory usage and query processing speed. The proposed hybrid structure integrates cache-conscious algorithms, dynamic memory allocation, and compression techniques for intermediate query results. The approach is evaluated through extensive benchmarking tests comparing it to standard data structures like B-trees and hash tables under various workloads. Results show that the hybrid data structure reduces memory overhead by up to 30% while maintaining query processing speeds up to 1.5 times faster than conventional methods. Furthermore, the hybrid structure demonstrates robust performance across different types of queries, including both point and range queries, ensuring versatility and efficiency. The findings indicate that this hybrid approach provides a promising solution for HPC systems, where both memory efficiency and query speed are essential. Future research can explore extending the hybrid structure to distributed systems and emerging technologies, further improving its scalability and adaptability to new computational paradigms.]]>
