Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems

We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable in large-scale parallel databases, as well as in peer-to-peer (P2P) systems. As tuples are inserted and deleted, the partitions may need to be adjusted, and data moved, in order to achieve storage balance across the participant disks/nodes. We propose ef£cient, asymptotically optimal algorithms that ensure storage balance at all times, even against an adversarial insertion and deletion of tuples. We combine the above algorithms with distributed routing structures to architect a P2P system that supports ef£cient range queries, while simultaneously guaranteeing storage balance.

• Type: Conference
• Year: 2004
• Where: VLDB
• Authors: Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molina
• Keywords: Database, Range Partitioning, Storage Balance, Such Partitioning, VLDB 2004