CN114969449A

CN114969449A - Metadata management method and system based on construction structure tree

Info

Publication number: CN114969449A
Application number: CN202210913442.XA
Authority: CN
Inventors: 吕灏; 祁纲; 韩国权; 李庆; 黄海峰; 陈小鹏; 李宝东; 赵琳琳
Original assignee: Taiji Computer Corp Ltd
Current assignee: Taiji Computer Corp Ltd
Priority date: 2022-08-01
Filing date: 2022-08-01
Publication date: 2022-08-30
Anticipated expiration: 2042-08-01
Also published as: CN114969449B

Abstract

The invention provides a metadata management method and a metadata management system based on a constructed structure tree, wherein the metadata management method comprises the following steps: acquiring total storage data corresponding to a user, and extracting metadata corresponding to each piece of storage sub-data; constructing a root dimension node of the structure tree according to the stored total data, and extracting identification information of all metadata to generate a root dimension identification group; classifying the identification information of all metadata for the first time to obtain primary sub-dimension identification groups, and establishing primary sub-dimension nodes corresponding to each primary sub-dimension identification group; performing secondary classification on the primary sub-dimension identification groups according to content information in the metadata to obtain secondary sub-dimension identification groups, and establishing secondary sub-dimension nodes corresponding to each secondary sub-dimension identification group; establishing a grandchild dimension node according to the primary child dimension identification group or the secondary child dimension identification; and generating the data call structure tree of the user according to the root dimension node, the primary child dimension node and/or the secondary child dimension node and the grandchild dimension node.

Description

Metadata management method and system based on construction structure tree

Technical Field

The invention relates to the technical field of data processing, in particular to a metadata management method and a metadata management system based on a constructed structure tree.

Background

The cloud storage system is generally composed of a plurality of sites distributed in a plurality of places, and provides services for users around the world through the internet, so that an application can use all data of the cloud storage system without paying attention to specific location information of files, so as to effectively manage data in the storage system, and a plurality of metadata in a data storage space must be uniformly and effectively managed.

In the prior art, when target data is called according to metadata, only one target data can be called through one metadata at a time, and a plurality of metadata cannot be called simultaneously according to one instruction, so that the overall processing of the data is realized. Therefore, a technical solution is needed to effectively manage metadata, so that a user can call target data corresponding to a plurality of metadata through one instruction when calling data, and data calling efficiency is improved.

Disclosure of Invention

The embodiment of the invention provides a metadata management method and a metadata management system based on a constructed structure tree, which can effectively manage metadata, so that a user can call target data corresponding to a plurality of metadata through one instruction when calling the data, and the data calling efficiency is improved.

In a first aspect of the embodiments of the present invention, a metadata management method based on a constructed structure tree is provided, including:

acquiring total storage data corresponding to a user, wherein the total storage data comprises at least one piece of sub-storage data, and extracting metadata corresponding to each piece of sub-storage data;

constructing a root dimension node of a structure tree according to the stored total data, extracting identification information of all metadata to generate a root dimension identification group, and setting the root dimension identification group and the root dimension node correspondingly;

extracting content information in metadata, classifying the identification information of all the metadata for the first time according to the content information of all the metadata to obtain primary sub-dimension identification groups, establishing primary sub-dimension nodes corresponding to each primary sub-dimension identification group, and setting the primary sub-dimension identification groups corresponding to the primary sub-dimension nodes;

extracting content information in metadata in each primary sub-dimension identification group, if the content information is judged to meet the reclassification condition, performing secondary classification on the primary sub-dimension identification groups according to the content information in the metadata to obtain secondary sub-dimension identification groups, establishing secondary sub-dimension nodes corresponding to each secondary sub-dimension identification group, and setting the secondary sub-dimension identification groups corresponding to the primary sub-dimension nodes;

if the primary child dimension identification group or the secondary child dimension identification group is judged not to meet the secondary classification condition, establishing a grandchild dimension node according to the primary child dimension identification group or the secondary child dimension identification, and correspondingly storing the grandchild dimension node and the metadata;

and generating the data call structure tree of the user according to the root dimension node, the primary child dimension node and/or the secondary child dimension node and the grandchild dimension node.

Optionally, in a possible implementation manner of the first aspect, the method further includes:

if the calling request of the user is judged to be received, selecting the corresponding data calling structure tree;

calling corresponding primary child dimension nodes, secondary child dimension nodes and grandchild dimension nodes in the structure tree by the data, and displaying corresponding content information;

if the primary child dimension node and/or the secondary child dimension node is selected by the user, counting grandchild dimension nodes connected with the primary child dimension node or the secondary child dimension node in the corresponding dimension to obtain a calling dimension node set;

if the user selects the grandchild dimensional node, taking the grandchild dimensional node as an independent dimensional node;

and performing fusion processing on all the calling dimension node sets and the independent dimension nodes to obtain a total calling set, sequentially calling according to metadata of all grandchild dimension nodes in the total calling set, determining a plurality of memory subdata, and sending the plurality of memory subdata to a user.

Optionally, in a possible implementation manner of the first aspect, if it is determined that the primary child dimension node and/or the secondary child dimension node is selected by the user, counting grandchild dimension nodes connected to the primary child dimension node or the secondary child dimension node in the corresponding dimension to obtain a calling dimension node set, where the counting includes:

taking the primary sub-dimension node or the secondary sub-dimension node selected by the user as a batch calling node;

if the batch calling node is judged to be a primary child dimension node, counting all grandchild dimension nodes vertically connected with the batch calling node to obtain a first dimension node set;

if the secondary child dimension nodes directly connected with the batch calling nodes exist, taking all the secondary child dimension nodes directly connected with the batch calling nodes as transfer calling nodes, and counting all grandchild dimension nodes directly connected with the transfer calling nodes to obtain a second dimension node set;

combining the first dimension node set and the second dimension node set to obtain a calling dimension node set;

and if the batch calling node is judged to be a secondary child dimension node, counting all grandchild dimension nodes directly connected with the batch calling node, and directly obtaining a calling dimension node set.

locking the primary sub-dimension node and/or the secondary sub-dimension node selected by the user so that the user cannot select the corresponding primary sub-dimension node and/or secondary sub-dimension node again;

and locking the grandchild dimensional nodes in the calling dimensional node set corresponding to the batch calling nodes so that the user cannot select the grandchild dimensional nodes in the calling dimensional node set.

Optionally, in a possible implementation manner of the first aspect, the extracting content information in the metadata, performing primary classification on the identification information of all the metadata according to the content information of all the metadata to obtain a primary sub-dimension identification group, establishing a primary sub-dimension node corresponding to each primary sub-dimension identification group, and setting the primary sub-dimension identification group and the primary sub-dimension node correspondingly includes:

the content information of the metadata comprises one or more of content format or content text;

if the content information selected by the user to classify the metadata is judged to be in a content format, classifying the identification information of all the metadata for the first time according to the content format to obtain a sub-dimension identification group;

if the content information selected by the user to classify the metadata is judged to be the content characters, classifying the identification information of all the metadata for the first time according to the content characters to obtain a sub-dimension identification group for the first time;

and establishing primary sub-dimension nodes corresponding to the primary sub-dimension identification group, and respectively connecting all the primary sub-dimension nodes with the root dimension node.

if the content information selected by the user to classify the metadata is judged to be a content format and content characters, a first primary sub-dimension identification group corresponding to the content format and a second primary sub-dimension identification group corresponding to the content characters are obtained;

constructing a first kind of primary sub-dimension node according to the first kind of primary sub-dimension identification group, and constructing a second kind of primary sub-dimension node according to the second kind of secondary sub-dimension identification group;

counting the number of the first kind of primary sub-dimension identification groups to obtain a first number, and counting the number of the second kind of primary sub-dimension identification groups to obtain a second number;

obtaining display width information of a display area where the structure tree is located, and calculating according to the first quantity, the second quantity and the display width information to obtain a node boundary;

and dividing the display area according to the node dividing line to obtain a first node area and a second node area, and respectively connecting all the primary sub-dimension nodes with the root dimension node.

Optionally, in a possible implementation manner of the first aspect, the obtaining display width information of a display area where the structure tree is located, and calculating according to the first number, the second number, and the display width information to obtain a node boundary includes:

acquiring preset edge reserved width information of the display area, and calculating according to the edge reserved width information, the first number, the second number and the display width information to obtain a horizontal node distance between any two adjacent primary sub-dimension nodes;

selecting two primary sub-dimension nodes corresponding to adjacent content formats and content characters as separation nodes, and taking a middle point formed by connecting the two separation nodes as a vertical division point of the node boundary to obtain a corresponding node boundary.

Optionally, in a possible implementation manner of the first aspect, obtaining edge reserved width information preset in the display area, and calculating according to the edge reserved width information, the first number, the second number, and the display width information to obtain a horizontal node distance between any two adjacent primary sub-dimension nodes includes:

the horizontal node spacing between any two adjacent primary sub-dimension nodes is calculated by the following formula,

wherein the content of the first and second substances,

for the horizontal pitch between any two adjacent primary sub-dimension nodes,

in order to present the width information,

the width information is reserved for the edges,

in the form of a first number of bits,

in order to be able to carry out the second number,

calculating a weight value for the distance;

displaying the horizontal node spacing, and if receiving confirmation information of a user, taking the calculated horizontal node spacing as a final horizontal node spacing;

and if the modification information of the user is received, taking the horizontal node spacing in the modification information as the final horizontal node spacing, and calculating a weight value for the spacing according to the horizontal node spacing of the modification information and the calculated horizontal node spacing.

Optionally, in a possible implementation manner of the first aspect, if modification information of a user is received, taking a horizontal node distance in the modification information as a final horizontal node distance, and training a weight value for distance calculation according to the horizontal node distance of the modification information and a calculated horizontal node distance, includes:

if the horizontal node distance of the modification information is larger than the calculated horizontal node distance, calculating to obtain an increase coefficient, and calculating a weight value of the distance according to the increase coefficient

Performing augmentation training to obtain trained interval calculation weight value

；

If the horizontal node distance of the modification information is judged to be smaller than the calculated horizontal node distance, calculating to obtain a reduction coefficient, and calculating a weight value of the distance according to the reduction coefficient

Performing reduction training to obtain trained interval calculation weight value

；

Calculating the weight value of the space by the following formula

Sum distance calculation weight value

The calculation is carried out in such a way that,

wherein the content of the first and second substances,

in order to modify the horizontal node spacing of the information,

is a normalized value of the distance and is,

in order to increase the weight value of the memory cell,

to reduce the weight value;

calculating the weight value of the trained interval

Or interval calculation of weight values

Calculating a weight value for the pitch before correction

And carrying out replacement updating.

Optionally, in a possible implementation manner of the first aspect, the identifying, according to a first primary sub-dimension, a primary sub-dimension node established in a first node region, identifying, according to a second secondary sub-dimension, a primary sub-dimension node established in a second node region, and connecting all the primary sub-dimension nodes with a root dimension node respectively includes:

after the first node area and the second node area are obtained through judgment;

acquiring a first central point of a connecting line formed by all the primary sub-dimension nodes;

acquiring a horizontal central point of a display area, moving all primary sub-dimension nodes, and setting the first central point and the horizontal central point correspondingly;

and after the first central point and the horizontal central point are judged to be correspondingly arranged, all the primary sub-dimension nodes are respectively connected with the root dimension node.

Optionally, in a possible implementation manner of the first aspect, the extracting content information in metadata in each primary sub-dimension identifier group, if it is determined that the content information satisfies a re-classification condition, performing secondary classification on the primary sub-dimension identifier group according to the content information in the metadata to obtain a secondary sub-dimension identifier group, establishing a secondary sub-dimension node corresponding to each secondary sub-dimension identifier group, and setting the secondary sub-dimension identifier group corresponding to the primary sub-dimension node includes:

if the content information is judged to meet the reclassification condition preset by the staff, the reclassification condition is a format condition or a character condition;

performing secondary classification on the primary sub-dimension identification group according to content information in the metadata to obtain a secondary sub-dimension identification group;

and establishing secondary sub-dimension nodes corresponding to the secondary sub-dimension identification groups in the first node area or the second node area according to the content information of the secondary sub-dimension identification groups.

In a second aspect of the embodiments of the present invention, a metadata management system based on a building structure tree is provided, including:

the device comprises an acquisition module, a storage module and a processing module, wherein the acquisition module is used for acquiring total storage data corresponding to a user, the total storage data comprises at least one piece of storage subdata, and metadata corresponding to each piece of storage subdata is extracted;

the extraction module is used for constructing a root dimension node of a structure tree according to the stored total data, extracting identification information of all metadata to generate a root dimension identification group, and setting the root dimension identification group and the root dimension node correspondingly;

the first establishing module is used for extracting content information in metadata, classifying the identification information of all the metadata for the first time according to the content information of all the metadata to obtain primary sub-dimension identification groups, establishing primary sub-dimension nodes corresponding to each primary sub-dimension identification group, and correspondingly setting the primary sub-dimension identification groups and the primary sub-dimension nodes;

the second establishing module is used for extracting content information in metadata in each primary sub-dimension identification group, if the content information is judged to meet the reclassification condition, performing secondary classification on the primary sub-dimension identification groups according to the content information in the metadata to obtain secondary sub-dimension identification groups, establishing secondary sub-dimension nodes corresponding to each secondary sub-dimension identification group, and correspondingly setting the secondary sub-dimension identification groups and the primary sub-dimension nodes;

a third establishing module, configured to establish a grandchild dimension node according to the primary child dimension identifier group or the secondary child dimension identifier if it is determined that the primary child dimension identifier group or the secondary child dimension identifier group does not satisfy the secondary classification condition, and store the grandchild dimension node and the metadata correspondingly;

and the generation module is used for generating the data call structure tree of the user according to the root dimension node, the primary child dimension node and/or the secondary child dimension node and the grandchild dimension node.

In a third aspect of the embodiments of the present invention, a storage medium is provided, in which a computer program is stored, which, when being executed by a processor, is adapted to implement the method according to the first aspect of the present invention and various possible designs of the first aspect of the present invention.

The invention provides a metadata management method and a system based on a constructed structure tree, which can classify metadata according to the content information of the metadata to obtain a plurality of primary or secondary child dimension identification groups and establish corresponding primary or secondary child dimension nodes, through the way, the invention can classify and store the metadata describing the same format or the same keywords and characters, so that all discrete metadata can be aggregated according to the corresponding scene requirements, and each primary or secondary child dimension node corresponds to a plurality of grandchild dimension nodes, so that after one primary or secondary child dimension node is selected, the metadata corresponding to the clustered grandchild dimension nodes can be called uniformly to realize the rapid download of partial stored subdata, the efficiency of calling the data by the user is improved. According to the invention, after the structure tree is established through the root dimension node, the primary child dimension node and/or the secondary child dimension node and the grandchild dimension node, a user can easily check the data structure in the structure tree, the data retrieval time is reduced, and the metadata locking speed is improved.

According to the technical scheme provided by the invention, when the user calls the corresponding metadata through the structure tree, different nodes in the structure tree can be simultaneously selected, and different calling modes can be adopted according to different selected nodes, so that the method can meet the requirements of batch calling and independent calling of the metadata by the user and the combined calling formed by the batch calling and the independent calling, and is easy for the user to operate. After a user selects a primary child dimension node or a secondary child dimension node, the structure tree can synchronously lock grandchild dimension nodes corresponding to the primary child dimension node or the secondary child dimension node, so that the repeated selection of the same metadata by the user is avoided, and the efficiency of the user in metadata selection is effectively improved.

According to the technical scheme provided by the invention, after the content format and the content characters appear at the same time, the first number is obtained according to the number of the first type of one-time sub-dimension identification groups, the second number is obtained according to the number of the second type of one-time sub-dimension identification groups, and the occupied areas of the first type of sub-dimension nodes clustered according to different types are obtained, so that the first node area and the second node area can be divided in a differentiation manner. When the automatically calculated horizontal node distance and the dividing mode are judged not to meet the user requirements, the method can continuously train the distance calculation weight value according to the modification information of the user, active learning is achieved, and the follow-up automatically constructed structure tree can better meet the user requirements.

Drawings

Fig. 1 is a schematic view of an application scenario of the technical solution provided by the present invention;

FIG. 2 is a flowchart of a metadata management method based on a building structure tree according to the present invention;

FIG. 3 is a schematic diagram of one embodiment of a structure tree constructed according to the present invention;

fig. 4 is a structural diagram of a metadata management system based on a building structure tree according to the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein.

It should be understood that, in the various embodiments of the present invention, the sequence numbers of the processes do not mean the execution sequence, and the execution sequence of the processes should be determined by the functions and the internal logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.

It should be understood that in the present application, "comprising" and "having" and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

It should be understood that, in the present invention, "a plurality" means two or more. "and/or" is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "comprises A, B and C" and "comprises A, B, C" means that all three of A, B, C comprise, "comprises A, B or C" means that one of A, B, C comprises, "comprises A, B and/or C" means that any 1 or any 2 or 3 of A, B, C comprises.

It should be understood that in the present invention, "B corresponding to a", "a corresponds to B", or "B corresponds to a" means that B is associated with a, and B can be determined from a. Determining B from a does not mean determining B from a alone, but may be determined from a and/or other information. And the matching of A and B means that the similarity of A and B is greater than or equal to a preset threshold value.

As used herein, "if" may be interpreted as "at … …" or "when … …" or "in response to a determination" or "in response to a detection", depending on the context.

The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.

As shown in fig. 1, an application scenario schematic diagram of the technical solution provided by the present invention includes a user side and a server side, where different user sides respectively upload different storage subdata, where the storage subdata may be files such as text, image, audio, and video, and different text, image, audio, and video may have different contents, for example, a text name "text introduction of company a", a video name "video introduction of company a", and the like, and at this time, different storage subdata may have different metadata, and on content information of description dimensions of the corresponding storage subdata, formats, contents, and the like of the corresponding storage subdata may be described.

The server can store all the storage subdata stored by different user terminals in one storage unit, so that the storage subdata uploaded by the user terminal of each user can be managed conveniently, and the server can be a server of an internal network of an enterprise, a server of an external network and the like.

The invention provides a metadata management method based on a constructed structure tree, as shown in fig. 2, comprising the following steps:

step S110, obtaining total storage data corresponding to the user, where the total storage data includes at least one piece of sub-storage data, and extracting metadata corresponding to each piece of sub-storage data. The invention firstly obtains the total data stored corresponding to the user, and the total data can be regarded as all the sub-data stored in the storage unit which is established by the server and corresponds to the user.

And step S120, constructing a root dimension node of the structure tree according to the stored total data, extracting identification information of all metadata to generate a root dimension identification group, and setting the root dimension identification group and the root dimension node correspondingly. The identification information may be a numerical identification of 001, 002, etc., or an identification of a set letter, for example, 001A, etc. All the identification information corresponding to each user is unique and non-repetitive, and the mode can enable corresponding metadata and storage subdata to be uniquely determined according to the identification information of each user. The root dimension identification group will have identification information corresponding to all the storage subdata of the user.

The root dimension node of the structure tree is constructed according to the stored total data, and at the moment, it can be understood that other nodes directly or indirectly connected with the root dimension node are all nodes corresponding to data of corresponding users, so that the identification information of all metadata can be extracted to generate a root dimension identification group, namely all the identification information in the root dimension identification group corresponds to all the metadata, if the user needs to call all the stored sub-data, all the metadata can be determined according to the root dimension identification group, and all the stored sub-data can be called in sequence according to the metadata.

Step S130, extracting content information in the metadata, classifying the identification information of all the metadata for the first time according to the content information of all the metadata to obtain a primary sub-dimension identification group, establishing a primary sub-dimension node corresponding to each primary sub-dimension identification group, and setting the primary sub-dimension identification group corresponding to the primary sub-dimension node. After the root dimension nodes are established, each root dimension node is extracted, the identification information of all metadata is classified once according to the content information of the metadata to obtain a sub-dimension identification group, and the classification basis can be preset by a worker, for example, the file type, characters and the like of the storage sub-data described by the metadata. According to the invention, similar metadata can be classified through primary classification, so that when a user calls data, all information and data of a required category can be directly called according to a primary sub-dimension identification group, and at the moment, the invention can aim at a primary sub-dimension node corresponding to each primary sub-dimension identification group. And the primary sub-dimension identification group only has identification information of part of the same category and dimension.

In one possible implementation manner, the technical solution provided by the present invention, in step S130, includes:

the content information of the metadata includes one or more of a content format or a content text. In an actual operation scenario, a user may set content information of metadata to a content format or content text in advance. The content format is, for example, a text format, which may be subdivided into word, excel, ppt, and the like. The image format may be subdivided into jpg, png, etc. The content words may be different nouns, such as company A, company B, a learning document, a work document, a life document, and so on. The present invention is not limited in any way as to the specific content format or content text.

And if the content information selected by the user to classify the metadata is in the content format, classifying the identification information of all the metadata for the first time according to the content format to obtain a primary sub-dimension identification group. If the user selects that the content information for classifying the metadata is in a content format, the identification information of all the metadata is classified once according to the content format, and the storage sub-data described by the metadata in each primary sub-dimension identification group have the same content format, but the storage sub-data corresponding to the primary sub-dimension identification group may have unrelated content.

And if the content information selected by the user to classify the metadata is judged to be the content characters, classifying the identification information of all the metadata for the first time according to the content characters to obtain a sub-dimension identification group for the first time. If the user selects the content information for classifying the metadata as the content characters, the identification information of all the metadata is classified once according to the content characters, and the storage sub-data described by the metadata in each one-time sub-dimension identification group has the same content characters. Such as company a, life files, etc., the sub-data corresponding to the sub-dimension id group may have associated content and different formats.

And establishing primary sub-dimension nodes corresponding to the primary sub-dimension identification group, and respectively connecting all the primary sub-dimension nodes with the root dimension node. The invention can respectively establish the primary sub-dimension nodes corresponding to each primary sub-dimension identification group, and the primary sub-dimension nodes are respectively connected with the root dimension node.

In a possible embodiment, the technical solution provided by the present invention further includes:

if the content information selected by the user to classify the metadata is judged to be the content format and the content characters, a first primary sub-dimension identification group corresponding to the content format and a second primary sub-dimension identification group corresponding to the content characters are obtained. In an actual using process, a user may classify metadata in multiple ways, that is, classify all content information according to different ways of content formats and content characters, to obtain a first one-time sub-dimensional identification group and a second one-time sub-dimensional identification group.

And constructing a first kind of primary sub-dimension node according to the first kind of primary sub-dimension identification group, and constructing a second kind of primary sub-dimension node according to the second kind of secondary sub-dimension identification group. The invention can sequentially establish a secondary sub-dimension identification group corresponding to the primary sub-dimension identification group and the secondary sub-dimension identification group.

And counting the number of the first kind of primary sub-dimension identification groups to obtain a first number, and counting the number of the second kind of primary sub-dimension identification groups to obtain a second number. The invention can respectively count the number of the one-time sub-dimension identification groups and obtain the first number and the second number, and when all identification information is grouped according to the content format and the content characters in an actual use scene, different numbers of groups can be generated with higher probability.

And obtaining the display width information of the display area where the structure tree is located, and calculating according to the first quantity, the second quantity and the display width information to obtain a node boundary. In order to enable the display of the structure to be more consistent with the watching logic of a user, the invention combines the dimensionality such as the number dimensionality, the width information and the like to obtain the corresponding node boundary, and displays the primary sub-dimensionality nodes in different classification modes in a regional mode through the node boundary, so that the user can watch the nodes conveniently.

In a possible implementation manner, the obtaining of the display width information of the display area where the structure tree is located and calculating according to the first number, the second number, and the display width information to obtain a node boundary includes:

and obtaining edge reserved width information preset in the display area, and calculating according to the edge reserved width information, the first number, the second number and the display width information to obtain the horizontal node distance between any two adjacent primary sub-dimension nodes. The established and formed structure tree is displayed through the display area, but in the actual display process, in order to enable the display of the tree-shaped graph to be more coordinated, the invention presets an edge reserved width information in the display area, the edge reserved width information is only a reference value and is not a final value, and the mode enables the display area to have a certain blank space at two sides of the tree-shaped graph when the tree-shaped graph is displayed, so that the situation that any node is at the most edge of the display area to cause the user to be difficult to view is avoided, the situation that the user thinks that sub-nodes which are not displayed exist in the tree-shaped graph or thinks that the display area shows only part of the tree-shaped graph is avoided, the user is prevented from generating ambiguity, and the use of the user is enabled to be more intuitive.

The method can combine a plurality of dimensions such as edge reserved width information, a first quantity, a second quantity, display width information and the like to preliminarily calculate the horizontal node spacing, and further determine reasonable spacing for adjacent primary sub-dimension nodes.

Selecting two primary sub-dimension nodes corresponding to adjacent content formats and content characters as separation nodes, and taking a middle point formed by connecting the two separation nodes as a vertical division point of the node boundary to obtain a corresponding node boundary. It can be understood that, when the primary sub-dimension nodes are established, the primary sub-dimension nodes of the same type are established firstly, and after all the primary sub-dimension nodes corresponding to the first primary sub-dimension identification group are established, all the primary sub-dimension nodes corresponding to the second primary sub-dimension identification group are established. Therefore, the invention takes the middle point formed by the connecting lines of the two separated nodes as the vertical dividing point of the node boundary line to obtain the corresponding node boundary line. The display area can be divided into a first node area and a second node area through a node boundary, and therefore the sub-area display of different types of primary sub-dimension nodes is achieved. The invention divides the display area into two parts through the node boundary, so that the user can quickly know the area of each primary sub-dimension node.

In a possible implementation manner, the technical solution provided by the present invention obtains edge reserved width information preset in the display area, and calculates according to the edge reserved width information, the first number, the second number, and the display width information to obtain a horizontal node distance between any two adjacent primary sub-dimension nodes, including:

wherein the content of the first and second substances,

for the horizontal pitch between any two adjacent primary sub-dimension nodes,

in order to present the width information,

the width information is reserved for the edges,

in the form of a first number of bits,

in order to be able to carry out the second number,

weight values are calculated for the spacings. By passing

The preliminary calculated total reserved width information of the display area on two sides can be obtained through calculation

Width information for displaying the structure tree can be calculated by

The horizontal node spacing between every two adjacent sub-dimension nodes can be obtained if

The larger, the smaller the horizontal node spacing,

and calculating the weight value for the preset distance.

And displaying the horizontal node spacing, and if the confirmation information of the user is received, taking the calculated horizontal node spacing as the final horizontal node spacing. According to the invention, after the horizontal node spacing is obtained through calculation, the horizontal node spacing is displayed, so that a user can check the corresponding horizontal node spacing. If the user considers that the horizontal node distance at the moment meets the requirement, corresponding confirmation information is input, and the calculated horizontal node distance is considered to meet the requirement of the user by the invention, so that the calculated horizontal node distance can be used as the final horizontal node distance at the moment.

And if the modification information of the user is received, taking the horizontal node spacing in the modification information as the final horizontal node spacing, and calculating a weight value for the spacing according to the horizontal node spacing of the modification information and the calculated horizontal node spacing. If the user considers that the horizontal node distance at the moment is not in accordance with the requirement, corresponding modification information is input, the calculated horizontal node distance is considered to be not in accordance with the requirement of the user by the invention, and therefore, the horizontal node distance in the modification information can be used as the final horizontal node distance at the moment.

When the calculated horizontal node distance does not meet the requirements of the user, the calculated horizontal node distance is proved to have a certain error, so that the weight value needs to be calculated for the distance for calculating the horizontal node distance

And correcting to ensure that the subsequent calculation of the horizontal node distance is more accurate.

In a possible implementation manner, the training of calculating the weight value for the distance according to the horizontal node distance of the modification information and the calculated horizontal node distance takes the horizontal node distance in the modification information as the final horizontal node distance if the modification information of the user is received, and includes:

if the horizontal node spacing of the modification information is judged to be larger than the calculated horizontal node spacing, calculation is carried out to obtain increaseA large coefficient, calculating a weight value according to the distance of the increase coefficient pair

. At this time, the horizontal node distance calculated by the invention is proved to be small, so that the weight value needs to be calculated for the distance

Performing augmentation training on

The larger the distance, the more the weight value is proved to be calculated for the distance

The larger the increase is required, so that the method can be used according to the requirements

Calculating increased amplitude, i.e.

To increase the coefficient, the weight value is increased

Preset for the administrator according to the actual scene.

According to

Obtaining the increased and adjusted distance calculation weight value

。

If the horizontal node distance of the modification information is judged to be smaller than the calculated horizontal node distance, calculating to obtain a reduction coefficient, and calculating according to the reduction coefficientCalculating weight values at intervals of several pairs

. At this time, the horizontal node distance calculated by the invention is proved to be larger, so that the weight value needs to be calculated for the distance at this time

Performing reduction training in

The greater the magnitude of the reduction that needs to be made, so this can be based on

Calculating the magnitude of the reduction, i.e.

To reduce the coefficient, the weight value is reduced

Preset for the administrator according to the actual scene. According to

Obtaining the distance calculation weight value after the adjustment is reduced

。

Calculating the weight value of the space by the following formula

And pitch calculationWeighted value

The calculation is carried out in such a way that,

wherein the content of the first and second substances,

in order to modify the horizontal node spacing of the information,

is a normalized value of the distance and is,

in order to increase the weight value of the memory cell,

to lower the weight value. Distance normalization value

Preset for the staff, it can normalize the distance difference value with the unit of length to obtain and calculate the weight value

The value of the corresponding scalar.

Calculating the weight value of the trained interval

Or interval calculation of weight values

Calculating a weight value for the pitch before correction

And carrying out replacement updating. By the mode, the calculation horizontal section is realizedThe calculation mode of the point distance is continuously optimized and updated, and then the subsequently calculated horizontal node distance is ensured to be more in line with the scene and the requirement of a corresponding user.

The display area may be preset by an administrator, and the display area may be determined according to different user terminals, for example, the display areas of a tablet, a mobile phone, and a PC may be different. Different display areas may have different display width information.

And dividing a display area according to the node boundary line to obtain a first node area and a second node area. The display area is divided according to the node dividing line, and the node dividing line is vertical to the horizontal line of the structure tree and is parallel to the vertical line of the structure tree. The lines formed by connecting points of the same dimension in the structure tree are horizontal lines of the structure tree, for example, the lines formed by connecting all the sub-dimension nodes once are the horizontal lines.

And identifying primary sub-dimension nodes constructed in the first node area according to the first type of primary sub-dimension, identifying primary sub-dimension nodes constructed in the second node area according to the second type of secondary sub-dimension, and respectively connecting all the primary sub-dimension nodes with the root dimension node. After the first node area and the second node area are divided, corresponding primary sub-dimension nodes are established in different node areas according to different types of the primary sub-dimension marks, so that primary sub-dimension nodes classified according to the same classification logic can be checked in different areas when a user checks and selects the primary sub-dimension nodes in a later period, and the node checking of the user and the node selection in the later period are facilitated.

In a possible implementation manner, the identifying a set of primary sub-dimension nodes established in a first node region according to a first primary sub-dimension, identifying a set of primary sub-dimension nodes established in a second node region according to a second secondary sub-dimension, and connecting all the primary sub-dimension nodes with a root dimension node respectively includes:

and after the first node area and the second node area are obtained through judgment. In the invention, when the first node area and the second node area are obtained, all the first node area and the second node area are considered to be divided.

And acquiring a first central point of a connecting line formed by all the primary sub-dimension nodes. At this time, the invention obtains the first central point of the connecting line formed by the primary sub-dimension nodes, and the invention adjusts the positions of all the primary sub-dimension nodes according to the first central point of the connecting line.

And acquiring a horizontal central point of the display area, moving all the primary sub-dimension nodes, and setting the first central point and the horizontal central point correspondingly. According to the method and the device, the horizontal central point of the display area can be obtained, and the first central point and the horizontal central point are correspondingly arranged, so that the whole structure tree is correspondingly arranged according to the central line of the display area, and the user can watch the structure tree more easily.

And after the first central point and the horizontal central point are judged to be correspondingly arranged, all the primary sub-dimension nodes are respectively connected with the root dimension node. At this time, it is proved that the decision tree is correspondingly set after position calibration is performed on the decision tree and the display area, so that the primary sub-dimension nodes can be respectively connected with the root dimension node, and all the primary sub-dimension nodes and the root dimension node have corresponding relations.

Step S140, extracting content information in the metadata in each primary sub-dimension identification group, if the content information is judged to meet the reclassification condition, performing secondary classification on the primary sub-dimension identification groups according to the content information in the metadata to obtain secondary sub-dimension identification groups, establishing secondary sub-dimension nodes corresponding to each secondary sub-dimension identification group, and correspondingly setting the secondary sub-dimension identification groups and the primary sub-dimension nodes. The invention can judge whether to classify the primary sub-dimension identification group again after classifying all the identification information to obtain the primary sub-dimension identification group, the reclassification condition can be preset by a worker, and when the reclassification condition is reached, the invention can classify the primary sub-dimension identification group for the second time to obtain the secondary sub-dimension identification group and obtain the secondary sub-dimension node.

In one possible implementation manner, the technical solution provided by the present invention, in step S140, includes:

and if the content information is judged to meet the reclassification condition preset by the staff, the reclassification condition is a format condition or a character condition. Taking the format condition as an example, the format condition may be a subdivision of the picture, such as jpg format, png format, and so on.

When the primary classification is performed, all the identification information in the obtained primary sub-dimension identification group is in an image format, and when the secondary classification is performed, all the identification information in the obtained secondary sub-dimension identification group can be in a jpg format in the image format.

And carrying out secondary classification on the primary sub-dimension identification group according to the content information in the metadata to obtain a secondary sub-dimension identification group. The method can classify the content information in the metadata again, and the secondary sub-dimension identification group is a secondary sub-dimension identification group corresponding to the content in the jpg format, a secondary sub-dimension identification group corresponding to the content in the png format and the like.

And establishing secondary sub-dimension nodes corresponding to the secondary sub-dimension identification groups in the first node area or the second node area according to the content information of the secondary sub-dimension identification groups. According to the invention, secondary sub-dimension nodes corresponding to the secondary sub-dimension identification groups are established in corresponding areas according to different areas where the primary sub-dimension identification groups are located. Through the secondary sub-dimension identification group, the primary sub-dimension identification group can be subdivided again, so that a user can more finely confirm files required by the user, the condition that one node cannot meet the user requirement by selecting one node due to overlarge granularity of the primary sub-dimension node is avoided, the applicability of the technical scheme provided by the invention is improved, and the user can conveniently realize data calling and operation.

And S150, if the primary child dimension identification group or the secondary child dimension identification group is judged not to meet the reclassification condition, establishing a grandchild dimension node according to the primary child dimension identification group or the secondary child dimension identification, and correspondingly storing the grandchild dimension node and the metadata. According to the invention, when the reclassification condition is judged not to be satisfied, the primary child dimension identification group or the secondary child dimension identification group is not subdivided, and at the moment, grandchild dimension nodes are established according to the primary child dimension identification group or the secondary child dimension identification group, and corresponding grandchild dimension nodes are respectively established.

For example, if 5 pieces of identification information are included in the child dimension identification group at a time, 5 grandchild dimension nodes are established at this time, and metadata corresponding to the 5 grandchild dimension nodes are stored in corresponding grandchild dimension nodes, each grandchild dimension node corresponds to one storage module, and the corresponding metadata can be stored through the storage modules.

And S160, generating the data call structure tree of the user according to the root dimension node, the primary child dimension node and/or the secondary child dimension node and the grandchild dimension node. After all the nodes are obtained, the final data call structure tree is obtained according to the connection relationship between the root dimension node and the primary child dimension node and/or the secondary child dimension node, the connection relationship between the primary child dimension node and the grandchild dimension node, and the connection relationship between the secondary child dimension node and the grandchild dimension node, as shown in fig. 3, the structure diagram of one implementation mode of the data call structure tree is shown.

According to the technical scheme provided by the invention, all identification information can be classified in a structure tree mode according to different content information of metadata, and in the classification process, different classification modes can be adopted according to different classification requirements of users, so that the invention can be used for carrying out independent classification, fusion classification and the like according to different use scenes and formats and characters.

and if the calling request of the user is judged to be received, selecting the corresponding data calling structure tree. The invention establishes the structure tree corresponding to each user, and selects the structure tree corresponding to the call request when receiving the call request of the user. All the storage subdata stored by the user and the relation between all the storage subdata can be reflected through the structure tree.

And calling the corresponding primary child dimension node, secondary child dimension node and grandchild dimension node in the structure tree by the data, and displaying the corresponding content information. The invention displays the primary child dimension node, the secondary child dimension node and the grandchild dimension node, at this time, the content information of the primary child dimension node can be in a picture format, a text format, a file of company A and the like, and the content information of the secondary child dimension node is in a jpg format, a png format, a picture format file of company A and a video format file of company A. The invention can display the content information of all nodes in the structure tree, and is convenient for a user to quickly display data through the content information in the stored subdata description.

The content information can be automatically extracted by the server, and when the user stores the corresponding storage subdata, the format and the name of the storage subdata can be extracted to generate the corresponding content information, wherein the format content can be in an image format or a jpg format, and the text content can be in a company A brief introduction or the like.

And if the primary child dimension node and/or the secondary child dimension node is selected by the user, counting grandchild dimension nodes connected with the primary child dimension node or the secondary child dimension node in the corresponding dimension to obtain a calling dimension node set. In the actual selection process, a user may select one or more primary child dimension nodes and/or secondary child dimension nodes, at this time, the invention counts grandchild dimension nodes connected by the primary child dimension nodes or the secondary child dimension nodes in corresponding dimensions, all grandchild dimension nodes in a calling dimension node set need to be called uniformly, and in the selection process of the grandchild dimension nodes, quick selection is performed based on the primary child dimension nodes and/or the secondary child dimension nodes.

And if judging that the user selects the grandchild dimension node, taking the grandchild dimension node as an independent dimension node. In the actual selection process, a user may independently select one of the grandchild dimension nodes under a certain primary child dimension node and/or secondary child dimension node, and at this time, the corresponding grandchild dimension node is used as the independent dimension node.

And performing fusion processing on all the calling dimension node sets and the independent dimension nodes to obtain a total calling set, sequentially calling according to metadata of all grandchild dimension nodes in the total calling set, determining a plurality of memory subdata, and sending the plurality of memory subdata to a user. The invention can obtain the total call set by fusing the call dimension node set and the independent dimension node after the user finishes the node selection, at the moment, the metadata of all the grandchild dimension nodes in the total call set are the data which the user needs to call, at the moment, the invention can determine a plurality of memory subdata according to the metadata corresponding to the total call set, and send the plurality of memory subdata to the user to realize the rapid combined call, wherein the combined call comprises the selection of a plurality of grandchild dimension nodes through the primary child dimension node and/or the secondary child dimension node and also comprises the condition that the user actively selects one grandchild dimension node, so that the data call scene is richer, and the call efficiency of the user is improved.

In a possible implementation manner, the technical solution provided by the present invention is that, if it is determined that a user selects a primary child dimension node and/or a secondary child dimension node, then performing statistics on grandchild dimension nodes connected to the primary child dimension node or the secondary child dimension node in a corresponding dimension to obtain a calling dimension node set, including:

and taking the primary sub-dimension node or the secondary sub-dimension node selected by the user as a batch calling node. Because one primary child dimension node or secondary child dimension node corresponds to a plurality of grandchild dimension nodes, the method and the device can take the primary child dimension node or the secondary child dimension node selected by the user as a batch calling node.

And if the batch calling node is judged to be a primary child dimension node, counting all grandchild dimension nodes vertically connected with the batch calling node to obtain a first dimension node set. If the primary child dimension nodes are not classified again, the primary child dimension nodes are directly connected with the grandchild dimension nodes, and therefore the method and the device can directly count the grandchild dimension nodes connected with the primary child dimension nodes to obtain the corresponding first dimension node set.

And if the secondary child dimension nodes directly connected with the batch calling nodes exist, taking all the secondary child dimension nodes directly connected with the batch calling nodes as transfer calling nodes, and counting all the grandchild dimension nodes directly connected with the transfer calling nodes to obtain a second dimension node set. If the primary child dimension nodes are classified again, the primary child dimension nodes at the moment are connected with a plurality of secondary child dimension nodes which are distributed again, so that the secondary child dimension nodes which are directly connected with the batch calling nodes need to be counted respectively, the secondary child dimension nodes are used as transfer calling nodes, all grandchild dimension nodes connected with the transfer calling nodes are counted, and a corresponding second dimension node set is obtained.

and if the batch calling node is judged to be a secondary child dimension node, counting all grandchild dimension nodes directly connected with the batch calling node, and directly obtaining a calling dimension node set. At this time, the batch calling nodes are not subdivided again, so that the method can directly count all the grandchild dimension nodes directly connected with the secondary child dimension nodes to obtain the corresponding calling dimension node set.

Through the technical scheme, when the batch calling nodes are respectively the primary sub-dimension nodes and the secondary sub-dimension nodes under different conditions, different calling modes can be adopted to obtain the corresponding calling dimension node sets, and the calling efficiency is high while the number of applicable scenes is large.

and locking the primary sub-dimension nodes and/or the secondary sub-dimension nodes selected by the user, so that the user cannot select the corresponding primary sub-dimension nodes and/or secondary sub-dimension nodes again. By the mode, the selected nodes can not be repeatedly selected by the user.

And locking the grandchild dimensional nodes in the calling dimensional node set corresponding to the batch calling nodes so that the user cannot select the grandchild dimensional nodes in the calling dimensional node set. When the primary child dimension node and/or the secondary child dimension node are/is locked, the corresponding grandchild dimension node is locked, repeated selection of the repeated grandchild dimension node by a user is avoided, data selection by the user is assisted, the frequency of repeated and useless operation of the user is reduced, and the calling efficiency of the user is improved.

In order to implement the metadata management method based on the constructed structure tree provided by the present invention, the present invention further provides a metadata management system based on the constructed structure tree, as shown in fig. 4, including:

and the generating module is used for generating the data call structure tree of the user according to the root dimension node, the primary child dimension node and/or the secondary child dimension node and the grandchild dimension node.

The present invention also provides a storage medium having a computer program stored therein, the computer program being executable by a processor to implement the methods provided by the various embodiments described above.

The storage medium may be a computer storage medium or a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, a storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an Application Specific Integrated Circuits (ASIC). Additionally, the ASIC may reside in user equipment. Of course, the processor and the storage medium may reside as discrete components in a communication device. The storage medium may be read-only memory (ROM), random-access memory (RAM), CD-ROMs, magnetic tapes, floppy disks, optical data storage devices, and the like.

The present invention also provides a program product comprising execution instructions stored in a storage medium. The at least one processor of the device may read the execution instructions from the storage medium, and the execution of the execution instructions by the at least one processor causes the device to implement the methods provided by the various embodiments described above.

In the above embodiments of the terminal or the server, it should be understood that the Processor may be a Central Processing Unit (CPU), other general-purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. The metadata management method based on the construction structure tree is characterized by comprising the following steps:

2. The method for managing metadata based on the building structure tree according to claim 1, further comprising:

3. The method for managing metadata based on the building structure tree according to claim 2,

if the primary child dimension node and/or the secondary child dimension node is selected by the user, counting grandchild dimension nodes connected to the primary child dimension node or the secondary child dimension node in the corresponding dimension to obtain a calling dimension node set, wherein the step of counting grandchild dimension nodes comprises the following steps:

4. The method for managing metadata based on the building structure tree according to claim 3,

5. The method for managing metadata based on the building structure tree according to claim 1,

the method comprises the steps of extracting content information in metadata, classifying identification information of all the metadata for one time according to the content information of all the metadata to obtain primary sub-dimension identification groups, establishing primary sub-dimension nodes corresponding to each primary sub-dimension identification group, and setting the primary sub-dimension identification groups corresponding to the primary sub-dimension nodes, and comprises the following steps:

6. The method for managing metadata based on the building structure tree according to claim 5, further comprising:

7. The method for managing metadata based on the building structure tree according to claim 6,

the obtaining of the display width information of the display area where the structure tree is located, and calculating according to the first number, the second number, and the display width information to obtain a node boundary line includes:

8. The method for managing metadata based on the building structure tree according to claim 7,

obtaining preset edge reserved width information of the display area, and calculating according to the edge reserved width information, the first number, the second number and the display width information to obtain a horizontal node distance between any two adjacent primary sub-dimension nodes, wherein the method comprises the following steps:

wherein the content of the first and second substances,

for the horizontal pitch between any two adjacent primary sub-dimension nodes,

in order to present the width information,

the width information is reserved for the edges,

in the form of a first number of bits,

in order to be able to carry out the second number,

calculating a weight value for the distance;

9. The method for managing metadata based on the building structure tree according to claim 8,

if receiving modification information of a user, taking a horizontal node distance in the modification information as a final horizontal node distance, and training a weight value according to the horizontal node distance of the modification information and the calculated horizontal node distance pair distance, wherein the training comprises the following steps:

；

If the horizontal node distance of the modified information is judged to be smaller than the calculated horizontal node distance, calculating to obtain a reduction coefficient, and calculating a weight value of the distance according to the reduction coefficient

；

Calculating the weight value of the space by the following formula

Sum-space calculation of weight values

The calculation is carried out in such a way that,

wherein the content of the first and second substances,

in order to modify the horizontal node spacing of the information,

is a normalized value of the distance and is,

in order to increase the weight value of the memory cell,

to reduce the weight value;

calculating the weight value of the trained interval

Or interval calculation of weight values

Calculating a weight value for the pitch before correction

And carrying out replacement updating.

10. The method for managing metadata based on the building structure tree according to claim 8,

the identifying of the primary sub-dimension node constructed in the first node region according to the first primary sub-dimension identification configuration, the identifying of the primary sub-dimension node constructed in the second node region according to the second secondary sub-dimension identification configuration, and the connecting of all the primary sub-dimension nodes with the root dimension node respectively include:

11. The method for managing metadata based on the building structure tree according to claim 6,

extracting content information in metadata in each primary sub-dimension identification group, if the content information is judged to meet the secondary classification condition, performing secondary classification on the primary sub-dimension identification group according to the content information in the metadata to obtain a secondary sub-dimension identification group, establishing secondary sub-dimension nodes corresponding to each secondary sub-dimension identification group, and setting the secondary sub-dimension identification groups corresponding to the primary sub-dimension nodes, wherein the method comprises the following steps:

12. The metadata management system based on the building structure tree is characterized by comprising the following components: