@conference {16877,
	title = {An efficient nearest neighbor algorithm for P2P settings},
	booktitle = {Proceedings of the 2005 national conference on Digital government research},
	series = {dg.o {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {21 - 28},
	publisher = {Digital Government Society of North America},
	organization = {Digital Government Society of North America},
	abstract = {New Peer-to-Peer (P2P) applications like P2P job-employee seeker networks and P2P virtual cities, for application domains such as collaborative urban planning and forming virtual communities, are about to emerge. An important component in these applications is spatial data, i.e., data with locational components. Many requests initiated on spatial data involve finding the spatial objects that are nearest to a query location. In this paper, we propose an efficient algorithm that finds the spatial objects that are nearest to a given query location on a P2P network in the order of their minimum distance to the query point. The proposed algorithm makes use of a distributed spatial index that does not rely on the use of a central server. The algorithm is designed to be more efficient by utilizing the parallel nature of the P2P network. A demonstration of the proposed algorithm was implemented as a prototype P2P application that finds events and places of interest in a city.},
	keywords = {geographic information systems, nearest neighbor query, peer-to-peer networks, quadtree, spatial data},
	url = {http://dl.acm.org/citation.cfm?id=1065226.1065237},
	author = {Tanin,Egemen and Nayar,Deepa and Samet, Hanan}
}
@conference {16885,
	title = {A serverless 3D world},
	booktitle = {Proceedings of the 12th annual ACM international workshop on Geographic information systems},
	series = {GIS {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {157 - 165},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interactivity for a large number of participants. Current solutions divide a large virtual-world into a few mutually exclusive zones, with each zone controlled by a different server, and/or limit the number of participants per server or per virtual-world. Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment (one peer is introduced to the system by each participant), however current P2P applications can only provide file sharing and other forms of relatively simple data communications. In this paper, we present a generic 3D virtual-world application that runs on a P2P network with no central administration or server. Two issues are addressed by this paper to enable such a spatial application on a P2P network. First, we demonstrate how to index and query a 3D space on a dynamic distributed network. Second, we show how to build such a complex application from the ground level of a P2P routing algorithm. Our work leads to new directions for the development of online virtual-worlds that we believe can be used for many government, industry, and public domain applications.},
	keywords = {distributed hash tables, peer-to-peer systems, spatial data, virtual-worlds},
	isbn = {1-58113-979-9},
	doi = {10.1145/1032222.1032246},
	url = {http://doi.acm.org/10.1145/1032222.1032246},
	author = {Tanin,Egemen and Harwood,Aaron and Samet, Hanan and Nutanong,Sarana and Truong,Minh Tri}
}
