Efficient bulk insertion into a distributed ordered table

This publication has 11 references indexed in Scilit:

• Dynamo
  Published by Association for Computing Machinery (ACM) ,2007
• Sinfonia
  Published by Association for Computing Machinery (ACM) ,2007
• Community systems research at Yahoo!
  ACM SIGMOD Record, 2007
• B-tree indexes for high update rates
  ACM SIGMOD Record, 2006
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
  SIAM Journal on Computing, 2005
• The log-structured merge-tree (LSM-tree)
  Acta Informatica, 1996
• Algorithms for creating indexes for very large tables without quiescing updates
  Published by Association for Computing Machinery (ACM) ,1992
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
  Operations Research, 1979
• An algorithm for 0‐1 multiple‐knapsack problems
  Naval Research Logistics Quarterly, 1978
• An Approach to Linear Programming with 0–1 Variables
  Management Science, 1968