Distributed databases principles and systems
Distributed databases principles and systems
Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Architecture for distributed multimedia database systems
Computer Communications - Multimedia communications
Computer
The annealing evolution algorithm as function optimizer
Parallel Computing
Parallel recombinative simulated annealing: a genetic algorithm
Parallel Computing
An object-oriented multimedia database system for a news-on-demand application
Multimedia Systems - Special issue on multimedia database systems
Multimedia database management systems
ACM Computing Surveys (CSUR)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Model for Database Allocation Incorporating a Concurrency Control Mechanism
IEEE Transactions on Knowledge and Data Engineering
Multiprocessor Document Allocation: A Genetic Algorithm Approach
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the Fourth International Conference on Data Engineering
Scheduling Data Redistribution in Distributed Databases
Proceedings of the Sixth International Conference on Data Engineering
Query-Driven Data Allocation Algorithms for Distributed Database Systems
DEXA '97 Proceedings of the 8th International Conference on Database and Expert Systems Applications
Design and evaluation of data allocation algorithms for distributed multimedia database systems
IEEE Journal on Selected Areas in Communications
A Distribution Design Methodology for Object DBMS
Distributed and Parallel Databases
GDM: a new graph based data model using functional abstractionx
Journal of Computer Science and Technology - Special section on China AVS standard
Theoretical properties of two problems of distribution of interrelated data
Proceedings of the 44th annual Southeast regional conference
DYFRAM: dynamic fragmentation and replica management in distributed database systems
Distributed and Parallel Databases
Performance optimality enhancement algorithm in DDBS (POEA)
Computers in Human Behavior
Hi-index | 0.00 |
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites to the site where the query is initiated. The objective of a data allocation algorithm is to determine an assignment of fragments at different sites so as to minimize the total data transfer cost incurred in executing a set of queries. This is equivalent to minimizing the average query execution time, which is of primary importance in a wide class of distributed conventional as well as multimedia database systems. The data allocation problem, however, is NP-complete, and thus requires fast heuristics to generate efficient solutions. Furthermore, the optimal allocation of database objects highly depends on the query execution strategy employed by a distributed database system, and the given query execution strategy usually assumes an allocation of the fragments. We develop a site-independent fragment dependency graph representation to model the dependencies among the fragments accessed by a query, and use it to formulate and tackle data allocation problems for distributed database systems based on query-site and move-small query execution strategies. We have designed and evaluated evolutionary algorithms for data allocation for distributed database systems.