@inproceedings{ilprints768,
       booktitle = {30th International Conference on Very Large Data Bases (VLDB 2004) },
           title = {Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems},
          author = {Prasanna Ganesan and Mayank Bawa and Hector Garcia-Molina},
            year = {2004},
            note = {Extended Technical Report available at: http://dbpubs.stanford.edu/pub/2004-18 },
         journal = {Proceedings VLDB, 2004},
             url = {http://ilpubs.stanford.edu:8090/768/},
        abstract = {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 efficient, 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 efficient range  queries, while simultaneously guaranteeing storage balance.}
}