CN101236550B - Method and system for processing tree -type structure data - Google Patents
Method and system for processing tree -type structure data Download PDFInfo
- Publication number
- CN101236550B CN101236550B CN2007100075309A CN200710007530A CN101236550B CN 101236550 B CN101236550 B CN 101236550B CN 2007100075309 A CN2007100075309 A CN 2007100075309A CN 200710007530 A CN200710007530 A CN 200710007530A CN 101236550 B CN101236550 B CN 101236550B
- Authority
- CN
- China
- Prior art keywords
- data
- tree
- character
- ordering
- model
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention discloses a method and a system for processing tree structure data, which solve the problem that the speed of processing and displaying the tree structure data by means of recurrent traversal is slow. The method of the invention comprises the following steps that: information which is used for identifying data hierarchy incidence relations is recorded in node data; all node data of the same tree is read; data lists are obtained after sorting of the node data according to the data hierarchy incidence relations; all the lists are scanned in sequence and outputted, wherein, the data incidence relations are expressed by combination of numeric/alphabetic characters and non-numeric/non-alphabetic characters. The invention can quickly display the tree structure data by traversing the data lists at a time, thereby not only the processing efficiency of the system is improved and the development complexity of data display is reduced but also realization is very simple.
Description
Technical field
The present invention relates to data processing technique, particularly relate to a kind of method and system of handling tree-type structure data.
Background technology
In computer utility, often need to handle the data of tree, as intra-company's institutional framework, product classification, forum's model, mail tabulation or the like.With reference to Fig. 1, it is the exemplary plot of tree-type structure data, for example have a system of forum to show main card and the corresponding follow-up structure according to the tree type, the indentation by the model title embodies the set membership between model, for the user more clearly shows relation between model.Display effect as shown in Figure 1, every data recording is the node of tree, wherein leading card is root node, all follow-up are child node.
In the last example, when database design, the tables of data of record model information comprises following field at least: model ID (id), and main obedient ID (mainId), father's card ID (parentId), model title (topic), model content (content), as shown in Figure 2.Sequence number when wherein, described model ID is the model establishment; The title of follow-up may be identical with the title of main card, also may be different.
At present, show that according to tree the method for certain main card and corresponding follow-up is: from database, read earlier all models (being described main card and its all follow-up) that mainId equals to specify main obedient ID, and deposit a tabulation in according to reading order.Because the storage of model in database arranged according to the sequencing of creating usually, so the model in the tabulation and arrange not according to tree.Therefore, next step is to use recursive algorithm to travel through described model tabulation, and shows model at page higher slice.Provided one section code sample of realizing described recursive algorithm below, can access the model sequence that tree is arranged, shown according to effect output shown in Figure 1.
void?printPosts(List?posts，long?rootId，int?level){
for(int?i＝0；i＜posts.size()；i++){
Post?post＝(Post)posts.get(i)；
if(post.parentId＝＝rootId){
print(post.topic，level)；
printPosts(posts，post.id，level+1)；
}
}
}
But owing to the calculated performance problem that recursive algorithm self exists, speed is slower during the data of the method processing tree of employing recurrence traversal, and works as under the more situation of level especially obvious.For example total total M the model of model tree is divided into the N layer, then shows that with recursive algorithm described model number calculates M*N time altogether, when the M*N enormous amount, need expend a lot of computing times, causes system can not in time respond the demand that the user checks data.
Summary of the invention
Technical matters to be solved by this invention provides a kind of method and system of handling tree-type structure data, to solve the slower problem of data speed of the method processes and displays tree that adopts the recurrence traversal.
For solving the problems of the technologies described above, the invention provides a kind of method of handling tree-type structure data, comprising:
Record is used for the ordering factor of identification data level incidence relation in the node data; The described ordering factor by be used for identification data at the character of the position of tree and the character that is used to distinguish the tree level apart from one another by and constitute; Wherein, described be used for identification data the pairing encoded radio of the character of the position of tree and, be used to distinguish the character corresponding codes value of tree level not in one and same coding value scope;
Read all node data with one tree;
According to the data hierarchy incidence relation of described ordering factor sign, obtain data list after described all node data are sorted;
Described data list of sequential scanning and output.
Wherein, described ordering is to the pairing ASCII encoded radio of the information of identification data level incidence relation, sorts according to the ordering rule of ASCII coding schedule.
Wherein, described data hierarchy incidence relation is with numeral and nonnumeric character, and letter is with alphabetical, and perhaps, the combination of numeral and letter is represented.
Preferably, according to the number of nonnumeric/alphabetic character, need the space number of indentation when judging output data.
Preferably, the root node data of every tree are provided with identical numeral/letter.
The present invention also provides a kind of system that handles tree-type structure data, comprising:
Ordering factor structure unit is used for corresponding each node data, the ordering factor of structure identification data level incidence relation; The described ordering factor by be used for identification data at the character of the position of tree and the character that is used to distinguish the tree level apart from one another by and constitute; Wherein, described be used for identification data the pairing encoded radio of the character of the position of tree and, be used to distinguish the character corresponding codes value of tree level not in one and same coding value scope;
Data capture unit is used to read all the node data with one tree;
Sequencing unit is used for the data hierarchy incidence relation according to described ordering factor sign, obtains data list after the node data are sorted;
Output unit is used for described tabulation of sequential scanning and output.
Wherein, described sequencing unit is to the ordering factor pair ASCII encoded radio of answering, and sorts according to the ordering rule of ASCII coding schedule.
Wherein, the described ordering factor is with numeral and nonnumeric character, alphabetical and non-letter, and perhaps, the combination of numeral and letter is represented.
Preferably, described output unit needs the space number of indentation according to the number of nonnumeric/alphabetic character when judging output data.
Preferably, described ordering factor structure unit is provided with identical numeral/letter to the root node data of every tree.
Compared with prior art, the present invention has the following advantages:
The embodiment of the invention increases an ordering factor in data recording, be used for identifying the interrelated relation of each node record of every tree, structure corresponding sequencing factor values during data recording of every increase.When needs show all nodes records of one tree, at first described factor values ordering is generated data list, order travels through a data list then, just can show tree-type structure data fast, thereby reduce the exploitation complexity of data presentation, the treatment effeciency of raising system, and implement very simple.
Description of drawings
Fig. 1 is the exemplary plot of tree-type structure data in the prior art;
Fig. 2 is the storage organization synoptic diagram of tree-type structure data in Fig. 1 example;
Fig. 3 is the logical organization synoptic diagram that contains the tree-type structure data of the factor that sorts in the embodiment of the invention;
Fig. 4 is the flow chart of steps of the described demonstration tree-type structure data of the embodiment of the invention;
Fig. 5 is a data of database storage synoptic diagram in the embodiment of the invention;
Fig. 6 is according to the data list synoptic diagram after the ordering of the ordering factor in the embodiment of the invention;
Fig. 7 is the system architecture diagram of the described demonstration tree-type structure data of the embodiment of the invention.
Embodiment
For above-mentioned purpose of the present invention, feature and advantage can be become apparent more, the present invention is further detailed explanation below in conjunction with the drawings and specific embodiments.
The invention provides a kind of advantages of simplicity and high efficiency method and show tree-type structure data, following content will be elaborated with the embodiment that is shown as of forum's model.
For reaching display effect shown in Figure 1, the embodiment of the invention has increased a field in the tables of data of record model information when database design, as an ordering factor that shows model on the page.Like this, described tables of data comprises model ID (id), main obedient ID (mainId), father's card ID (parent Id), model title (topic), model content (content), the ordering factor (socter), post the time (time), posting person's fields such as (name), and every model information in the table has all write down described content.
The ordering factor is used to identify the incidence relation between every model information and other models, with reference to shown in Figure 3, be the logical organization synoptic diagram that contains the tree-type structure data of the factor that sorts, can know relation between main card and follow-up and the relation between follow-up and other follow-up by the described ordering factor.The ordering factor is constructed when model is created, for example: the sorter field of this data recording is set to numeral 1 during a newly-increased at every turn main model, during first follow-up of newly-increased described main card accordingly the sorter field be set to character string 1.1, if second follow-up of newly-increased more described main card then respective field is set to character string 1.2, be set to 1.1.1 during the follow-up of newly-increased first follow-up, go down by that analogy, be kept at last in the database record as shown in Figure 3.
When the follow-up number of a model can be constructed the longer ordering factor more for a long time.For example: the sorter value of main card is 1, and the sorter value of " follow-up one " is 1.01, and the sorter value of " first follow-up of follow-up one " is 1.01.01, and the sorter value of " the 12 follow-up of follow-up one " is 1.01.12, by that analogy.
The mode of the above-mentioned structure ordering factor is a preferred version of the present invention.For the data of tree, each main card and follow-up thereof constitute one tree, and every tree can have different ordering factor representation methods, and by numeral 1 beginning, second main card and follow-up thereof are by numeral 2 beginnings, by that analogy as first main card and follow-up thereof.But this method for expressing also is not suitable for the model record of big data quantity, because first bit digital of the ordering factor can row be big more more along with increasing of model, thereby increases the complex structure degree of the ordering factor, takies storage space.Because each main card can be distinguished by model ID, and the ordering factor of distinguishing every tree has little significance, so the embodiment of the invention is preferred, root node (being each main card) to every tree all is provided with the identical ordering factor (as numeral 1), and the data manipulation that simply and not influences every tree is set.
Shown in Figure 3 is the logical organization of a main card and follow-up thereof, the physical storage structure of representative data not, and in the database storing of reality, described model is according to model ID sequential storage.So, when database reads a certain main card and follow-up thereof and show, just need be according to the output of sorting of all models of ordering factor pair.With reference to Fig. 4, be the flow chart of steps of the described demonstration tree-type structure data of the embodiment of the invention.
Preferably, be directly to obtain main obedient ID when reading database, the obedient ID of master under each model can be included in and send to server in the required parameter, server just can directly extract main obedient ID from request like this, has reduced the operation of a reading database.When the database access amount was big, described method for optimizing just can significantly improve treatment effeciency.
Illustrate, the factor that will sort 1 and 1.1 all is 1 according to first of ASCII encoded radio comparison earlier relatively, then compares the character string of back.Because the ASCII encoded radio (46) of ". " character is outside the ASCII of numeral encoded radio (48-57) scope, so can distinguish out the relation of main card and follow-up, follow-up and own follow-up, be that 1.1 model is that the factor that sorts is 1 follow-up by relatively drawing the ordering factor by ". " character.In like manner, ASCII encoded radio relatively, can draw the ordering factor and be 1.2 model also is that the ordering factor is 1 follow-up, but with the ordering factor 1.1 relatively, it is second follow-up.By that analogy, can obtain tactic model tabulation.
Preferably, the embodiment of the invention is in output during model, and the make that makes full use of the ordering factor shows the hierarchical relationship between model, and the sorter field of calculating this model when showing certain model comprises the number of character ". " and the several spaces of corresponding indentation.For example the sorter value of main card is 1 does not need indentation, and the sorter value of " follow-up one " is spaces of 1.1 indentations, and the sorter value of " first follow-up of follow-up one " is then two spaces of indentation of 1.1.1.
By above-mentioned simple operations, order travels through a data list, just can finish the Presentation Function of tree-type structure data fast, has improved the treatment effeciency of system, has reduced the exploitation complexity of data presentation.And said method also is applicable to other subsequent treatment of tree-type structure data, as directly order printing of the data after will sorting, storage, perhaps provides output data etc. for subsequent treatment.
In the foregoing description, the ordering factor is the string representation that is combined by numeral and ". " character or other nonnumeric characters, but the present invention does not limit the make of the ordering factor.The ordering factor can be made of numeral and nonnumeric character (". " character as shown), also can be made of letter and non-alphabetic character, perhaps form by numeral and monogram, or the like, do not enumerate one by one at this.In a word, when the structure ordering factor, only need satisfy in the character code ordering, be used to distinguish character (as ". " character) the pairing encoded radio (46) of tree level, do not get final product in one and same coding value scope with the pairing encoded radio of character (as numeral) (48-57) of the position of identification data in tree.
And, except that the character string of above-mentioned use ASCII coding is constructed the comparison of the ordering factor, the factor values that sorts, the coding that uses other also is feasible, such as using some characters in GBK (Chinese Internal Code Specification) coding to replace these numerals of 0-9 in the example respectively, as long as notice that the clooating sequence of order that these characters sort and digital 0-9 is consistent.Therefore when carrying out data sorting according to the ordering factor, get final product according to corresponding encoded radio ordering, the ordering principle is same as above.
Corresponding above-mentioned advantages of simplicity and high efficiency implementation method, the present invention also provides a kind of system embodiment that shows tree-type structure data, with reference to shown in Figure 7, described system comprises ordering factor structure unit 701, data capture unit 702, sequencing unit 703, output unit 704.Following content is that example describes with forum's model also.
Because when database design, in the tables of data of record model information, increased a field, be used to write down the incidence relation between every model information and other models, as an ordering factor that on the page, shows model, therefore the ordering factor of every record just need be constructed by the factor structure unit 701 that sorts in new model record of every increase in the database.
Described ordering factor structure unit 701 is when the structure ordering factor, need satisfy in the character code ordering, be used to distinguish the pairing encoded radio of character of tree level, with the pairing encoded radio of character of the position of identification data in tree not in one and same coding value scope.The described ordering factor can be made of numeral and nonnumeric character, also can be made of letter and non-alphabetic character, perhaps form by numeral and monogram, or the like.
For example, constitute the string representation ordering factor with numeral and ". " character, the ordering factor values of this data recording is set to numeral 1 during each newly-increased main model, the corresponding sequencing factor values is set to character string 1.1 during first follow-up of newly-increased described main card, if second follow-up of newly-increased more described main card then corresponding ordering factor values is set to character string 1.2, be set to 1.1.1 during the follow-up of newly-increased first follow-up, go down by that analogy, be kept at last in the database record as shown in Figure 3.
And the follow-up number of working as a model can be constructed the longer ordering factor more for a long time.For example: the ordering factor values of main card is 1, and the ordering factor values of " follow-up one " is 1.01, and the ordering factor values of " first follow-up of follow-up one " is 1.01.01, and the ordering factor values of " the 12 follow-up of follow-up one " is 1.01.12, by that analogy.
In a word, the make of ordering factor structure unit 701 is versatile and flexible.And it is preferred, for reducing the complex structure degree, save storage space, when the ordering factor of a plurality of main cards of structure, each main card all is provided with the identical ordering factor (as numeral 1), the operation that simply and not influences the corresponding tree-type structure data of each main card is set.
Preferably, data capture unit 702 is directly to obtain main obedient ID when reading database, the obedient ID of master under each model can be included in and send to server in the required parameter, server just can directly extract main obedient ID from request like this, has reduced the number of operations of reading database.When the database access amount was big, described method for optimizing just can significantly improve treatment effeciency.
And according to the building method difference of the ordering factor, the coding and sorting order that sequencing unit 703 adopts is also different.Except that the ordering rule that uses the ASCII coding schedule, can also use other coding, such as using some characters in GBK (Chinese Internal Code Specification) coding to replace these numerals of 0-9 in the example respectively, as long as notice that the clooating sequence of order that these characters sort and digital 0-9 is consistent.Therefore when carrying out data sorting according to the ordering factor, get final product according to corresponding encoded radio ordering, the ordering principle is same as above.
Preferably, described output unit 704 make that makes full use of the ordering factor shows hierarchical relationship between model.In the ordering factor of representing with numeral and ". " character combination, when showing certain model, the ordering factor of calculating this model comprises the number of character ". ", and the corresponding space of indentation.For example the ordering factor values of main card is 1 does not need indentation, and the ordering factor values of " follow-up one " is spaces of 1.1 indentations, and the ordering factor values of " first follow-up of follow-up one " is then two spaces of indentation of 1.1.1.
The system of the demonstration tree-type structure data that the embodiment of the invention provides, to the advanced line ordering of the data of taking out from database, travel through a data list then, can directly export the data recording of arranging according to tree, improve the treatment effeciency of system, reduced the exploitation complexity of data presentation.And said method also is applicable to other subsequent treatment of tree-type structure data, as directly order printing of the data after will sorting, storage, perhaps provides output data etc. for subsequent treatment.
More than to a kind of method and system of handling tree-type structure data provided by the present invention, be described in detail, used specific case herein principle of the present invention and embodiment are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, part in specific embodiments and applications all can change.In sum, this description should not be construed as limitation of the present invention.
Claims (10)
1. a method of handling tree-type structure data is characterized in that, comprising:
Record is used for the ordering factor of identification data level incidence relation in the node data; The described ordering factor by be used for identification data at the character of the position of tree and the character that is used to distinguish the tree level apart from one another by and constitute; Wherein, described be used for identification data the pairing encoded radio of the character of the position of tree and, be used to distinguish the character corresponding codes value of tree level not in one and same coding value scope;
Read all node data with one tree;
According to the data hierarchy incidence relation of described ordering factor sign, obtain data list after described all node data are sorted;
Described data list of sequential scanning and output.
2. method according to claim 1 is characterized in that: described ordering is to the pairing ASCII encoded radio of the information of identification data level incidence relation, sorts according to the ordering rule of ASCII coding schedule.
3. method according to claim 1 is characterized in that: described data hierarchy incidence relation is with numeral and nonnumeric character, alphabetical and non-letter, and perhaps, the combination of numeral and letter is represented.
4. method according to claim 3 is characterized in that: according to the number of nonnumeric/alphabetic character, need the space number of indentation when judging output data.
5. method according to claim 3 is characterized in that: the root node data of every tree are provided with identical numeral/letter.
6. a system that handles tree-type structure data is characterized in that, comprising:
Ordering factor structure unit is used for corresponding each node data, the ordering factor of structure identification data level incidence relation; The described ordering factor by be used for identification data at the character of the position of tree and the character that is used to distinguish the tree level apart from one another by and constitute; Wherein, described be used for identification data the pairing encoded radio of the character of the position of tree and, be used to distinguish the character corresponding codes value of tree level not in one and same coding value scope;
Data capture unit is used to read all the node data with one tree;
Sequencing unit is used for the data hierarchy incidence relation according to described ordering factor sign, obtains data list after the node data are sorted;
Output unit is used for described tabulation of sequential scanning and output.
7. system according to claim 6 is characterized in that: described sequencing unit is to the ordering factor pair ASCII encoded radio of answering, and sorts according to the ordering rule of ASCII coding schedule.
8. system according to claim 6 is characterized in that: the described ordering factor is with numeral and nonnumeric character, alphabetical and non-letter, and perhaps, the combination of numeral and letter is represented.
9. system according to claim 8 is characterized in that: described output unit needs the space number of indentation according to the number of nonnumeric/alphabetic character when judging output data.
10. system according to claim 8 is characterized in that: described ordering factor structure unit is provided with identical numeral/letter to the root node data of every tree.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100075309A CN101236550B (en) | 2007-02-01 | 2007-02-01 | Method and system for processing tree -type structure data |
| HK08114052.8A HK1120889A1 (en) | 2007-02-01 | 2008-12-30 | A method and system for processing tree-structured data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100075309A CN101236550B (en) | 2007-02-01 | 2007-02-01 | Method and system for processing tree -type structure data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101236550A CN101236550A (en) | 2008-08-06 |
| CN101236550B true CN101236550B (en) | 2010-09-01 |
Family
ID=39920173
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100075309A Expired - Fee Related CN101236550B (en) | 2007-02-01 | 2007-02-01 | Method and system for processing tree -type structure data |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101236550B (en) |
| HK (1) | HK1120889A1 (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102110101B (en) * | 2009-12-29 | 2013-01-16 | 北大方正集团有限公司 | Method and device used for indexing digital content |
| CN102436453B (en) * | 2010-09-29 | 2015-03-11 | 金蝶软件（中国）有限公司 | Method and device for processing parent-child dimension |
| CN103201739B (en) * | 2010-11-09 | 2016-04-20 | 日本电气株式会社 | Messaging device |
| CN103581280B (en) * | 2012-08-30 | 2017-02-15 | 网易传媒科技（北京）有限公司 | Method and device for interface interaction based on micro blog platform |
| CN102902811B (en) * | 2012-10-19 | 2016-09-14 | 北京金和软件股份有限公司 | A kind of database design method quickly generating tree construction |
| CN103324763B (en) * | 2013-07-18 | 2017-02-15 | 北京金和软件股份有限公司 | Presenting method for tree-form data structure of mobile phone terminal |
| CN104102694B (en) * | 2014-06-24 | 2018-11-20 | 用友优普信息技术有限公司 | Tree node sort method and tree node collator |
| CN109684275A (en) * | 2018-12-18 | 2019-04-26 | 清华大学 | Concrete construction is established to the method and system of mark database |
| CN111274349B (en) * | 2020-01-21 | 2020-12-15 | 北方工业大学 | Public security data hierarchical indexing method and device based on information entropy |
| CN113821572A (en) * | 2021-07-19 | 2021-12-21 | 中共四川省委组织部 | Method and equipment for generating organization structure tree based on organization structure coding |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1306256A (en) * | 1999-12-09 | 2001-08-01 | 国际商业机器公司 | Administative user's interface through branched separation |
| CN1353374A (en) * | 2000-11-07 | 2002-06-12 | 毛远青 | Method based on Internet for organizing and managing information |
| CN1485775A (en) * | 2002-09-27 | 2004-03-31 | 英业达股份有限公司 | Display processing system and method for node data of tree structure |
-
2007
- 2007-02-01 CN CN2007100075309A patent/CN101236550B/en not_active Expired - Fee Related
-
2008
- 2008-12-30 HK HK08114052.8A patent/HK1120889A1/en not_active IP Right Cessation
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1306256A (en) * | 1999-12-09 | 2001-08-01 | 国际商业机器公司 | Administative user's interface through branched separation |
| CN1353374A (en) * | 2000-11-07 | 2002-06-12 | 毛远青 | Method based on Internet for organizing and managing information |
| CN1485775A (en) * | 2002-09-27 | 2004-03-31 | 英业达股份有限公司 | Display processing system and method for node data of tree structure |
Also Published As
| Publication number | Publication date |
|---|---|
| HK1120889A1 (en) | 2009-04-09 |
| CN101236550A (en) | 2008-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101236550B (en) | Method and system for processing tree -type structure data | |
| CN109992645B (en) | Data management system and method based on text data | |
| US8843815B2 (en) | System and method for automatically extracting metadata from unstructured electronic documents | |
| CN101593200B (en) | Method for classifying Chinese webpages based on keyword frequency analysis | |
| CN101438283B (en) | Demographic based classification for local word wheeling/WEB search | |
| JP6303594B2 (en) | Table sorting and filtering by image data and symbol data in a single cell | |
| JP6126218B2 (en) | System and method for input assist control by sliding operation in portable terminal equipment | |
| US9558170B2 (en) | Creating and switching a view of a collection including image data and symbolic data | |
| US20150363478A1 (en) | Systems, Devices, and/or Methods for Managing Data | |
| Akhter et al. | Exploring deep learning approaches for Urdu text classification in product manufacturing | |
| GUIDE | Ucinet 6 for windows software for social network analysis | |
| CN102110123B (en) | Method for establishing inverted index | |
| WO2015061046A2 (en) | Method and apparatus for performing topic-relevance highlighting of electronic text | |
| CN110019820A (en) | Main suit and present illness history symptom Timing Coincidence Detection method in a kind of case history | |
| CN112131453A (en) | Method, device and storage medium for detecting network bad short text based on BERT | |
| CN115827862A (en) | Associated acquisition method for multivariate expense voucher data | |
| CN115018588A (en) | Product recommendation method and device, electronic equipment and readable storage medium | |
| CN101770291A (en) | Semantic analysis data hashing storage and analysis methods for input system | |
| CN111782970B (en) | Data analysis method and device | |
| CN101996190A (en) | Method and device for extracting information from webpage | |
| CN113688257B (en) | Author name identity judging method based on large-scale literature data | |
| CN101295312B (en) | Method for presenting data by table | |
| CN113139558A (en) | Method and apparatus for determining a multi-level classification label for an article | |
| CN108897763A (en) | A kind of block chain data conversion system | |
| Tohalino et al. | Using citation networks to evaluate the impact of text length on the identification of relevant concepts |
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: 1120889 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: 1120889 Country of ref document: HK |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100901 Termination date: 20210201 |