Hashing Spatial Content over Peer-to-Peer Networks

Abstract

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.