We present a novel approach for keyword searching for file sharing applications based on a simple hash function and extension to current Distributed Hash Tables (DHT) topology. Depart from standard hash methods on DHT systems, our approach is to develop a locality preserving hash function so that objects containing the same keyword tend to have similar hash values under Hamming metric. We show that this hash function is locality preserving and proposes the embedding of keyword edges to facilitate query processing. As such, we reduce several class of problems in keyword search into a network multicast problem.