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
[1]
Yi Huang,et al.
Cooperating services for data-driven computational experimentation
,
2005,
Computing in Science & Engineering.
[2]
Pierre Michaud,et al.
Clustering techniques
,
1997,
Future Gener. Comput. Syst..
[3]
Patrick Valduriez,et al.
Scaling Up the Preventive Replication of Autonomous Databases in Cluster Systems
,
2004,
VECPAR.
[4]
Philip J. Hatcher,et al.
Cluster computing with Java
,
2005,
Computing in Science & Engineering.
[5]
Hans-Jörg Schek,et al.
Cache-aware query routing in a cluster of databases
,
2001,
Proceedings 17th International Conference on Data Engineering.