@article {16846,
	title = {Using a distributed quadtree index in peer-to-peer networks},
	journal = {The VLDB Journal},
	volume = {16},
	year = {2007},
	month = {2007/04//},
	pages = {165 - 178},
	abstract = {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.},
	keywords = {Distributed data structures, peer-to-peer networks, quadtrees, spatial data structures},
	isbn = {1066-8888},
	doi = {10.1007/s00778-005-0001-y},
	url = {http://dx.doi.org/10.1007/s00778-005-0001-y},
	author = {Tanin,Egemen and Harwood,Aaron and Samet, Hanan}
}
