Hashing Spatial Content over Peer-to-Peer Networks
AuthorHarwood, Dr Aaron; Tanin, Dr Egemen
Source TitleProceedings, Australian Telecommunications, Networks and Applications Conference
PublisherPublished on CD-ROM, ISBN 0-646-42229-4
AffiliationEngineering: Department of Computer Science and Software Engineering
Document TypeConference Paper
CitationsHarwood, Dr Aaron and Tanin, Dr Egemen (2003) Hashing Spatial Content over Peer-to-Peer Networks, in Proceedings, Australian Telecommunications, Networks and Applications Conference, Melbourne.
Access StatusOpen Access
The Internet has become the common medium for contentdistribution. Searching content using keywords is well-known. Butthere are many shortcomings to it. Users cannot search within thecontent and on many of the attributes of the content, i.e., other thanits name. Content is also becoming increasingly decentralized. Newmechanisms allowing access to complex distributed content isneeded. We introduce a hashing-based method for accessing complexcontent over large dynamic networks such as peer-to-peer networks,which uses distributed hash tables in a novel way. In particular, weare interested in spatial content that is becoming popular indatabases. Our method is scalable, addressing the needs of todaysnetworks.
Keywordspeer-to-peer spatial queries
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References