Keyword Searching in Structured Overlays Via Content Distance Addressing

  • Yu-En Lu
  • Steven Hand
  • Pietro Lió
Conference paper

DOI: 10.1007/978-3-540-71661-7_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4125)
Cite this paper as:
Lu YE., Hand S., Lió P. (2007) Keyword Searching in Structured Overlays Via Content Distance Addressing. In: Moro G., Bergamaschi S., Joseph S., Morin JH., Ouksel A.M. (eds) Databases, Information Systems, and Peer-to-Peer Computing. Lecture Notes in Computer Science, vol 4125. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Yu-En Lu
    • 1
  • Steven Hand
    • 1
  • Pietro Lió
    • 1
  1. 1.University of Cambridge Computer Laboratory 

Personalised recommendations