1. A method at least partially implemented by a computer, the method comprising: generating a 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.