One torus to rule them all
Top Cited Papers
- 17 June 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
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 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.Keywords
This publication has 10 references indexed in Scilit:
- Simple Efficient Load Balancing Algorithms for Peer-to-Peer SystemsPublished by Springer Nature ,2005
- Peer-to-peer support for massively multiplayer gamesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- A stochastic process on the hypercube with applications to peer-to-peer networksPublished by Association for Computing Machinery (ACM) ,2003
- Novel architectures for P2P applicationsPublished by Association for Computing Machinery (ACM) ,2003
- A scalable content-addressable networkPublished by Association for Computing Machinery (ACM) ,2001
- ChordPublished by Association for Computing Machinery (ACM) ,2001
- A performance analysis of alternative multi-attribute declustering strategiesPublished by Association for Computing Machinery (ACM) ,1992
- Linear clustering of objects with multiple attributesPublished by Association for Computing Machinery (ACM) ,1990
- Data placement in BubbaPublished by Association for Computing Machinery (ACM) ,1988
- A class of data structures for associative searchingPublished by Association for Computing Machinery (ACM) ,1984