Database Paper Browser

Back to papers

Efficient Bulk Insertion into a Distributed Ordered Table

Summary: Pre-insertion planning creates and redistributes partitions to balance bulk inserts across a distributed ordered table. Frames the load-balancing as a partition-movement vs insertion-time tradeoff, reduced to a vector-packing variant of NP-hard bin-packing with guarantees; validated on a 50-node cluster. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4031
Venue
SIGMOD
Year
2008
Pagerank
7.0994919e-05
Overall Rank
3,434 | 76.12%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers