CN103049444B - A kind of storage method and system of data information classification structure - Google Patents

A kind of storage method and system of data information classification structure Download PDF

Info

Publication number
CN103049444B
CN103049444B CN201110308148.8A CN201110308148A CN103049444B CN 103049444 B CN103049444 B CN 103049444B CN 201110308148 A CN201110308148 A CN 201110308148A CN 103049444 B CN103049444 B CN 103049444B
Authority
CN
China
Prior art keywords
data message
structure tree
tree
node
classification structure
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201110308148.8A
Other languages
Chinese (zh)
Other versions
CN103049444A (en
Inventor
孔柏汉
何玫
周杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alibaba Group Holding Ltd
Original Assignee
Alibaba Group Holding Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Alibaba Group Holding Ltd filed Critical Alibaba Group Holding Ltd
Priority to CN201110308148.8A priority Critical patent/CN103049444B/en
Priority to TW101103771A priority patent/TWI547814B/en
Priority to EP12779245.5A priority patent/EP2766827A1/en
Priority to PCT/US2012/059794 priority patent/WO2013055946A1/en
Priority to JP2014535883A priority patent/JP2014528627A/en
Priority to US13/650,000 priority patent/US9280611B2/en
Publication of CN103049444A publication Critical patent/CN103049444A/en
Priority to US15/050,772 priority patent/US9690843B2/en
Application granted granted Critical
Publication of CN103049444B publication Critical patent/CN103049444B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/284Relational databases
    • G06F16/285Clustering or classification
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/904Browsing; Visualisation therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2246Trees, e.g. B+trees
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/901Indexing; Data structures therefor; Storage structures
    • G06F16/9027Trees

Abstract

This application discloses the storage method and system of a kind of data information classification structure, by using on the basis of original preliminary classification structure tree, generate the recombination classes structure tree of storage data message classification structure, owing to above-mentioned recombination classes structure tree has flexible and changeable feature, when carrying out data message and safeguarding with data information search, utilize search engine that data message is scanned for, just the data message of needs can be searched quickly, therefore, effectively solve carry out in the prior art data message search time, over-burden for search engine, and the technical problem that pressure is excessive when carrying out data message and safeguarding with data information search, and then there is the burden that can reduce search engine, can alleviate again and safeguard and the technique effect of pressure during data information search carrying out data message.

Description

A kind of storage method and system of data information classification structure
Technical field
The application relates to data message search field, in particular, provides depositing of a kind of data information classification structure Method for storing and system.
Background technology
Along with the development of Internet technology, the application of the Internet is more and more extensive, the most popular utilization Shopping at network platform is built in the Internet, is traded as set up virtual shop on some large-scale website, and this is just Cause the data message substantial increase of storage on shopping at network platform, occur in that the situation that data message spreads unchecked.
For the management of authority data information, prior art have employed tree-shaped classification+characteristic information to data Information is managed, and carries out the issue of data message on this basis, show and search for.As: work as network When shopping platform system receives the reception request of a data message, according to the standard of regulation, it can be carried out Hierarchical classification, the data message of identical category will be integrated into sorting out, and then form huge taxonomic structure tree, And show displaying on interface at data message.
But, when this data message is shown show on interface at data message, in shopping at network platform being given Portion brings immense pressure when carrying out data message maintenance and data information search, and can be to search engine band Carry out great burden.Such as, during the query word such as input " association lenovo " or " lenovo ", due to association lenovo There are many different commodity, as association's mobile phone, ThinkPad, association's printer, association's RAM (random access memory) card Etc, association's mobile phone belongs to the field of mobile phones in communication tool field, and ThinkPad belongs to communication PC domain in field of tool, both are belonging under same class different subclass, when search engine search is associated During product, search engine will start search from communication tool, and searches out different shaped in field of mobile phones one by one Association's mobile phone of money, repeats and restarts search at communication tool, then search out in PC domain not one by one The ThinkPad of homotype money, repeats association's product such as search association's printer and association's RAM (random access memory) card, Until by complete to all associations mobile phone, all Legend computers and all associations printer and all associations RAM (random access memory) card Till portion searches for out, above-mentioned search is repeated many unnecessary search, and this results in search engine burden It is greatly increased, and when carrying out data message and safeguarding with data information search, produces immense pressure.
Summary of the invention
In order to reduce the burden of search engine, and alleviation is carrying out data message maintenance and data information search Time pressure, this application provides the storage method and system of a kind of data information classification structure, by use On the basis of original preliminary classification structure tree, generate the recombination classes knot of storage data message classification structure Broussonetia papyrifera, owing to above-mentioned recombination classes structure tree has flexible and changeable feature, carry out data message safeguard and During data information search, utilize search engine that data message is scanned for, just can search for quickly To the data message needed, and then the burden of search engine can be reduced, can alleviate again and carry out data message Safeguard and pressure during data information search.
The application provides a kind of storage method of data information classification structure, first, it is thus achieved that be used for storing data The preliminary classification structure tree of categories of information structure, described preliminary classification structure tree includes that data message query source is special The initial root node levied, and the child node of at least one-level interpretive classification feature, leaf node is corresponding data Information;
At least perform following steps, generate the recombination classes structure of a storage data message classification structure Tree, and store the recombination classes structure tree of generation:
By the initial root node in described preliminary classification structure tree or wherein one-level child node be defined as recombination classes The root node of structure tree;
By in residue node in addition to the root node determined or child node in described preliminary classification structure tree, extremely A few node is defined as the child node of described recombination classes structure tree;
According to the root node determined for described recombination classes structure tree and child node, and by the number of described correspondence It is believed that the breath leaf node as recombination classes structure tree, generation and described preliminary classification structure tree differ Recombination classes structure tree.
Optionally, described acquisition is used for storing the preliminary classification structure tree of data message classification structure, particularly as follows: When the preliminary classification structure tree of described storage data message classification structure is data message issue, according to standard scores Class formation tree selects foundation.
In addition, the application also provides for a kind of system storing data information classification structure, specifically includes:
Classification O&M module, for obtaining the preliminary classification structure tree for storing data message classification structure, Described preliminary classification structure tree includes the initial root node of data message query source feature, and at least one-level describes The child node of characteristic of division, leaf node is corresponding data message;
And at least performing following steps, generate the heavy constituent of a storage data message classification structure Class formation tree:
Rule engine module, for by the initial root node in described preliminary classification structure tree or wherein one-level son Node is defined as the root node of recombination classes structure tree;And for determining described preliminary classification structure tree removes Root node and child node outside residue node in, at least one node is defined as described recombination classes structure The child node of tree;It is additionally operable to according to the root node determined for described recombination classes structure tree and child node, and Using the data message of described correspondence as the leaf node of recombination classes structure tree, generate and described preliminary classification The recombination classes structure tree that structure tree differs;
Categorical data module, for storing initial taxonomic structure tree and recombination classes structure tree.
Optionally, described acquisition is used for storing the preliminary classification structure tree of data message classification structure, particularly as follows: When the described preliminary classification structure tree for storing data message classification structure is data message issue, according to mark Quasi-taxonomic structure tree selects foundation.
In addition, the application also provides for a kind of utilization storage method according to described data information classification structure The data information classification structure generated, the method for inquiry data message, comprise the steps: data message Preliminary classification structure tree and the root node of each recombination classes structure tree as data message query source feature Navigation information show on data message query interface;The data message query source feature selected according to user, Determine the data message query source feature taxonomic structure tree as root node;Taxonomic structure tree according to determining is User navigates step by step, until user inquires described data message.
Optionally, described acquisition is used for storing the preliminary classification structure tree of data message classification structure, particularly as follows: When the described preliminary classification structure tree for storing data message classification structure is data message issue, according to mark Quasi-taxonomic structure tree selects foundation.
In addition, the application also provides for a kind of utilization storage method according to described data information classification structure The data information classification structure generated, the system of inquiry data message, specifically include: data message shows mould Block, for display by the root node of the preliminary classification structure tree of data message with each recombination classes structure tree Navigation information as data message query source feature;Search engine module, for the number selected according to user It is believed that breath query source feature, determine the data message query source feature taxonomic structure tree as root node, and use In navigating step by step for user according to the taxonomic structure tree determined, until user inquires described data message;Number According to memory module, it is used for storing data message, it is provided that data query source.
Optionally, described acquisition is used for storing the preliminary classification structure tree of data message classification structure, particularly as follows: When the described preliminary classification structure tree for storing data message classification structure is data message issue, according to mark Quasi-taxonomic structure tree selects foundation.
One or more technical schemes in technique scheme, have the following technical effect that or advantage:
In the application, one or more technical schemes are by the basis of original preliminary classification structure tree, raw Become the recombination classes structure tree of storage data message classification structure, owing to above-mentioned recombination classes structure tree has spirit Changeable feature alive, when carrying out data message and safeguarding with data information search, utilizes search engine to data Information scans for, and just can search the data message of needs quickly, therefore, effectively solve When carrying out data message search in the prior art, over-burden for search engine, and carrying out data letter The technical problem that breath is safeguarded and pressure is excessive during data information search, and then have and can reduce search engine Burden, can alleviate again and safeguard and the technique effect of pressure during data information search carrying out data message.
Accompanying drawing explanation
Fig. 1 is the flow chart of the storage method of data information classification structure in the present embodiment one;
Figure 1A is the schematic diagram of preliminary classification structure tree in embodiment one;
Figure 1B is the schematic diagram of the preliminary classification structure tree of communication tool in the present embodiment one;
Fig. 1 C is the storage data message classification structure generated based on preliminary classification structure tree in the present embodiment one The concrete schematic diagram of recombination classes structure tree;
Fig. 1 D is the generation process of initiating structure classification tree in the embodiment of the present application one;
Fig. 1 E is to have the classification shape according to tree of same or like characteristic of division in embodiment one Formula generates the concrete schematic diagram of criteria classification structure tree;
Fig. 2 is the system storing data information classification structure in the present embodiment one;
Fig. 2 A is that in the present embodiment one, combined with hardware environment generates restructuring on the basis of preliminary classification structure tree Taxonomic structure tree implement process example figure;
Fig. 3 is a kind of data information classification structure generating method as described in embodiment one in the present embodiment two Carry out the method flow diagram inquired about;
Fig. 4 is a kind of data message generating method as described in embodiment one for providing in the present embodiment two Taxonomic structure carries out the system inquired about;
Fig. 4 A is the schematic diagram being shown navigation information in the present embodiment two by data message display module;
Fig. 4 B is the schematic diagram of the recombination classes structure tree selecting " Fructus Mali pumilae " in the present embodiment two;
Fig. 4 C is the schematic diagram navigated step by step by search engine module in the present embodiment two;
Fig. 4 D is the schematic diagram navigated step by step by search engine module in the present embodiment two;
Fig. 4 E is to be navigated step by step by search engine module in the present embodiment two to obtain the schematic diagram of Query Result.
Detailed description of the invention
Below in conjunction with each accompanying drawing, the main of the embodiment of the present application technical scheme is realized principle, specific embodiment party Formula and the beneficial effect that should be able to reach is set forth in.
During in order to solve to carry out in prior art data message search, over-burden for search engine, and is entering Row data message safeguards the technical problem excessive with pressure during data information search, and the embodiment of the present application one provides A kind of storage method of data information classification structure, preliminary classification structure tree when issuing according to data message, The characteristic of division of data message is recombinated as root node by different characteristic of divisions, generates different dividing Class formation tree, such that it is able to provide multiple taxonomic structure tree, so when inquiry data to same data message Time, according to the various taxonomic structure trees multiple navigation approach of offer, thus what minimizing caused because navigation approach is single Repeat search problem.
Below in conjunction with Figure of description, embodiments herein one is illustrated, it will be appreciated that this place is retouched The embodiment one stated is merely to illustrate and explains the application, is not used to limit the application, and is not conflicting In the case of, all embodiments in the application and the feature in embodiment can be mutually combined.
With reference to Fig. 1, provide a kind of storage method of data information classification structure for the embodiment of the present application, including with Lower step:
Step 101, it is thus achieved that for storing the preliminary classification structure tree of data message classification structure, described initial point Class formation tree includes the initial root node of data message query source feature, and at least one-level interpretive classification feature Child node, leaf node is corresponding data message.
As it has been described above, with reference to Figure 1A, it is the schematic diagram of preliminary classification structure tree.Wherein, preliminary classification knot Broussonetia papyrifera includes the initial root node of data message query source feature, and at least the sub of one-level interpretive classification feature is saved Point, leaf node is corresponding data message.For storing the preliminary classification structure of data message classification structure Tree be the publisher of data message when issuing data message, select to set up according to the taxonomic structure of standard.
Below as a example by communication tool, with reference to Figure 1B, the preliminary classification structure tree of communication tool particularly as follows:
The initial root node of data message query source feature is communication tool, has the following first order under this root node Child node: transmitter receiver, mobile phone, communication parts, computer.And " mobile phone " son in first order child node Node has following second level child node: brand, network type.Wherein, " brand " child node has again Following third level child node: the brand mobile phones such as Nokia, Fructus Mali pumilae, association, and " network type " child node In then there is following 3rd pole child node: GSM, CDMA.And as the son joint in " brand " child node Select and " Fructus Mali pumilae " has again following fourth stage child node: IPHONE3, IPHONE4.As fourth stage " IPHONE3 ", " IPHONE4 " of node is about in mobile phone child node in this preliminary classification structure tree Leaf node, is the data message of correspondence.
And above-mentioned as " computer " child node in first order child node has following second level child node: Notebook computer, panel computer.And have as in " notebook computer " child node of second level child node There is a following third level child node: brand, memory size, screen size." product as third level child node Board " child node has again following fourth stage child node: Fructus Mali pumilae, grand base.And as third level child node " screen size " child node then has following fourth stage leaf node: 13,14, and as fourth stage " 13 " " 14 " of node are about in " screen size " child node in computer in this preliminary classification structure tree Leaf node, is the data message of correspondence.Have again as in " Fructus Mali pumilae " child node of fourth stage child node There is a following level V child node: MAC374, MAC375.As level V child node " MAC374 ", " MAC375 " is as afterbody child node in computer child node in this preliminary classification structure tree, should " MAC374 ", " MAC375 " are its leaf node, are the data message of correspondence.
Should be appreciated that preliminary classification structure tree recited herein is merely to illustrate and explains the present embodiment, and Being not used in restriction the present embodiment, the present embodiment can use the preliminary classification structure tree of other classifications completely, as The preliminary classification structure tree of women's dress illustrates.
Based on the preliminary classification structure tree for storing data message classification structure, at least perform to walk the most as follows Suddenly, generate the recombination classes structure tree of a storage data message classification structure, and store the heavy constituent of generation Class formation tree:
Step 102, by the initial root node in described preliminary classification structure tree or wherein one-level child node be defined as The root node of recombination classes structure tree.
By the initial root node in described preliminary classification structure tree or wherein one-level child node be defined as recombination classes The root node of structure tree, i.e. as it has been described above, on the basis of above-mentioned preliminary classification structure tree based on communication tool On, its root node " communication tool " or wherein one-level child node such as " mobile phone ", " brand " can be selected Or the child node such as " Fructus Mali pumilae " is as the root node of recombination classes structure tree, here, " Fructus Mali pumilae " is selected to make Root node for heavy constituent class formation tree illustrates:
The root joint that will be defined as recombination classes structure tree as " Fructus Mali pumilae " child node in preliminary classification structure tree Point, the recombination classes structure tree of restructuring apple series product.
Step 103, by described preliminary classification structure tree in addition to the root node determined or child node residue joint In point, at least one node is defined as the child node of described recombination classes structure tree;
In the preliminary classification structure tree of above-mentioned communication tool, it has been determined that " Fructus Mali pumilae " is as recombination classes structure The root node of tree, then, in addition to " Fructus Mali pumilae " node, other residue nodes all can be as recombination classes structure tree Child node.
In preliminary classification structure tree according to foregoing description, it may be determined that above-mentioned " Fructus Mali pumilae " has comprised mobile phone With notebook computer series of products, then by " mobile phone " child node and " notebook computer " child node conduct " Fructus Mali pumilae " is as the first order child node in recombination classes structure tree.And by " IPHONE3 ", " IPHONE4 " Series is as the child node in the first order " mobile phone " child node.By " MAC374 ", " MAC375 " conduct Child node in " computer " child node.
Should be appreciated that " Fructus Mali pumilae " child node herein selected is as the restructuring storing data message classification structure The root node of taxonomic structure tree is merely to illustrate the present embodiment, is not used to limit the present embodiment, the present embodiment Completely can according to practical situation need select above-mentioned preliminary classification structure tree or other preliminary classification structure trees In some root node or child node as its root node, and select except above-mentioned preliminary classification structure tree or its In residue node outside the root node determined in his preliminary classification structure tree or child node, at least one node It is defined as the child node of described recombination classes structure tree, as apple products is not restricted to mobile phone and computer, Also include other such as Cellphone Accessories, computer chip etc., and " Cellphone Accessories ", " computer chip " child node exist In other preliminary classification structure trees, then can select " the hands in other preliminary classification structure trees according to actual needs Machine part ", " computer chip " child node recombinates in the present embodiment the recombination classes structure about " Fructus Mali pumilae " In tree, the thinnest act.
Step 104, according to the root node determined for described recombination classes structure tree and child node, and by described Corresponding data message, as the leaf node of recombination classes structure tree, generates and described preliminary classification structure tree The recombination classes structure tree differed.
Above-mentioned root node and the child node determined for described recombination classes structure tree is entered according to above-mentioned classification Row arrangement, generates the recombination classes structure tree differed with described preliminary classification structure tree, and as last Level child node, i.e. leaf node " IPHONE3 ", " IPHONE4 " and " MAC374 ", " MAC375 " as corresponding data message, then corresponds under corresponding child node.
With reference to Fig. 1 C, it is the restructuring of the storage data message classification structure generated based on preliminary classification structure tree The concrete schematic diagram of taxonomic structure tree.
Should be appreciated that " Fructus Mali pumilae " child node in the structure tree of citing preliminary classification herein is as recombination classes The root node of structure tree, the recombination classes structure tree of apple series product of recombinating is merely to illustrate the present embodiment Implementation process, be not used to limit the present embodiment, the present embodiment can according to practical situation needs, based on One class or the different preliminary classification structure tree of multiclass generate the heavy constituent of a storage data message classification structure Class formation tree, or generate multiple storage data message classification structure based on a class preliminary classification structure tree Recombination classes structure tree, or generate one or many based on the preliminary classification structure tree that a class or multiclass are different The recombination classes structure tree of individual storage data message classification structure.
Wherein, step 101 is as a example by above-mentioned communication tool class, to the criteria classification by setting up communication tool Structure tree, and to being set up the preliminary classification structure of communication tool by the criteria classification structure tree of communication tool The process of tree does concrete description, with reference to Fig. 1 D:
Step 1011, sorts out the classification with same or like characteristic of division.
When setting up the criteria classification structure tree of communication tool class, first select there is same or like classification, Such as mobile phone, transmitter receiver, communication parts, computer, this four classes classification broadly falls into communication tool class now, right Say that machine, mobile phone are mobile communications tools, and computer is as the communication tool of the Internet, communication parts conduct For the instrument of maintenance under communication tool, this four class has common characteristic information, then this four class is attributed to Classification under communication tool, as the child node under start node " communication tool ".And mobile phone can be thin Turning to " brand " class mobile phone or " network type " mobile phone, " brand " is to divide by different brands, and " network type " is to divide according to mechanics of communication, if GSM type mobile phone is for using global mobile communication skill The mobile phone of art, and the mobile phone that CDMA type mobile phone is the mechanics of communication utilizing spread spectrum, then by " GSM ", " CDMA " belongs to " network type ".Multiple brand it is divided into again, such as Nokia, Herba Marsileae Quadrifoliae under brand styles Really, association, Samsung, the brand such as sky language, the most only with Nokia, Fructus Mali pumilae, association three class brand citing.
And computer notebook computer and the panel computer of can being divided into now, have again under notebook computer The notebook computer classified with " brand ", the notebook computer classified with " memory size ", with " screen Size " notebook computer classified, " brand ", " memory size ", " screen size " pen will be attributed to Remember under this computer.And brand notebook computer will be divided into " Fructus Mali pumilae ", " grand base ", " association ", " Asus " Etc. multiple brands, as a example by this sentences " Fructus Mali pumilae ", " grand base ".
Step 1012, according to classification, will have the classification of same or like characteristic of division according to tree Form generation criteria classification structure tree.
According to above-mentioned classification, will have the classification form according to tree of same or like characteristic of division Generate criteria classification structure tree, as referring to figure 1e.
Above-mentioned normal structure classification tree standard according to the rules is sorted out, and taxonomic structure immobilizes, and information is sent out Data message, according to criteria classification structure tree selection sort feature step by step, is published to leaf node by cloth person, from And form preliminary classification structure tree.
Step 1013, when issuing data message, corresponds to the interpretive classification of correspondence by corresponding data message Under the child node of feature, as corresponding leaf node, i.e. obtain for storing data message classification structure Preliminary classification structure tree.
As corresponding to " Fructus Mali pumilae " child node under " mobile phone " child node, have under i Phone " IPHONE3 ", The series brand such as " IPHONE4 ", " IPAD ", " IPOD ", this sentences " IPHONE3 ", " IPHONE4 " As a example by series, by " IPHONE3 ", " IPHONE4 " as the data letter corresponding to " Fructus Mali pumilae " child node Breath, corresponds under " Fructus Mali pumilae " child node, as the leaf node under " Fructus Mali pumilae " child node.And for " electricity Brain " apple series computer under child node, then there is " MAC374 ", " MAC375 " series computer, then " MAC374 ", " MAC375 " as data message is corresponded to the " Herba Marsileae Quadrifoliae as " computer " child node Really " under child node, as its leaf node.And as the data message of " screen size ", " 13 ", " 14 " Then correspond under " screen size " child node, as its leaf node.As shown in above-mentioned Figure 1B, it is and obtains Must be used for storing the preliminary classification structure tree of data message classification structure.
With reference to Fig. 2, it is the system storing data information classification structure in the present embodiment one, wherein, and this system Including:
Classification O&M module 201, for obtaining the preliminary classification structure for storing data message classification structure Tree, described preliminary classification structure tree includes the initial root node of data message query source feature, and at least one-level The child node of interpretive classification feature, leaf node is corresponding data message.
Rule engine module 202, for by the initial root node in described preliminary classification structure tree or wherein one-level Child node is defined as the root node of recombination classes structure tree;And for will described preliminary classification structure tree remove really In residue node outside fixed root node and child node, at least one node is defined as described recombination classes knot The child node of Broussonetia papyrifera;It is additionally operable to according to the root node determined for described recombination classes structure tree and child node, And using the data message of described correspondence as the leaf node of recombination classes structure tree, generate and described initial point The recombination classes structure tree that class formation tree differs.
Categorical data module 203, for storing initial taxonomic structure tree and recombination classes structure tree.
The preliminary classification structure tree for storing data message classification structure that above-mentioned module describes, it is data When information is issued, select foundation according to criteria classification structure tree.
With reference to Fig. 2 A, it is to generate weight on the basis of preliminary classification structure tree by rule engine module 202 Component class formation tree implement process, as a example by the preliminary classification structure tree of the communication tool of foregoing description.
Rule engine module 202, in the preliminary classification structure tree of the communication tool of foregoing description, selects communication The initial root node of the preliminary classification structure tree of instrument or wherein one-level child node are defined as recombination classes structure tree Root node, select here " Fructus Mali pumilae " as the root node of recombination classes structure tree, will be as preliminary classification " Fructus Mali pumilae " child node in structure tree is defined as the root node of recombination classes structure tree, and restructuring apple series produces The recombination classes structure tree of product, in the preliminary classification structure tree of above-mentioned communication tool, it has been determined that " Fructus Mali pumilae " As the root node of recombination classes structure tree, then in addition to " Fructus Mali pumilae " node, other residue nodes all can be made Child node for heavy constituent class formation tree.In preliminary classification structure tree according to foregoing description, it may be determined that on State and " Fructus Mali pumilae " has comprised mobile phone and notebook computer series of products, then by " mobile phone " child node and " pen Remember this computer " child node as " Fructus Mali pumilae " as the first order child node in recombination classes structure tree.And incite somebody to action " IPHONE3 ", " IPHONE4 " series is as the child node in the first order " mobile phone " child node.Will " MAC374 ", " MAC375 " are as the child node in " computer " child node.
By embodiments herein one, it is possible to achieve following technique effect:
The embodiment of the present application one is by providing the storage method and system of a kind of data information classification structure, former On the basis of some preliminary classification structure trees, generate the recombination classes structure tree of storage data message classification structure, Owing to above-mentioned recombination classes structure tree has flexible and changeable feature, when carrying out data message and safeguarding, utilize Data message is scanned for by search engine, just can search the data message of needs quickly, because of This, effectively solve carry out in the prior art data message search time, over-burden for search engine, with And the technical problem that pressure is excessive when carrying out data message and safeguarding, and then have and can reduce search engine Burden, can alleviate again the technique effect of pressure when carrying out data message and safeguarding.
The embodiment of the present application two provides a kind of data message classification knot generating method as described in embodiment one Structure carries out the method inquired about, with reference to Fig. 3.
Step 301, by the root node of the preliminary classification structure tree of data message He each recombination classes structure tree Navigation information as data message query source feature shows on data message query interface.
Step 302, the data message query source feature selected according to user, determine data message query source feature Taxonomic structure tree as root node.
Step 303, the taxonomic structure tree according to determining is navigated step by step for user, until user inquires described number It is believed that breath.
Wherein, the preliminary classification structure tree for storing data message classification structure is data message when issuing, Foundation is selected according to criteria classification structure tree.
Preliminary classification structure tree based on above-mentioned display data message on data message query interface and each The root node of individual recombination classes structure tree, according to actual needs, determines a root node, and determines a root Node, just represents and determines the taxonomic structure tree that have selected belonging to this root node, and wherein, tree includes taxonomic structure Preliminary classification structure tree and recombination classes structure tree, the then first order child node meeting in this taxonomic structure tree Display is on data message query interface, when some child node that have selected in first order child node, then should Child node in child node will show on data message query interface, analogizes step by step, until the number needed Till it is believed that breath shows on data message query interface.
Illustrated below, when the root node " Fructus Mali pumilae " of the recombination classes structure tree as described in embodiment one is made For time on data message query interface in navigation information reality, by selecting " Fructus Mali pumilae " root node, this restructuring First order child node " mobile phone " and " notebook computer " in taxonomic structure tree will show at data message On query interface, by selecting " mobile phone " child node, then as the data message in " mobile phone " child node, As selected " IPHONE3 ", then " IPHONE3 " leaf node will show on data message query interface.
With reference to Fig. 4, for a kind of data letter that method as described in embodiment one is generated provided in the present embodiment two Breath taxonomic structure carries out the system inquired about.
This system includes:
Data message display module 401, for display by the preliminary classification structure tree of data message and each weight The root node of component class formation tree is as the navigation information of data message query source feature.
Search engine module 402, for the data message query source feature selected according to user, determines that data are believed Breath query source feature is as the taxonomic structure tree of root node, and is used for according to the taxonomic structure tree determined being user Navigate step by step, until user inquires described data message.
Data memory module 403, is used for storing data message, it is provided that data query source.
Wherein, the preliminary classification structure tree for storing data message classification structure is data message when issuing, Foundation is selected according to criteria classification structure tree.
With reference to Fig. 4 A, its be on data message display module 401 display by the preliminary classification knot of data message The root node of Broussonetia papyrifera and each recombination classes structure tree as the navigation information of data message query source feature, If any the information such as " communication tool ", " computer ", " Fructus Mali pumilae ", " women's dress ", search engine module 402 is then For the data message query source feature selected according to user, determine that data message query source feature saves as root The taxonomic structure tree of point, and for navigating step by step for user according to the taxonomic structure tree determined, until user looks into Ask to described data message, such as Fig. 4 B, 4C, 4D, 4E, when selecting a navigation information, as selected " Herba Marsileae Quadrifoliae Really ", just have selected the recombination classes structure tree of " Fructus Mali pumilae ", the first order joint in this recombination classes structure tree Point " mobile phone " and " notebook computer " will show on data message query interface, by selecting " hands Machine " child node, then as the data message in " mobile phone " child node, as selected " IPHONE3 ", then " IPHONE3 " leaf node will show on data message query interface.
By embodiments herein two, it is possible to achieve following technique effect:
The data message classification knot that the embodiment of the present application two generates by providing a kind of method as described in embodiment one The querying method of structure and system, on the basis of the recombination classes structure tree generating storage data message classification structure On inquire about, owing to above-mentioned recombination classes structure tree has flexible and changeable feature, it is believed that carrying out sum When breath is searched, utilize search engine that data message is scanned for, just can search needs quickly Data message, therefore, effectively solve carry out in the prior art data message search time, search is drawn Hold up that over-burden, and the technical problem that pressure is excessive when data information search, and then have and can reduce The burden of search engine, can alleviate again the technique effect of pressure when carrying out data message inquiry. Obviously, those skilled in the art can carry out various change and modification without deviating from the application's to the application Spirit and scope.So, if the application these amendment and modification belong to the application claim and etc. Within the scope of technology, then the application is also intended to comprise these change and modification.

Claims (8)

1. the storage method of a data information classification structure, it is characterised in that specifically include:
Obtain the preliminary classification structure tree for storing data message classification structure, described preliminary classification structure tree Including the initial root node of data message query source feature, and the child node of at least one-level interpretive classification feature, Leaf node is corresponding data message, described one classification of initial root nodes stand;
At least perform following steps, generate the recombination classes structure of a storage data message classification structure Tree, and store the recombination classes structure tree of generation:
Wherein one-level child node in described preliminary classification structure tree is defined as the root joint of recombination classes structure tree Point;
By in residue node in addition to the root node determined or child node in described preliminary classification structure tree, extremely A few node is defined as the child node of described recombination classes structure tree;
According to the root node determined for described recombination classes structure tree and child node, and by the number of described correspondence It is believed that the breath leaf node as recombination classes structure tree, generation and described preliminary classification structure tree differ Recombination classes structure tree, wherein, the structure of described taxonomic structure tree and recombination structure tree is typical tree-shaped knot Structure, described recombination classes structure tree is to generate based on the preliminary classification structure tree that multiclass is different.
2. the method for claim 1, it is characterised in that described acquisition is used for storing data message class The preliminary classification structure tree of mesh structure, particularly as follows:
When the preliminary classification structure tree of described storage data message classification structure is data message issue, according to mark Quasi-taxonomic structure tree selects foundation.
3. the system storing data information classification structure, it is characterised in that specifically include:
Classification O&M module, for obtaining the preliminary classification structure tree for storing data message classification structure, Described preliminary classification structure tree includes the initial root node of data message query source feature, and at least one-level describes The child node of characteristic of division, leaf node is corresponding data message, described one class of initial root nodes stand Mesh;
And at least performing following steps, generate the heavy constituent of a storage data message classification structure Class formation tree:
Rule engine module, attaches most importance to for the wherein one-level child node in described preliminary classification structure tree being determined The root node of component class formation tree;And for described preliminary classification structure tree removing the root node determined and son In residue node outside node, at least one node is defined as the child node of described recombination classes structure tree; It is additionally operable to according to the root node determined for described recombination classes structure tree and child node, and by described correspondence Data message, as the leaf node of recombination classes structure tree, generates and described preliminary classification structure tree differs Recombination classes structure tree, wherein, the structure of described taxonomic structure tree and recombination structure tree is the most tree-shaped Structure, described recombination classes structure tree is to generate based on the preliminary classification structure tree that multiclass is different;
Categorical data module, for storing initial taxonomic structure tree and recombination classes structure tree.
4. system as claimed in claim 3, it is characterised in that described acquisition is used for storing data message class The preliminary classification structure tree of mesh structure, particularly as follows:
When the described preliminary classification structure tree for storing data message classification structure is data message issue, press Sighting target quasi-taxonomic structure tree selects foundation.
5. the data information classification structure inquiry data message that a kind utilizes method described in claim 1 to generate Method, it is characterised in that comprise the steps:
Using the root node of the preliminary classification structure tree of data message and each recombination classes structure tree as data The navigation information of information inquiry source feature shows on data message query interface;
The data message query source feature selected according to user, determines that data message query source feature saves as root The taxonomic structure tree of point;
Taxonomic structure tree according to determining is navigated step by step for user, until user inquires described data message.
6. method as claimed in claim 5, it is characterised in that described acquisition is used for storing data message class The preliminary classification structure tree of mesh structure, particularly as follows:
When the described preliminary classification structure tree for storing data message classification structure is data message issue, press Sighting target quasi-taxonomic structure tree selects foundation.
7. the data information classification structure inquiry data message that a kind utilizes method described in claim 1 to generate System, it is characterised in that specifically include:
Data message display module, for display by the preliminary classification structure tree of data message and each restructuring The root node of taxonomic structure tree is as the navigation information of data message query source feature;
Search engine module, for the data message query source feature selected according to user, determines data message Query source feature as the taxonomic structure tree of root node, and for according to the taxonomic structure tree determined be user by Level navigation, until user inquires described data message;
Data memory module, is used for storing data message, it is provided that data query source.
8. system as claimed in claim 7, it is characterised in that described acquisition is used for storing data message class The preliminary classification structure tree of mesh structure, particularly as follows:
When the described preliminary classification structure tree for storing data message classification structure is data message issue, press Sighting target quasi-taxonomic structure tree selects foundation.
CN201110308148.8A 2011-10-12 2011-10-12 A kind of storage method and system of data information classification structure Active CN103049444B (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
CN201110308148.8A CN103049444B (en) 2011-10-12 2011-10-12 A kind of storage method and system of data information classification structure
TW101103771A TWI547814B (en) 2011-10-12 2012-02-06 Data classification information storage methods and system structure
PCT/US2012/059794 WO2013055946A1 (en) 2011-10-12 2012-10-11 Data classification
JP2014535883A JP2014528627A (en) 2011-10-12 2012-10-11 Data classification
EP12779245.5A EP2766827A1 (en) 2011-10-12 2012-10-11 Data classification
US13/650,000 US9280611B2 (en) 2011-10-12 2012-10-11 Data classification
US15/050,772 US9690843B2 (en) 2011-10-12 2016-02-23 Data classification

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110308148.8A CN103049444B (en) 2011-10-12 2011-10-12 A kind of storage method and system of data information classification structure

Publications (2)

Publication Number Publication Date
CN103049444A CN103049444A (en) 2013-04-17
CN103049444B true CN103049444B (en) 2016-09-28

Family

ID=47089171

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110308148.8A Active CN103049444B (en) 2011-10-12 2011-10-12 A kind of storage method and system of data information classification structure

Country Status (6)

Country Link
US (2) US9280611B2 (en)
EP (1) EP2766827A1 (en)
JP (1) JP2014528627A (en)
CN (1) CN103049444B (en)
TW (1) TWI547814B (en)
WO (1) WO2013055946A1 (en)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104123302B (en) * 2013-04-27 2018-10-19 广东商文科技有限公司 Search method, apparatus and system
CN104572746B (en) * 2013-10-24 2018-03-20 世纪禾光科技发展(北京)有限公司 A kind of matrix form information issue and access method and system
KR102277087B1 (en) * 2014-08-21 2021-07-14 삼성전자주식회사 Method of classifying contents and electronic device
CN105512118A (en) * 2014-09-22 2016-04-20 珠海金山办公软件有限公司 User demand feedback method and device
US9787730B2 (en) * 2015-09-08 2017-10-10 Hong Fu Jin Precision Industry (Shenzhen) Co., Ltd. Data sharing method and electronic device using same
CN106777096A (en) * 2016-12-14 2017-05-31 努比亚技术有限公司 A kind of file memory method and device
US10721134B2 (en) * 2017-08-30 2020-07-21 Citrix Systems, Inc. Inferring radio type from clustering algorithms
CN108632235B (en) * 2017-08-31 2020-07-07 新华三技术有限公司 Network packet classification decision tree establishment method and device
CN111782898A (en) * 2020-07-07 2020-10-16 华青融天(北京)软件股份有限公司 Data source searching method and device and electronic equipment
CN112380412A (en) * 2020-11-11 2021-02-19 深圳供电局有限公司 Optimization method for screening matching information based on big data

Family Cites Families (36)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2913342B2 (en) * 1990-12-29 1999-06-28 株式会社日立製作所 Information management system
US5446887A (en) * 1993-09-17 1995-08-29 Microsoft Corporation Optimal reorganization of a B-tree
JPH0785102A (en) * 1993-09-20 1995-03-31 Hitachi Ltd Document retrieving method
US5915257A (en) * 1994-10-11 1999-06-22 Brio Technology, Inc. Cross tab analysis and reporting method
US6055515A (en) * 1996-07-30 2000-04-25 International Business Machines Corporation Enhanced tree control system for navigating lattices data structures and displaying configurable lattice-node labels
US6185550B1 (en) * 1997-06-13 2001-02-06 Sun Microsystems, Inc. Method and apparatus for classifying documents within a class hierarchy creating term vector, term file and relevance ranking
US6397221B1 (en) * 1998-09-12 2002-05-28 International Business Machines Corp. Method for creating and maintaining a frame-based hierarchically organized databases with tabularly organized data
US6360227B1 (en) * 1999-01-29 2002-03-19 International Business Machines Corporation System and method for generating taxonomies with applications to content-based recommendations
US6591269B1 (en) * 1999-05-19 2003-07-08 Sybase, Inc. Database system with methodology for online index rebuild
US6711585B1 (en) * 1999-06-15 2004-03-23 Kanisa Inc. System and method for implementing a knowledge management system
AU2001243443A1 (en) 2000-03-09 2001-09-17 The Web Access, Inc. Method and apparatus for performing a research task by interchangeably utilizinga multitude of search methodologies
US20020027567A1 (en) 2000-07-18 2002-03-07 Niamir Bern B. Listing network for classified information
US7239639B2 (en) 2001-12-27 2007-07-03 3Com Corporation System and method for dynamically constructing packet classification rules
TWI223168B (en) * 2003-04-21 2004-11-01 Taiwan Semiconductor Mfg A document query system
US20040230554A1 (en) * 2003-05-15 2004-11-18 Ning An Method of adding data in bulk to a spatial database
US8103540B2 (en) * 2003-06-05 2012-01-24 Hayley Logistics Llc System and method for influencing recommender system
US7165238B2 (en) 2003-06-06 2007-01-16 Intentional Software Corporation Method and system for organizing and manipulating nodes by category in a program tree
US7257571B2 (en) * 2004-01-26 2007-08-14 Microsoft Corporation Automatic query clustering
JP2008547065A (en) * 2004-03-30 2008-12-25 ケルケゴ ソシエダ リミターダ ウニペルソナル エン コンスティトゥシオン Classification tool for complex categorization
US7412452B2 (en) 2005-01-20 2008-08-12 Pi Corporation Data storage and retrieval system with intensional category representations to provide dynamic categorization of information items
US20060288275A1 (en) 2005-06-20 2006-12-21 Xerox Corporation Method for classifying sub-trees in semi-structured documents
AU2006283553B9 (en) * 2005-08-19 2012-12-06 Fourthwall Media, Inc. System and method for recommending items of interest to a user
US20070226073A1 (en) * 2006-03-22 2007-09-27 Wang Kenneth K Garment development and production system utilizing a standardized garment data format
US7778837B2 (en) 2006-05-01 2010-08-17 Microsoft Corporation Demographic based classification for local word wheeling/web search
US7774360B2 (en) * 2006-09-08 2010-08-10 Microsoft Corporation Building bridges for web query classification
US7603367B1 (en) * 2006-09-29 2009-10-13 Amazon Technologies, Inc. Method and system for displaying attributes of items organized in a searchable hierarchical structure
US8140479B2 (en) * 2006-12-21 2012-03-20 International Business Machines Corporation Logical classification of objects on a computer system
US8560398B1 (en) * 2007-03-29 2013-10-15 Amazon Technologies, Inc. Method and system for providing item recommendations
EP2332039A4 (en) 2008-08-11 2012-12-05 Collective Inc Method and system for classifying text
US7991757B2 (en) * 2008-08-12 2011-08-02 Amazon Technologies, Inc. System for obtaining recommendations from multiple recommenders
US8290923B2 (en) * 2008-09-05 2012-10-16 Yahoo! Inc. Performing large scale structured search allowing partial schema changes without system downtime
US20100114902A1 (en) 2008-11-04 2010-05-06 Brigham Young University Hidden-web table interpretation, conceptulization and semantic annotation
US9075871B2 (en) 2008-12-24 2015-07-07 Sap Se Technique to classify data displayed in a user interface based on a user defined classification
US9213767B2 (en) 2009-08-10 2015-12-15 Hewlett-Packard Development Company, L.P. Method and system for characterizing web content
CN101763067B (en) * 2009-12-15 2011-08-31 沈阳飞机工业(集团)有限公司 Quick generation method of numerical control machining scheme of complex parts of airplane
WO2011156605A2 (en) * 2010-06-11 2011-12-15 Doat Media Ltd. A system and methods thereof for enhancing a user's search experience

Also Published As

Publication number Publication date
CN103049444A (en) 2013-04-17
US20160171081A1 (en) 2016-06-16
WO2013055946A1 (en) 2013-04-18
TWI547814B (en) 2016-09-01
EP2766827A1 (en) 2014-08-20
US20130097205A1 (en) 2013-04-18
US9690843B2 (en) 2017-06-27
TW201316190A (en) 2013-04-16
US9280611B2 (en) 2016-03-08
JP2014528627A (en) 2014-10-27

Similar Documents

Publication Publication Date Title
CN103049444B (en) A kind of storage method and system of data information classification structure
CN102456058B (en) Method and device for providing category information
CN101119326B (en) Method and device for managing instant communication conversation record
CN102841736A (en) Handheld electronic device and method for accessing bookmark
CN103226393A (en) Input method and equipment
CN104572889A (en) Method, device and system for recommending search terms
CN102184205B (en) Based on the Multi-Pattern Matching method of easily extensible precision chaos Hash
CN101000623A (en) Method for image identification search by mobile phone photographing and device using the method
CN110019647A (en) A kind of keyword search methodology, device and search engine
CN104143005A (en) Related searching system and method
CN104268295A (en) Data query method and device
CN103902535A (en) Method, device and system for obtaining associational word
CN111639253B (en) Data weight judging method, device, equipment and storage medium
CN104881504A (en) Information search method and device
CN103024149A (en) Mobile terminal and method for processing information content thereof
CN102929987A (en) Search method and search device based on identifier combination
CN101848248A (en) Rule searching method and device
CN103365932A (en) Webpage search method and device
CN102508884A (en) Method and device for acquiring hotpot events and real-time comments
CN105893613A (en) Method and device for searching image identification information
CN106372090A (en) Query clustering method and device
CN101604328A (en) A kind of vertical search method for Internet information
CN104933149A (en) Information searching method and information searching device
CN107515894A (en) A kind of map red packet method and system based on Internet of Things
CN103902687B (en) The generation method and device of a kind of Search Results

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 1179380

Country of ref document: HK

C14 Grant of patent or utility model
GR01 Patent grant
REG Reference to a national code

Ref country code: HK

Ref legal event code: GR

Ref document number: 1179380

Country of ref document: HK