DBST: A Scalable Peer-to-Peer Distributed Information System Supporting Multi-Attribute Range Query

Although various techniques exist to build and utilize peer to peer (P2P) networks, researchers are working towards finding more flexible solutions in case of range queries. In this work, we propose our model DBST, which uses Binary Search Tree techniques to create and maintain the P2P network. Nonetheless, we are able to apply the same search technique for range query on top of structured overlays. Range query is undoubtedly a significant recipe to process large information transfer among most P2P networks. We contribute in this genre by providing a methodology for the creation of network, insertion of nodes, deletion techniques for nodes, management of routing table, searching through distributed keys, and searching in case of multiple attributes. Furthermore, we provide an explanation on fast searching strategy with the use of our proposed methodology. We propose an extended structure for the routing table, which enables long jumps to produce fast results. Our proposed model is effective for managing multi-attribute range queries and fast searching with cost of O(log n + k). This mechanism can be integrated with the conjunction of Internet of Things (IoT) applications and mobile P2P networks.