Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
On knowledge base management systems: integrating artificial intelligence and d atabase technologies
On knowledge base management systems: integrating artificial intelligence and d atabase technologies
Load balancing in a locally distributed DB system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Optimization models for configuring distributed computer systems
IEEE Transactions on Computers
Task Allocation and Precedence Relations for Distributed Real-Time Systems
IEEE Transactions on Computers
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
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
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Distributed query processing with load balancing in local area networks
Distributed query processing with load balancing in local area networks
Design of partially replicated distributed database systems: an integrated methodology
Design of partially replicated distributed database systems: an integrated methodology
IEEE Transactions on Knowledge and Data Engineering
An Iterative Method for Distributed Database Design
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.01 |
The objective of this research is to develop and integrate tools for the design of partially replicated distributed database systems. Many existing tools are inappropriate for designing large-scale distributed databases due to their large computational requirements. Our goal is to develop tools that solve the design problems reasonably quickly, typically by using heuristic algorithms that provide approximate or near-optimal solutions.In developing this design methodology, we assume that information regarding the types of user requests and their rates of arrival into the system is known a priori. The methodology assumes a general model for transaction execution. In this paper we discuss three aspects of the design methodology: the data allocation problem, the use of a static load-balancing scheme in coordination with the allocation scheme, and the design evaluation and review step. Our methodology employs iterative design techniques using performance evaluation as a means to iterate.