Distributed databases principles and systems
Distributed databases principles and systems
Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
Simulating computer systems: techniques and tools
Simulating computer systems: techniques and tools
Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
On Optimal Site Assignment for Relations in the Distributed Database Environment
IEEE Transactions on Software Engineering
Dynamic file migration in distributed computer systems
Communications of the ACM
Principles of distributed database systems
Principles of distributed database systems
A comprehensive approach to horizontal class fragmentation in a distributed object based system
Distributed and Parallel Databases
Distributed Object Based Design: Vertical Fragmentation of Classes
Distributed and Parallel Databases
Optimal allocation of resources in distributed information networks
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Optimization of Memory Hierarchies in Multiprogrammed Systems
Journal of the ACM (JACM)
Optimization of Static Loading and Sizing of Multilevel Memory Systems
Journal of the ACM (JACM)
Database Location in Computer Networks
Journal of the ACM (JACM)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Optimal program and data locations in computer networks
Communications of the ACM
Optimal balancing of I/O requests to disks
Communications of the ACM
Analysis of Replication in Distributed Database Systems
IEEE Transactions on Knowledge and Data Engineering
Object Placement in Parallel Object-Oriented Database Systems
Proceedings of the Tenth International Conference on Data Engineering
File Allocation in Distributed Databases with Interaction between Files
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Database Partitioning in a Cluster of Processors
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
File Assignment in Memory Hierarchies
Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems
File allocation in distributed systems
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Allocation of class fragments in distributed object-based systems
Allocation of class fragments in distributed object-based systems
A Distribution Design Methodology for Object DBMS
Distributed and Parallel Databases
Theoretical properties of two problems of distribution of interrelated data
Proceedings of the 44th annual Southeast regional conference
Security and capacity constraints allocation in distributed object oriented databases
CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
Scalable store of java objects using range partitioning
CEE-SET'09 Proceedings of the 4th IFIP TC 2 Central and East European conference on Advances in Software Engineering Techniques
Hi-index | 0.00 |
This paper contributes by providing an allocation taxonomy to analyze DOBS models and identify the primary characteristics of a DOBS allocation. A graphical optimization technique, based on the work by Kernighan and Lin (The Bell System, Technical Journal, pp. 291–307, 1970), is basis of our approach. The algorithm attempts to arrive at a “near optimal” distribution of fragments by exchanging and/or moving fragments between every pair of sites. The algorithms are implemented and are tested with carefully generated test data to obtain an analysis of the performance. The design, implementation and analysis of the allocation algorithms form the most significant contribution of this paper. Several significant insights are derived from the analysis of the results obtained that can be usefully applied to any real life DOBS allocation design. The applicability of the allocation algorithms for the DOBS model of interest may be verified by a cost benefit analysis based on their efficiency. The optimization of the initial allocation is meaningful only if the improvement obtained by optimization justifies the additional overhead. If significant improvement is not obtainable by optimization then our efficient initial allocation scheme alone may serve the purpose.