XML document tree sequencing method

Abstract

The invention discloses a method for sequencing the expandable label language file tree, belonging to the network data processing technique. First, browsing the expandable label language tree; using depth priority browse method to evaluate each note of file tree with one unique serial number, while said serial numbers are continuous; using symbol sequence i (Fi) to express the information of i-th note, while Fi is the serial number of father note of i-th noter; the last sequence is: 1(F1)2(F2)- 3(Fi)-n(Fn), while the file notes of sequence are sequenced from 1 to n. The invention has the advantages that: it can keep the father-son relationship between notes and the order sequence between brother nodes; and it can uniformly treat the non-leaf note and the leaf note of expandable label language file tree; the size of invention is linear related to the size of expandable label language file tree, to save the memory space.

Description

technical field [0001] The invention relates to a serialization method of an extensible markup language document tree, which belongs to the technical field of network data processing. Background technique [0002] With the emergence of a large amount of eXtensible Markup Language (eXtensible Markup Language) data, eXtensible Markup Language is no longer simply to enhance the ability of applications to interpret and manipulate documents obtained from the Internet. It has gradually become an online data exchange and The de facto standard of data representation, and how to effectively store and query these XML data has become a hot spot in academic research. At present, one of the effective ways to solve the query problem of XML document tree is to serialize the XML document tree into a node label sequence of XML document, and then use the method of sequence matching (similar to string matching) to solve the query problem of XML documents. This is the so-called sequence match...

AI Technical Summary

Problems solved by technology

[0005] Currently, the biggest problem with Prufer sequences is that connectivity cannot be guaranteed, that is, the XML document subtrees corresponding to sequences are not connected, and Prufer sequences do not maintain the parent-child relationship between nodes in the sequence

In addition, the Prufer sequence can only process the non-leaf nodes of the XML document tree, and does not unify the complete processing of non-leaf nodes and leaf nodes, which brings inconvenience to many practical applications.

Images