Difference Between Paralell and Cloud Databases

1154 Words3 Pages

There are several differences between cloud and parallel database which include load sharing, joins, query optimization, route scheduling and resource optimization.

The first difference is load sharing. In parallel database load sharing is balanced since the optimization algorithm works on the kernel level and routing protocol determines the best route to find it. As a consequence, load keeps distributing on the server side. Moreover, in parallel database table look up is not needed because heuristic approach notifies the server if the load balancing bit is set to one. The objective of load sharing strategies is to minimize the average transaction response time. In parallel database dynamic load sharing strategy is use for load sharing purpose. Xiaohu, Renqiang, Chujie, Yu (2013, p. 369) states that if at any time the cumulative performance of any component fails, then the cumulative performance of rest of the components in the system should be redistributed to keep the initial and final cumulative performance of the whole system same. Thus, it reduces the time taken to resolve the query clients can make multiple requests at the same time.

In contrast to parallel database, cloud database puts all resources together in a pool, so whenever a resource is requested, pool serves that request and load depends on the number of requests. Pitoura, Ntarmos and Traintafillou (2012, p. 1315) argue that “range queries progress from the peer responsible for the range’s lowest value to the peer responsible for its highest value following successor pointers”. On the contrary, in parallel database successive pointers are not used while all nodes are connected in a tree structure. Cloud database mainly deals with the software as a service, in ...

... middle of paper ...

...e to insecure mode, many applications don’t use this protocol. UDP collectively takes all the packets together through the channel and block the resources completely. Moreover, UDP does not provide reliable data transfers since reliability costs more. For example, Li, Huang, Li and Li (2013, p. 363) explains that after combining real time data in industrial field with organization and management technologies of cloud storage systems, the real time constraint of memory and storage index mechanism can be realized. The jurisdiction management deals with the branch prediction technology; therefore it automatically fetches the data before it needs hence the process speeds up. On the other hand, capacity distribution primarily deals with the cache of CPU, so when it encounters the same query set it automatically fetches the word. As a result, UDP provides data transfer

Open Document