![]() |
CiteULike | ![]() |
dmeister's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
One torus to rule them all: Multi-dimensional queries in p2p systemsIn In WebDB ’04: Proceedings of the 7th International Workshop on the Web and Databases (2004)
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractPeer-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 spatialdatabase 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. 1.
BibTeX record
RIS record