Siva - The IPFS Search Engine
Siva - The IPFS Search Engine
复制标题
DOI：
10.1109/candar.2019.00026
复制
发表时间：
2019-07
期刊：
影响因子：
--
通讯作者：
Nawras Khudhur;S. Fujita
中科院分区：
文献类型：
--
作者：
Nawras Khudhur;S. Fujita
最近，星际文件系统（IPFS）作为一种克服当前Web的弱点（如单点故障和政府的任意控制）的方法引起了相当大的关注。存储在IPFS中的每个文件都与作为逻辑地址的唯一加密散列（CID）相关联，以使用户能够在不知道网络地址的情况下获取文件的内容。在本文中，我们为IPFS设计了一个分散的搜索引擎，它可以快速返回与给定关键字集合相关联的CID列表。该方法的一个关键思想是将关键字和CID之间的关联存储在IPFS中使用的分布式哈希表（DHT）中，并利用结果缓存来加速部分重复查询的处理。此外，我们还使用了一个Bloom filter的变体来快速检查结果缓存的可用性。通过仿真对所提出的方法的性能进行了评估。仿真结果表明，在1000和2000个节点的网络中，加入结果缓存后，响应查询的平均时间为1.8s，分别减少了83%和81%。
Recently, InterPlanetary File System (IPFS) has attracted considerable attention as a method to overcome the weaknesses of the current Web such as the single point of failure and an arbitrary control by the government. Each file stored in IPFS is associated with a unique cryptographic hash (CID) as a logical address to enable users to acquire the content of the file without being aware of the network address. In this paper, we design a decentralized search engine for IPFS which quickly returns a list of CIDs associated with a given collection of keywords. A key idea of the proposed method is to store the association between keywords and CIDs in the Distributed Hash Table (DHT) used in IPFS, and to utilize a result cache to accelerate the processing of partially duplicated queries. In addition, we use a variant of Bloom filter to quickly check the availability of the result cache. The performance of the proposed method is evaluated by simulation. The simulation results indicate that it takes 1.8s on average to respond to a query in a network of 1000 and 2000 nodes reduced by 83%, 81% respectively when the result cache is added to the search engine.