Ganesan, Prasanna and Bawa, Mayank and Garcia-Molina, Hector (2004) Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. Technical Report. Stanford.
This is the latest version of this item.
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.
|Item Type:||Techreport (Technical Report)|
|Subjects:||Computer Science > Distributed Systems|
|Related URLs:||Project Homepage||http://infolab.stanford.edu/peers/|
|Deposited By:||Import Account|
|Deposited On:||11 Mar 2004 16:00|
|Last Modified:||23 Dec 2008 08:47|
Available Versions of this Item
- Distributed Balanced Tables: Not Making a Hash of it all. (deposited 25 Nov 2003 16:00)
- Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. (deposited 11 Mar 2004 16:00) [Currently Displayed]
- Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. (deposited 12 Jul 2004 17:00)
Repository Staff Only: item control page