Ganesan, Prasanna and Yang, Beverly and Garcia-Molina, Hector (2004) One Torus to Rule Them All: Multi-dimensional Queries in P2P Systems. Technical Report. Stanford.
Peer-to-peer systems enable access to data spread over an extremely large number of machines. Most P2P systems support only simple lookup queries. However, many new applications, such as P2P photo sharing and massively multi-player games, would benefit greatly from support for multi-dimensional range queries. We show how such queries may be supported in a P2P system by adapting traditional spatial-database technologies with novel P2P routing networks and load-balancing algorithms. We show how to adapt two popular spatial-database solutions -- kd-trees and space-filling curves -- and experimentally compare their effectiveness.
|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:||02 Apr 2004 16:00|
|Last Modified:||23 Dec 2008 08:56|
Repository Staff Only: item control page