| Available via | http://dbpubs.stanford.edu/pub/2004-23 |
|
Submitted on |
3rd of April 2004 |
|
Author |
Ganesan, Prasanna; Yang, Beverly; Garcia-Molina, Hector |
|
Title |
One Torus to Rule Them All: Multi-dimensional Queries in P2P Systems |
|
Date of publication |
2004 |
|
Published in |
Technical Report |
|
Citation |
Ganesan, Prasanna; Yang, Beverly; Garcia-Molina, Hector. One Torus to Rule Them All: Multi-dimensional Queries in P2P Systems, |
|
Number of pages |
6 |
|
Language |
English |
|
Project |
Peers |
|
Type |
Technical Report |
|
Subject group |
Distributed Systems |
|
Abstract |
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. |
| Fulltext source |
Postscript (ps, ps.gz, ps.zip)
PDF (pdf, pdf.gz, pdf.zip)
| Management of the document by | siroker@db.stanford.edu
| |