.png){kind=icon}
返回
ECHO: Efficient Complex Query over DHT Overlays
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2015.10.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article we propose ECHO, a novel and lightweight solution that efficiently supports range queries over a ring-like Distributed Hash Table (DHT) structure. By implementing a tree-based index structure and an effective query routing strategy, ECHO provides low-latency and low-overhead query searches by exploiting the Tabu Search principle. Load balancing is also improved reducing the traditional bottleneck problems arising in upper level nodes of tree-based index structures such as PHT. Furthermore, ECHO copes with DHT churn problems as its index exploits logical information as opposed to static reference cache approaches or replication techniques. The performance evaluation results obtained using PeerSim simulator show that ECHO achieves efficient performance compared other solutions such as the PHI strategy and its optimized version which includes a query cache. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
Peer-to-peer
DHT
Range queries
Prefix trees
Distributed indexing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
查看更多机构
引用论文
分享收藏
Determining short-lived solid forms during phase transformations using molecular dynamics.png)
CrystEngComm
CrystEngCommIF0
PREAI
分享收藏 没有更多内容