tree
Click on the red underlined text to get to the source
... DOMAIN NAME SPACE and RESOURCE RECORDS, which are
specifications for a tree structured name space and data
associated with the names. Conceptually, each node ...
... node and leaf
of the domain name space tree names a set of information, and
query operations are attempts to extract specific types of
...
... NAME SERVERS are server programs which hold information about
the domain tree's structure and set information. A name
server may cache structure or set information about any part
...
... cache structure or set information about any part
of the domain tree, but in general a particular name server
has complete information about a subset of the domain ...
... and pointers to other name servers that can be used to lead to
information from any part of the domain tree. Name servers
know the parts of the domain tree ...
... tree. Name servers
know the parts of the domain tree for which they have complete
information; a name server is said to be an AUTHORITY ...
... through a simple procedure or OS call to a local resolver.
The domain space consists of a single tree and the user can
request information from any section of the tree.
...
... domain space consists of a single tree and the user can
request information from any section of the tree.
...
... composed of an unknown number of name servers. Each name
server has one or more pieces of the whole domain tree's data,
but the resolver views each of these databases as essentially
...
...
The domain name space is a tree structure. Each node and leaf on the
tree corresponds to a resource set (which may be empty). The ...
... space is a tree structure. Each node and leaf on the
tree corresponds to a resource set (which may be empty). The domain
system makes no distinctions between the uses of the interior nodes ...
... is the list of the labels on the path from the
node to the root of the tree. By convention, the labels that compose a
domain name are printed or read left to right, from the most specific
(lowest, farthest from the ...
... DNS technical specifications do not mandate a
particular tree structure or rules for selecting labels; its goal is to
be as general as possible, so that it can be used to build arbitrary
applications. In particular, the system was designed so that the name
space ...
... of implied semantics should be left open to be used for the problem at
hand, and that different parts of the tree can have different implied
semantics. For example, the IN-ADDR.ARPA ...
... host table. The political
decisions about the top levels of the tree originated in RFC-920.
Current policy for the top levels ...
... The following figure shows a part of the current domain name space, and
is used in many examples in this RFC. Note that the tree is a very
small subset of the actual name space.
...
... The owner name is often implicit, rather than forming an integral part
of the RR. For example, many name servers internally form tree or hash
structures for the name space ...
... will typically support one or more zones, but this
gives it authoritative information about only a small section of the
domain tree. It may also have some cached non-authoritative data about
other parts of the tree. The name server ...
... domain tree. It may also have some cached non-authoritative data about
other parts of the tree. The name server marks its responses to queries
...
... , the separate
classes can be thought of as an array of parallel namespace trees. Note
that the data attached to nodes will be different for these different
...
... domain
name, for which it is authoritative, and all of the nodes in a
particular zone are connected. Given, the tree structure, every zone
has a highest node which is closer to the root ...
... a subtree. Once an organization controls its own zone it can
unilaterally change the data in the zone, grow new tree sections
connected to the zone, delete existing nodes ...
... delegation of control. While there are no particular
technical constraints dealing with where in the tree this can be done,
there are some administrative groupings discussed in [RFC-1032] which
...
... algorithm assumes
that the RRs are organized in several tree structures, one for each
zone, and another for the cache:
...
... name server is shown in parentheses
at the point in the domain tree at which is assumes control.
...