Keyword Searching in Structured Overlays Via Content Distance Addressing
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.
Unable to display preview. Download preview PDF.