1. A computer implemented method, the method comprising: generating a segment tree on multiple participating computing devices (peers) comprising one or more memory units storing computer-executable instructions executable on one or more processors, the generated segment tree comprising multiple nodes, each node of the multiple nodes having a respective node interval [s, t] of multiple node intervals, s and t being indexes to a sorted array of possible endpoints of the node intervals, each node corresponding to a particular computing device of multiple participating computing devices (peers) in an overlay network, each node interval being assigned to a peer of the peers to provide a connection between node interval structural information of the segment tree and an underlying structure-less routing substrate associated with the overlay network; and distributing the segment tree across the peers for query operations using a Distributed Hash Table (DHT) interface, wherein the query operations comprise cover query operations to locate each range of multiple ranges currently in the network that cover a given key and further wherein the query operations comprise range query operations with an associated range of [s, t] to find each key of multiple keys in a certain range over the network, and wherein the method further comprises: splitting the range with a range splitting algorithm such that the range is split into a union of minimum node intervals associated with the segment tree; and retrieving one or more keys maintained by corresponding peers in the network using the union of minimum node intervals a DHT get operation; and wherein a final query result is a union of the one or more keys returned.