pdf

A new multi-keyword search mechanism based on DHT

  • 2013-09-22
  • 198.42KB
  • Points it Requires : 2

Based on the structured P2P routing algorithm Kademlia, this paper proposes a new DHT (Distributed Hash Table) mechanism that supports multi-keyword search: kNN-Kad (K Neareast Neighbor Kademlia), which enables the Kademlia network to efficiently perform topic search and multi-keyword search. The kNN-Kad mechanism includes a resource publishing algorithm and a multi-keyword search algorithm. Through simulation, the search time complexity, communication volume, and maintenance cost are analyzed. The results show that the mechanism has higher comprehensive performance than existing algorithms.

unfold

You Might Like

Uploader
lamas
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×