Yarqs: Yet Another Range Queries Schema in DHT Based P2P Network

Range query in DHT based P2P network is a hot topic in recent researches. The hashing function in DHT protocols makes the data hard to keep their original order relationship. Hence range queries for such networks become difficult. This paper presents the design of Yarqs-a new schema to achieve range queries in DHT based P2P networks. By using the inherent characteristics of DHT based networks, Yarqs catches the data pass the nodes and organizes them as a cache network. The range queries are deployed over the cache network. Yarqs does not change the design of the DHT overlay and builds the architecture for range queries by using the historical DHT queries data. Yarqs supports inherent load balancing. We also study the performance of Yarqs in evaluation section. The experiments to check the influences of different parameters of Yarqs are deployed and analyzed.