Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Effective distribution of object-oriented applications
Communications of the ACM
A genetic algorithm for fragment allocation in a distributed database system
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
Distributed and Parallel Databases
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Graphical Approach to Allocating Class Fragments in Distributed Objectbase Systems
Distributed and Parallel Databases
Allocating Data and Operations to Nodes in Distributed Database Design
IEEE Transactions on Knowledge and Data Engineering
Allocation of class fragments in distributed object-based systems
Allocation of class fragments in distributed object-based systems
Efficient Disk-Based K-Means Clustering for Relational Databases
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Efficient techniques are needed to allocate resources across distributed sites, in order to minimize processing costs and to improve response times for users. This research investigates algorithms for the efficient partitioning of multiple interrelated data objects across the sites within a computer system. Interrelated data objects commonly arise in database systems, and their interrelation presents problems in placement. It is desirable to allocate these data objects so that objects which are related to each other, are in close proximity. Two methods of achieving this is to, perform the allocation so that interrelated data are placed at adjacent nodes, or placed so that the maximum distance between two interrelated data members (the interrelated class diameter), is minimal.