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
System support for keyword-based search in structured peer-to-peer systems
System support for keyword-based search in structured peer-to-peer 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
Distributed pattern matching: a key to flexible and efficient P2P search
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
There have been many studies on the design of P2P systems for effective keyword search. This paper proposes and tests technique to reduce network traffic due to many inverted lists forwarded in carrying out query containing multi-keywords in DHT base structured p2p network. Many of inverted lists, forwarded inter-medium, are discarded regardless of search result. This paper proposes Distance and Smart-bloom filter to diminish those unrelated inverted lists. Distance can correctly distinguish document not containing a certain keyword. Smart-bloom filter with low false positive rate can sort out document with a high chance of including certain keyword among inverted lists selected by distance. Ultimately large amount of unrelated inverted lists can be diminished. The performance of Distance and Smart-bloom filter was tested through simulation and the traffic was decreased by 67%.