Method for publishing tree -type structure database as distributed XML database

Abstract

The invention relates to a method to publish a tree-structure database as a distribution XML database. The method mainly includes the following steps: firstly splitting the tree-structure database into a plurality of sub-trees by a method of setting splitting mark and set the physical location of the sub-trees publication and the description information of the sub-trees; then, for each sub-tree, extracting the node inside and the root node of the adjacent sub-trees and the nodes which are in the path from the root node to the sub-trees node; lastly, conducting XML encoding for the relevant forms of the nodes and the relevant records in the forms and stores in the reset physical location. The method transfers the operation to different computing resources under the premise of maintaining the original tree structure relation, even to the local computing resource of the end-user, and the special XML encoding compresses the label redundant as much as possible, thus reducing the maintenancecost for future technical update.

Description

technical field [0001] The invention relates to a method for releasing a database, in particular to a method for publishing a tree structure database as a distributed XML database. Background technique [0002] Compared with the linear table structure, the algorithm complexity of the tree data structure query increases, and the calculation operation consumes more server resources. Due to the limitations of the tree data structure query algorithm, the query operation often limits the depth and breadth of the tree, and the efficiency of the query results is often not high. [0003] As an example, at present, when querying some classified directories on the Internet, it is often only possible to query downwards layer by layer, which is limited by the tree structure query algorithm. If we find a category through the first click (query), click on this category again, and find that there are still a few subcategories under this category, then these two queries are not the most id...

AI Technical Summary

Problems solved by technology

[0007] However, if you want to use XML to store large-capacity information, such as tabular data in relational databases, and these data are processed by software in most cases, in this case, the simplicity of markup is a worthwhile consideration. The problem

Otherwise, a large amount of label redundancy will be generated in the result, reducing storage efficiency and increasing network data transmission volume

Images