2. The computer-based method of claim 1 , wherein inserting a node into an existing tree does not require change to existing node identifiers.
1. A computer-based method comprising the steps of: a. converting a mark-up language document to a logical tree-based representation comprising a plurality of nodes, each node other than a root node having a local identifier, b. choosing an initial base length of at least one byte with which to encode local identifiers of said nodes, c. sequentially encoding each local identifier other than said root node in hexadecimal notation starting with an initial hexadecimal value and incrementing the initial hexadecimal value by said initial base length, d. adaptively extending said initial base length by at least one additional byte upon exhausting all incremental hexadecimal values based on said initial base length, e. encoding at least one local identifier other than said root node and a node not encoded in step (c) based on said extended base length, f. assigning node identifiers to said plurality of nodes other than said root node by concatenating encoded values of local identifiers of all nodes along a path from said root node to a node to which a node identifier is currently being assigned, and g. outputting and storing said node identifiers associated with said nodes of said mark-up language document in computer storage.