Distributed and Parallel Databases
MICAI '00 Proceedings of the Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Heuristic Approach to Fragmentation Incorporating Query Information
Proceedings of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006
A new ant colony optimization based algorithm for data allocation problem in distributed databases
Knowledge and Information Systems
Distributed and Parallel Databases
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
Principles of Distributed Database Systems
Principles of Distributed Database Systems
Knowledge and Information Systems
Dynamic data allocation with replication in distributed systems
PCCC '11 Proceedings of the 30th IEEE International Performance Computing and Communications Conference
| Hi-index | 7.29 |
The main purpose of this paper is to show the advantage of using a model proposed by us, which minimizes roundtrip response time versus traditional models that minimize query transmission and processing costs for the design of a distributed database with vertical fragmentation. To this end, an experiment was conducted to compare the roundtrip response time of the optimal solution obtained using our model versus the roundtrip response time of the optimal solution obtained using a traditional model. The experimental results show that for most cases the optimal solution from a traditional model yields a response time which is larger than the response time of the optimal solution obtained from our model, and sometimes it can be thrice as large.