loading...
Multi-Dimensional Prefix Search in P2P Networks
Cambridge, United Kingdom September 06-June 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2006.24Sixth IEEE International Conference o ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yuh-Jzer Joung, National Taiwan University, Taiwan
Li-Wei Yang, National Taiwan University, Taiwan
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.
Citation:
Yuh-Jzer Joung, Li-Wei Yang, "Multi-Dimensional Prefix Search in P2P Networks," p2p, pp.67-68, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.