Using a distributed quadtree index in peer-to-peer networks

Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries and retrieve complete files. However, future more data intensive applications, such as P2P auction networks, P2P job-search networ...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The VLDB journal Ročník 16; číslo 2; s. 165 - 178
Hlavní autoři: Tanin, Egemen, Harwood, Aaron, Samet, Hanan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Heidelberg Springer 01.04.2007
Témata:
ISSN:1066-8888, 0949-877X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries and retrieve complete files. However, future more data intensive applications, such as P2P auction networks, P2P job-search networks, P2P multiplayer games, will require the capability to respond to more complex queries such as range queries involving numerous data types including those that have a spatial component. In this paper, a distributed quadtree index that adapts the MX-CIF quadtree is described that enables more powerful accesses to data in P2P networks. This index has been implemented for various prototype P2P applications and results of experiments are presented. Our index is easy to use, scalable, and exhibits good load-balancing properties. Similar indices can be constructed for various multidimensional data types with both spatial and non-spatial components.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1066-8888
0949-877X
DOI:10.1007/s00778-005-0001-y