Handling spatial data in distributed environments

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Kantere, V en
dc.contributor.author Sellis, T en
dc.date.accessioned 2014-03-01T02:51:06Z
dc.date.available 2014-03-01T02:51:06Z
dc.date.issued 2007 en
dc.identifier.uri http://hdl.handle.net/123456789/35365
dc.subject distributed indexing en
dc.subject P2P systems en
dc.subject routing en
dc.subject.other Distance metrics en
dc.subject.other Distributed environments en
dc.subject.other distributed indexing en
dc.subject.other Experimental studies en
dc.subject.other P2P system en
dc.subject.other Partial knowledge en
dc.subject.other routing en
dc.subject.other Spatial data en
dc.subject.other Spatial informations en
dc.subject.other Theoretical result en
dc.subject.other Data handling en
dc.subject.other Geographic information systems en
dc.subject.other Information systems en
dc.subject.other Overlay networks en
dc.subject.other Peer to peer networks en
dc.subject.other Search engines en
dc.title Handling spatial data in distributed environments en
heal.type conferenceItem en
heal.identifier.primary 10.1145/1341012.1341017 en
heal.identifier.secondary http://dx.doi.org/10.1145/1341012.1341017 en
heal.publicationDate 2007 en
heal.abstract Handling spatial data in distributed environments is an intriguing issue. We consider autonomous sites of an overlay network that are bound to specific spatial information. We assume that each site has partial knowledge of the overlay. Actually, the sites are aware of and can communicate with some other sites, according to the spatial data to which they are bound to. We are interested in routing queries about spatial data in such overlays, solely by exploiting local knowledge on sites, i.e. based on locality and directionality in space. For such a system, we explore the parameters that can make search for any spatial information realizable and efficient. In this work we focus on the management of grid-partitioned space. In such a system there is a necessity for a mechanism that provides even knowledge of space to each site of the overlay. We investigate two different ways to define the directions of grid knowledge on each site and we propose a new distance metric. Moreover, we consider a new locality function that is specifically constructed in order to achieve even knowledge of space towards all directions. Furthermore, we present an experimental study that evaluates the theoretical propositions and verifies the theoretical results. © 2007 ACM. en
heal.journalName GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems en
dc.identifier.doi 10.1145/1341012.1341017 en
dc.identifier.spage 11 en
dc.identifier.epage 18 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record