Multi-Dimensional Prefix Search in P2P Networks

We present a simple yet novel technique for prefix search in P2P networks. The idea is to extract characters and their position information in a keyword to index objects. Our index scheme can achieve quite balanced loads, avoid hop-spots and single point of failure, reduce storage and maintenance costs, and offer some ranking mechanisms for matching objects. We use 2,412,613 CD records collected in FreeDB (http://freedb.org) as experimental dataset to test our index scheme.