.png){kind=icon}
返回
Enabling Dynamic Querying over Distributed Hash Tables
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2010.08.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Dynamic querying (DQ) is a search technique used in unstructured peer-to-peer (P2P) networks to minimize the number of nodes that is necessary to visit to reach the desired number of results In this paper we introduce the use of the DQ technique in structured P2P networks In particular we present a P2P search algorithm named DQ-DHT (Dynamic Querying over a Distributed Hash Table) to perform DQ-like searches over DHT-based overlays The aim of DQ-DHT is twofold allowing arbitrary queries to be performed in structured P2P networks and providing dynamic adaptation of the search according to the populanty of the resources to be located DQ-DHT has been particularly designed for use in those distributed environments like computational grids where it is necessary to support arbitrary queries for searching resources on the basis of complex criteria or semantic features This paper describes the DQ-DHT algorithm using Chord as basic overlay and analyzes its performance in comparison with DQ in unstructured networks (C) 2010 Elsevier Inc All rights reserved
Keyword:
Dynamic Querying
Distributed Hash Tables
Structured Peer to Peer networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems.png)
Optimization
OptimizationIF0
PREAI
分享收藏分享收藏
查看更多内容