Building and Querying a P2P Virtual World

Authors:
Egemen Tanin;Aaron Harwood;Hanan Samet;Deepa Nayar;Sarana Nutanong
Affiliations:
NICTA Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Australia;NICTA Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Australia;Department of Computer Science, Center for Automation Research, Institute for Advanced Computer Studies, University of Maryland at College Park, USA;NICTA Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Australia;NICTA Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Australia
Venue:
Geoinformatica
Year:
2006

Citing 26
Cited 1

Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures

The design and analysis of spatial data structures
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Multidimensional binary search trees used for associative searching

Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
LH*G: A High-Availability Scalable Distributed Data Structure By Record Grouping

IEEE Transactions on Knowledge and Data Engineering
Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Filter Trees for Managing Spatial Data over a Range of Size Granularities

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Accurate Estimation of the Cost of Spatial Selections

ICDE '00 Proceedings of the 16th International Conference on Data Engineering
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility

HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Depth-First K-Nearest Neighbor Finding Using the MaxNearestDist Estimator

ICIAP '03 Proceedings of the 12th International Conference on Image Analysis and Processing
Peer-to-Peer Spatial Queries in Sensor Networks

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Index-driven similarity search in metric spaces (Survey Article)

ACM Transactions on Database Systems (TODS)
One torus to rule them all: multi-dimensional queries in P2P systems

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
SWAM: a family of access methods for similarity-search in peer-to-peer data networks

Proceedings of the thirteenth ACM international conference on Information and knowledge management
A serverless 3D world

Proceedings of the 12th annual ACM international workshop on Geographic information systems
A Distributed Quadtree Index for Peer-to-Peer Settings

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Online balancing of range-partitioned data with applications to peer-to-peer systems

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A scalable nearest neighbor search in p2p systems

DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Distributed and scalable similarity searching in metric spaces

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
P2PR-Tree: an R-tree-based spatial index for peer-to-peer environments

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology

Spatio-temporal database research at the University of Melbourne

ACM SIGMOD Record

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, and, in this paper, we demonstrate how this limitation can be bridged by indexing and querying a 3D virtual-world on a dynamic distributed network. We present an algorithm for 3D range queries as well as an algorithm for nearest neighbor queries. We also show how to build such a complex application from the ground level of a P2P routing algorithm.