Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
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
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
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
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
| Hi-index | 0.00 |
This study proposes a keyword search technique to reduce the traffic caused when applying Distributed Hash Table(DHT) base P2P systems as middleware for ubiquitous computing application in order to ensure effective search in Mobile Ad-hoc Network (MANET). For query with many keywords, nodes should be visited as much as the number of keywords and many posting files(inverted list) should be sent to the next node and these posting files bring about traffic. To solve this problem firstly the size of inverted list nothing to do with search result was diminished using distance of the hash values obtained by hashing keywords within document; secondly the positive false rate of bloom filter can be lowered since the size of posting file to be hashed can be reduced through distance-based bloom filter technique and by doing this the size of inverted list to be sent can be reduced as well. This technique is based on Plaxton's approach and the proposed technique was evaluated through a series of tests.