dc.contributor.author |
De Silva, Daswin Pasantha L P |
|
dc.contributor.author |
Dissanayake, Manjula |
|
dc.date.accessioned |
2020-05-27T05:13:11Z |
|
dc.date.available |
2020-05-27T05:13:11Z |
|
dc.date.issued |
2006 |
|
dc.identifier.citation |
De Silva, L. P. D. P. and Dissanayake, M (2006) ‘Optimal Design of Distributed Databases’ In: 2006 International Conference on Information and Automation, Shandong, China. 15-17 December 2006. pp. 1-6 IEEE DOI: 10.1109/ICINFA.2006.374142 |
en_US |
dc.identifier.uri |
https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4250232 |
|
dc.identifier.uri |
http://dlib.iit.ac.lk/xmlui/handle/123456789/425 |
|
dc.description.abstract |
The physical expansion of enterprises with the current trends in globalization has had a positive influence on the technologies of distributed systems. At the forefront of this technological revolution are distributed database systems. For a distributed database to be at optimal performance and thus provide an efficient service it needs to be designed appropriately. The significance of the perfect design is only emphasized by the multiple dimensions required in generating a design. The purpose of this paper is to suggest an approach to generate optimal designs for such distributed database systems and to develop a prototype to demonstrate the said approach. The approach emphasizes on the accuracy of inputs as it largely determines the quality of the final solution. Hence the extraction of network information, a key dimension, is automated to ensure precision. The global schema is fragmented considering data requirements as well as connectivity of each site. Allocation of fragments is treated as a combinatorial optimization problem and assigned to a memetic algorithm. An estimation of distribution algorithm complements the search effort of this memetic algorithm. Site options for replication server environments are investigated based on a shortest path algorithm. Usability of the system in an object oriented development environment, through conditional object-relational mapping, is also explored. The prototype was developed using an evolutionary prototyping approach. It was evaluated by several experts in the relevant fields of application. The results of which, confirmed the practicality of the suggested approach. |
en_US |
dc.publisher |
IEEE |
en_US |
dc.subject |
Distributed Database Design |
en_US |
dc.subject |
Memetic Agorithms |
en_US |
dc.subject |
Object-Relational Mapping |
en_US |
dc.subject |
Bandwidth Measurement |
en_US |
dc.subject |
Spatial databases |
en_US |
dc.subject |
Distributed computing |
en_US |
dc.title |
Optimal Design of Distributed Databases |
en_US |
dc.type |
Article |
en_US |