Efficient bulk insertion into a distributed ordered table
- 9 June 2008
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 765-778
- https://doi.org/10.1145/1376616.1376693
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- DynamoPublished by Association for Computing Machinery (ACM) ,2007
- SinfoniaPublished by Association for Computing Machinery (ACM) ,2007
- Community systems research at Yahoo!ACM SIGMOD Record, 2007
- B-tree indexes for high update ratesACM SIGMOD Record, 2006
- A Polynomial Time Approximation Scheme for the Multiple Knapsack ProblemSIAM Journal on Computing, 2005
- The log-structured merge-tree (LSM-tree)Acta Informatica, 1996
- Algorithms for creating indexes for very large tables without quiescing updatesPublished by Association for Computing Machinery (ACM) ,1992
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack ProblemOperations Research, 1979
- An algorithm for 0‐1 multiple‐knapsack problemsNaval Research Logistics Quarterly, 1978
- An Approach to Linear Programming with 0–1 VariablesManagement Science, 1968