Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Optimal program and data locations in computer networks
Communications of the ACM
Database Design
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Computer Alori
Fundamentals of Computer Alori
A heuristic approach to attribute partitioning
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Horizontal data partitioning in database design
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A clustering approach to the generation of subfiles for the design of a computer data base.
A clustering approach to the generation of subfiles for the design of a computer data base.
TEX and METAFONT: New directions in typesetting
TEX and METAFONT: New directions in typesetting
Fragmentation: a technique for efficient query processing
ACM Transactions on Database Systems (TODS)
Teaching all essential elements in a one semester database course
ACM SIGCSE Bulletin
Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Performance of a Composite Attribute and Join Index
IEEE Transactions on Software Engineering
Partition Strategy for Distributed Query Processing in Fast Local Networks
IEEE Transactions on Software Engineering
ACM Transactions on Database Systems (TODS)
Use of composite index in DDBMS
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
A heuristic algorithm for partition strategy in distributed query processing
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Automating physical database design in a parallel database
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Logically Clustered Architectures for Networked Databases
Distributed and Parallel Databases
MOBY: An Architecture for Distributed Expert Database Systems
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An Iterative Method for Distributed Database Design
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Integrating vertical and horizontal partitioning into automated physical database design
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Experimental evidence on partitioning in parallel data warehouses
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
An adaptable vertical partitioning method in distributed systems
Journal of Systems and Software
Low overhead concurrency control for partitioned main memory databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
DYFRAM: dynamic fragmentation and replica management in distributed database systems
Distributed and Parallel Databases
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Horizontal partitioning by predicate abstraction and its application to data warehouse design
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Towards a scalable and robust multi-tenancy SaaS
Proceedings of the Second Asia-Pacific Symposium on Internetware
Trojan data layouts: right shoes for a running elephant
Proceedings of the 2nd ACM Symposium on Cloud Computing
Verification of partitioning and allocation techniques on teradata DBMS
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Database placement in communication networks for minimizing the overall transmission cost
Mathematical and Computer Modelling: An International Journal
Satisfying quality requirements in the design of a partition-based, distributed stock trading system
Software—Practice & Experience
Hi-index | 0.00 |
In a distributed database system the partitioning and allocation of the database over the processor nodes of the network can be a critical aspect of the database design effort. In this paper we develop and evaluate algorithms that perform this task in a computationally feasible manner. The network we consider is characterized by a relatively high communication bandwidth, considering the processing and input output capacities in its processors. Such a balance is typical if the processors are connected via busses or local networks. The common constraint that transactions have a specific root node no longer exists, so that there are more distribution choices. However, a poor distribution leads to less efficient computation, higher costs, and higher loads in the nodes or in the communication network so that the system may not be able to handle the required set of transactions.Our approach is to first split the database into fragments which constitute appropriate units for allocation. The fragments to be allocated are selected based on maximal benefit criteria using a greedy heuristic. The assignment to processor nodes uses a first-fit algorithm. The complete algorithm, called GFF, is stated in a procedural form.The complexity of the problem and of its candidate solutions are analyzed and several interesting relationships are proven. Alternate benefit metrics are considered, since the execution cost of the allocation procedure varies by orders of magnitude with the alternatives of benefit evaluation. A mixed benefit evaluation strategy is eventually proposed.A model for evaluation is presented. Two of the strategies are experimentally evaluated, and the reported results support the discussion. The approach should be suitable for other cases where resources have to be allocated subject to resource constraints.