Data Portal @ linkeddatafragments.org

Matches in ScholarlyData for { <https://w3id.org/scholarlydata/inproceedings/www2008/paper/155> ?p ?o. }

• 155 creator hai-jin.
• 155 creator hanhua-chen.
• 155 creator lei-chen.
• 155 creator lionel-ni.
• 155 creator yunhao-liu.
• 155 type InProceedings.
• 155 label "Efficient Multi-keyword Search over P2P Web".
• 155 sameAs 155.
• 155 abstract "Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single key word search, multi-keyword search is quite popular and useful in many real applications. Simply using the solution for single key word search will require distributed intersection/union operations in wide area networks, leading to unacceptable traffic cost. As it is well known that Bloom Filter (BF) is effective in reducing traffic, we would like to use BF encoding to handle multi-keyword search. Applying BF is not difficult, but how to get optimal results is not trivial. In this study we show, through mathematical proof, that the optimal setting of BF in terms of traffic cost is determined by the global statistical information of keywords, not the false positive rate as claimed by previous methods. Through extensive experiments, we demonstrate how to obtain optimal settings. We further argue that the intersection order between sets is important for multi-keyword search. Thus, we design optimal order strategies based on BF for both "and" and "or" queries. To better evaluate the performance of this design, we conduct extensive simulations on TREC WT10G test collection and the query log of MSN search engine. Results show that our design significantly reduces the search traffic and latency of existing approach by 73.03% and 41.37%, respectively.".
• 155 hasAuthorList authorList.
• 155 hasTopic World_Wide_Web.
• 155 isPartOf proceedings.
• 155 keyword "Bloom Filter".
• 155 keyword "DHT".
• 155 keyword "Multi-keyword Search".
• 155 keyword "P2P".
• 155 title "Efficient Multi-keyword Search over P2P Web".