In XML databases, the indexing process is based on a labelling or numbering scheme and generally used to label an XML document to perform an XML query using the path node information. Moreover, a labelling scheme helps to capture the structural relationships during query processing without the need to access the physical document. Two of the main problems for labelling XML schemes are duplicated labels, and cost efficiency regarding labelling time and size. This research presents a novel dynamic XML labelling scheme, called the Pentagonal Scheme, in which data are represented as ordered XML nodes with relationships between them. The update of these nodes from large-scale XML documents has been widely investigated and represents a challenging research problem, as it means relabelling a whole tree. Our algorithms provide an efficient dynamic XML labelling scheme to support data updates without duplicating labels or relabelling old nodes. Our work evaluates the labelling process in terms of size and time, and evaluates the labelling scheme’s ability to handle several insertions in XML documents. The findings indicate that the Pentagonal scheme shows a better initial labelling time performance than compared schemes. Particularly when using large size XML datasets. Moreover, it efficiently supports random skewed updates, has fast calculations and uncomplicated implementations to thus handle updates efficiently. In addition, the comparable evaluation of the query response time and relationships in Pentagonal scheme can be efficiently performed without presenting any extra cost. It was for this reason that our labelling scheme achieved the goal of this research.

在XML数据库中，索引过程基于标记或编号方案，通常用于标记XML文档以使用路径节点信息执行XML查询。此外，标记方案有助于在查询处理期间捕获结构关系，而无需访问物理文档。标记XML方案的两个主要问题是重复的标记以及有关标记时间和大小的成本效率。这项研究提出了一种新颖的动态XML标记方案，称为五角形方案，其中数据表示为有序XML节点，它们之间具有关系。从大规模XML文档更新这些节点已被广泛研究，并且代表着具有挑战性的研究问题，因为这意味着重新标记整个树。我们的算法提供了有效的动态XML标记方案，以支持数据更新，而无需重复标记或重新标记旧节点。我们的工作根据大小和时间评估标记过程，并评估标记方案处理XML文档中多次插入的能力。研究结果表明，五角形方案比对比方案显示出更好的初始标记时间性能。特别是在使用大型XML数据集时。而且，它有效地支持随机偏斜的更新，具有快速的计算和简单的实现方式，从而可以有效地处理更新。另外，五角形方案中查询响应时间和关系的可比评估可以有效地执行，而不会产生任何额外成本。