Multi-Dimensional Prefix Search in P2P Networks

P
P2P
2006
Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06)
Abstract - Multi-Dimensional Prefix Search in P2P Networks

	This Article
	PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Yuh-Jzer Joung Articles by Li-Wei Yang

Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06)

Multi-Dimensional Prefix Search in P2P Networks (PDF)

Cambridge, United Kingdom

September 06-June 08

ISBN: 0-7695-2679-9

	ASCII Text	x
	Yuh-Jzer Joung, Li-Wei Yang, "Multi-Dimensional Prefix Search in P2P Networks," Peer-to-Peer Computing, IEEE International Conference on, pp. 67-68, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), 2006.

	BibTex	x
	@article{ 10.1109/P2P.2006.24, author = {Yuh-Jzer Joung and Li-Wei Yang}, title = {Multi-Dimensional Prefix Search in P2P Networks}, journal ={Peer-to-Peer Computing, IEEE International Conference on}, volume = {0}, year = {2006}, isbn = {0-7695-2679-9}, pages = {67-68}, doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2006.24}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Peer-to-Peer Computing, IEEE International Conference on TI - Multi-Dimensional Prefix Search in P2P Networks SN - 0-7695-2679-9 SP67 EP68 A1 - Yuh-Jzer Joung, A1 - Li-Wei Yang, PY - 2006 KW - null VL - 0 JA - Peer-to-Peer Computing, IEEE International Conference on ER -

Yuh-Jzer Joung, National Taiwan University, Taiwan

Li-Wei Yang, National Taiwan University, Taiwan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2006.24

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.