Keyword search in DHT-based peer-to-peer networks

Authors:
Byungryong Kim;Kichang Kim
Affiliations:
Department of Computer and Science Engineering, Inha University, Incheon, Korea;School of Information and Communication Engineering, Inha University, Incheon, Korea
Venue:
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Year:
2007

Citing 12
Cited 0

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Peer-to-peer information retrieval using self-organizing semantic overlay networks

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Keyword fusion to support efficient keyword-based search in peer-to-peer file sharing

CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol

IEEE Transactions on Parallel and Distributed Systems
Hybrid global-local indexing for effcient peer-to-peer information retrieval

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Efficient peer-to-peer keyword searching

Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Making peer-to-peer keyword searching feasible using multi-level partitioning

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

DHT (Distributed Hash Table) provides a very effective and reliable search scheme in P2P networks. However, when the search involves a multiplekeyword query, it suffers heavy network traffic due to the passing around of a large inverted list among P2P nodes. In this paper, we propose Distance-Based Pruning technique to cut down the size of the inverted list considerably. It utilizes the concept of distance between keywords in the query and removes those entries in the inverted list that are going to be dropped sooner or later. We prove this prediction is accurate and effective such that it reduces the size of the inverted list by 29%.