|
|
|
                                          
|
Return to Session 2: Peer-to-Peer Search Systems
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 multiplayer games, would benefit greatly from support for multidimensional 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.
@inproceedings {DBLP:conf/webdb/GanesanYGM04, author = {Prasanna Ganesan and Beverly Yang and Hector Garcia-Molina}, title = {One Torus to Rule Them All: Multidimensional Queries in P2P Systems}, pages = {19-24}, ee = {http://webdb2004.cs.columbia.edu/papers/2-1.pdf}, booktitle = {Seventh International Workshop on the Web and Databases}, month = Jun, year = 2004, crossref = {conf/webdb/2004} }  ©2005 Association for Computing Machinery |
