A method for administering a plurality of data records on a computer network, each data record of the plurality of data records comprising information associated with a name of a plurality of names, the computer network comprising a plurality of servers (150, 152, 154, 156, 158, 160, 162, 164, 169, 170, 172, 174, 176, 178, 180, 182), the method comprising: providing, to each of a subset (150, 152, 154, 156, 158, 160, 162, 164, 172, 176, 180) of the plurality of servers (150, 152, 154, 156, 158, 160, 162, 164, 169, 170, 172, 174, 176, 178, 180, 182), a copy of a data record of the plurality of data records, each of the plurality of servers (150, 152, 154, 156, 158, 160, 162, 164, 169, 170, 172, 174, 176, 178, 180, 182) having a threshold request rate; organizing the servers of the subset into a tree for disseminating updates to the data record, wherein one of the servers of the subset maintains a master copy of the data record and acts as the root of the tree, wherein the tree comprises a plurality of edges, each edge defining an update path between a pair of servers of the subset, the update path being usable to transmit an update of the data record from one server of the pair of servers to the other server of the pair of servers; characterized by determining whether a first server of the subset is receiving an excessive number of requests for information from the data record, and if the threshold request rate of the first server is exceeded; based on the determining step: identifying, by the first server, a second server of the plurality of servers (150, 152, 154, 156, 158, 160, 162, 164, 169, 170, 172, 174, 176, 178, 180, 182) that does not belong to the subset by comparing rates at which the requests for information from the data record are being received from servers that the first server is aware of and choosing the server as second server from which requests for information from the data record are being received at the highest rate; transmitting a copy of the data record from the first server to the second server so as to add the second server to the subset; and adding a new edge to the tree, the new edge defining an new update path between the second server and the first server, the new update path being usable to transmit updates of the data record from the first server to the second server wherein the servers of the subset have a parent-child relationship to one another with regard to updating their respective copies of the data record, and wherein each server of the subset has a node ID that is closer to a key number than any of its children. providing, to each of a subset (150, 152, 154, 156, 158, 160, 162, 164, 172, 176, 180) of the plurality of servers (150, 152, 154, 156, 158, 160, 162, 164, 169, 170, 172, 174, 176, 178, 180, 182), a copy of a data record of the plurality of data records, each of the plurality of servers (150, 152, 154, 156, 158, 160, 162, 164, 169, 170, 172, 174, 176, 178, 180, 182) having a threshold request rate; organizing the servers of the subset into a tree for disseminating updates to the data record, wherein one of the servers of the subset maintains a master copy of the data record and acts as the root of the tree, wherein the tree comprises a plurality of edges, each edge defining an update path between a pair of servers of the subset, the update path being usable to transmit an update of the data record from one server of the pair of servers to the other server of the pair of servers; characterized by determining whether a first server of the subset is receiving an excessive number of requests for information from the data record, and if the threshold request rate of the first server is exceeded; based on the determining step: identifying, by the first server, a second server of the plurality of servers (150, 152, 154, 156, 158, 160, 162, 164, 169, 170, 172, 174, 176, 178, 180, 182) that does not belong to the subset by comparing rates at which the requests for information from the data record are being received from servers that the first server is aware of and choosing the server as second server from which requests for information from the data record are being received at the highest rate; transmitting a copy of the data record from the first server to the second server so as to add the second server to the subset; and adding a new edge to the tree, the new edge defining an new update path between the second server and the first server, the new update path being usable to transmit updates of the data record from the first server to the second server identifying, by the first server, a second server of the plurality of servers (150, 152, 154, 156, 158, 160, 162, 164, 169, 170, 172, 174, 176, 178, 180, 182) that does not belong to the subset by comparing rates at which the requests for information from the data record are being received from servers that the first server is aware of and choosing the server as second server from which requests for information from the data record are being received at the highest rate; transmitting a copy of the data record from the first server to the second server so as to add the second server to the subset; and adding a new edge to the tree, the new edge defining an new update path between the second server and the first server, the new update path being usable to transmit updates of the data record from the first server to the second server wherein the servers of the subset have a parent-child relationship to one another with regard to updating their respective copies of the data record, and wherein each server of the subset has a node ID that is closer to a key number than any of its children.