Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
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
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 |
Both ubiquitous computing and mobile ad-hoc networks (MANET) have recently attracted a lot of attention in the research community as well as the industry. Both the domains share certain similarities, primarily the fact that both are instances of self-organizing decentralized systems. Distributed hash table (DHT) provides a very effective and reliable search scheme in Both Networks. However, when the search involves query consist of a set of common words, it suffers heavy network traffic due to the passing around of a large inverted list among nodes. In this paper, we suggest a technique based on the concept of distance between keywords that can remove irrelevant indices from the list. 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.