Multi-Attribute and Range Query for IPFS

Peer-to-peer networks, such as IPFS, adopt the distributed hash table (DHT) to find contents efficiently. IPFS uses Kademlia DHT as a routing scheme to effciently lookup any content with CID (content ID). However, due to the completely matching nature of DHT, IPFS does not have any scheme to lookup content with one or more attributes and ranges. Thus, it cannot be applied to a situation where several contents can be retrieved in sensed data such as an IoT network. In this paper, we propose a multi-attribute and range query scheme for Kademlia DHT in IPFS. In our proposal, several responsible nodes are used for maintaining a specifci attribute prefix and having CIDs for mapped contents. As a result, once a query arrives at a responsible node, any contents with mapped attributes are retrieved.