By Topic

Design of shared-nothing cluster architecture for fast accessing and highly availability of data in heterogeneous database environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Deepak Sukheja ; PITM, Indore, INDIA ; Umesh K. Singh

Database systems have been essential for all forms of data processing for a long time. In recent years, the amount of processed data has been growing dramatically, even in small projects. At the other hand, database management systems tend to be static in terms of size and performance, which makes scaling a difficult and expensive task. Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distributed across different servers for better performance. In this paper, we focus on complex queries whose evaluation tends to be time-consuming and design the secured share nothing clustering architecture to improve the performance of application and also assure to the user to availability of the data. The proposed architecture is very helpful towards a two phase query optimizer. In the first phase, the synchroniz and decomposes a query into subqueries and transfer them to appropriate cluster nodes. In the second phase, each cluster node optimizes and evaluates its subquery locally.

Published in:

Information and Communication Technologies (WICT), 2011 World Congress on

Date of Conference:

11-14 Dec. 2011