Range-based labeling scheme allows determining the ancestor relation between two nodes in constant time. One disadvantage is that relabeling is unavoidable when arbitrary insertions are allowed. In this paper, one practical algorithm is presented to extend range-based scheme to accommodate arbitrary insertions without relabeling by combining with prefix-based labeling scheme. Range allocation methods to improve the performance of the labeling method are also considered.