Databases, Information Systems, and Peer-to-Peer Computing

Volume 4125 of the series Lecture Notes in Computer Science pp 259-272

Keyword Searching in Structured Overlays Via Content Distance Addressing

  • Yu-En LuAffiliated withUniversity of Cambridge Computer Laboratory
  • , Steven HandAffiliated withUniversity of Cambridge Computer Laboratory
  • , Pietro LióAffiliated withUniversity of Cambridge Computer Laboratory

* Final gross prices may vary according to local VAT.

Get Access


We present a novel keyword search scheme for file sharing applications based on content distance addressing (CDA). Through CDA, we are able to associate node IDs with content distances and thus reduce several complex keyword queries to routing problems on structured overlays. Unlike traditional approaches, we require neither set intersection process nor replication for query processing as a result of content distance addressing. In this paper, we present the design and theoretical analysis of CDA for keyword search as well as simulation results using real world parameters.