Title:
Efficient multi-keyword search over p2p web

Keywords:
multi-keyword search

Abstract:
... a single keyword search problem. Other than single keyword search, multi- -keyword search is quite popular and useful in many real applications. Simply ... traffic, we would like to use BF encoding to handle multi- -keyword search. .</p> <p>Applying BF is not difficult, but how to get ... argue that the intersection order between sets is important for multi- -keyword search. . Thus, we design optimal order strategies based on BF ...

Full Text:
Microsoft Word - at155w-chen-revised.docEfficient Multi- -keyword Search over P2P Web Hanhua Chen, Hai Jin School of Computer ... a single keyword search problem. Other than single keyword search, multi- -keyword search is quite popular and useful in many real applications. Simply ... traffic, we would like to use BF encoding to handle multi- -keyword search. . Applying BF is not difficult, but how to get ... argue that the intersection order between sets is important for multi- -keyword search. . Thus, we design optimal order strategies based on BF ... ? distributed applications. General Terms: Algorithms, Design. Keywords: P2P, DHT, Multi- -keyword Search, , Bloom Filter. 1. INTRODUCTION With the emergence of peer-to-peer ... existing DHT lookups. However, compared with the single keyword search, multi- -keyword search is much more popular and useful in many real world ... more popular and useful in many real world applications. For multi- -keyword search, , the simple solution which merges the results of each ...
... analysis. Indeed, the intersection order between sets is important for multi- -keyword search. . We design optimal order strategies based on BF for ... with the identifier of the document in the posting list. Multi- -keyword search is performed by first locating the position of the DHT ...
... communication cost. Another scheme performs a distributed intersection operation for multi- -keyword search. . Based on the global single term based inverted index ... global single term based inverted index built on DHT, the multi- -keyword search looks up the sets for different keywords from multiple peers ... [11] has shown that the term-set-based indexing is efficient for multi- -keyword search across the wide area network. The major drawback of term-set-based ... focus on how to optimize the communication cost of DHT-based multi- -keyword search using an optimal BF. We then describe the optimization strategies ... a BF for distributed intersection and union required by the multi- -keyword search. . When a query comes, peers can minimize the communication ... that represents more virtual hosts. 3.2 Minimizing Communication Cost for Multi- -keyword Search Before we discuss the mechanism for reducing the communication cost ... we discuss the mechanism for reducing the communication cost for multi- -keyword search, , we introduce the following concepts. 1) Observations on user ... queries consist of at least two terms. This indicates that multi- -keyword search is quite common in web content searching. 2) Bloom Filter: ...
... ? (2) 3.2.1 ?And? query A common solution for a multi- -keyword search needs conducting a distributed intersection operation in a wide area ...
... then discuss the design of our simulator for P2P Web multi- -keyword search. . 4.1 Web Data Collection There has been no standard ...
... by our strategies with the baseline approach. The baseline for multi- -keyword search
... performance. 6. CONCLUSIONS In this paper we proposed an efficient multi- -keyword search mechanism over P2P Web environments. We showed mathematically that the ... Web environments. We showed mathematically that the communication cost for multi- -keyword search in P2P Web using BF is determined by the popularities ... work, and wide deployment of this design will significantly improve multi- -keyword search for P2P Web. 7. ACKNOWLEDGEMETS This work was supported in ...

Keywords:
multi-keyword search

Abstract:
... scheme with similarity-based ranking to address this problem. To support multi- -keyword search and search result ranking, we propose to build the search ...

Full Text:
... (MTS) scheme with similarity-based ranking toaddress this problem. To support multi- -keyword search andsearch result ranking, we propose to build the search in-dex ...
... failedto yield more accurate search result, compared to the state-of-the-art multi- -keyword search over plaintext. Thus, thequest for secure data search mechanisms that ... the same ?exibility and searchresult accuracy as the existing state-of-the-art multi- -keyword search over plaintext.2. We propose a randomization (phantom terms) approachin the ...
... encrypted cloud data search scheme which notonly supports the e?ective multi- -keyword search functionali-ty, but also, by adoption of the vector space model, ...