Database partitioning in a cluster of processors

This publication has 11 references indexed in Scilit:

• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Distribution Design of Logical Database Schemas
  IEEE Transactions on Software Engineering, 1983
• Comparative Models of the File Assignment Problem
  ACM Computing Surveys, 1982
• Horizontal data partitioning in database design
  Published by Association for Computing Machinery (ACM) ,1982
• Extending the database relational model to capture more meaning
  ACM Transactions on Database Systems, 1979
• A heuristic approach to attribute partitioning
  Published by Association for Computing Machinery (ACM) ,1979
• Optimal program and data locations in computer networks
  Communications of the ACM, 1977
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
  SIAM Journal on Computing, 1974
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
  SIAM Journal on Computing, 1973
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971