Data Communication Algorithm of HPDB Parallel Database System Based on Computer Network

High-Performance Database (HPDB) is designed to meet the demands of today’s modern data-driven world, as massive volumes of information need to be accessed and analyzed with minimal latency. A pivotal aspect of their operation lies in efficient data communication among nodes in a computer network, which is essential for parallel database systems. HPDBs may involve distributed architectures and parallel database systems to store and process data across multiple nodes or servers in a network. Hence, an algorithm called Hybridized Partitioning Strategy (HPS)-based Communication (C) for achieving HPDB has been proposed to facilitate data transmission and coordination across a computer network using the Message Passing Interface (MPI) protocol. The proposed HPS-C-HPDB technique includes partitioning and distributing data, query routing, and load balancing strategies to achieve high-performance levels. The (HPS) combines hash and range partitioning methods for effective processing and retrieval to balance data distribution, reduce communication overhead in parallel databases, and improve the system’s performance. In parallel database systems, query routing effectively routes requests into the optimal nodes or partitions based on the query’s conditions and the data’s placement and guarantees efficient data processing and retrieval. The proposed scheme is evaluated using various performance metrics like throughput, response time, speedup, and communication overhead analysis.