CN113704574B - Address standardization method and device - Google Patents
Address standardization method and device Download PDFInfo
- Publication number
- CN113704574B CN113704574B CN202110997680.9A CN202110997680A CN113704574B CN 113704574 B CN113704574 B CN 113704574B CN 202110997680 A CN202110997680 A CN 202110997680A CN 113704574 B CN113704574 B CN 113704574B
- Authority
- CN
- China
- Prior art keywords
- data
- address
- trie
- library
- father
- 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
Links
- 238000011425 standardization method Methods 0.000 title claims abstract description 13
- 238000000034 method Methods 0.000 claims abstract description 25
- 238000004140 cleaning Methods 0.000 claims abstract description 11
- 238000010606 normalization Methods 0.000 claims description 9
- 230000014509 gene expression Effects 0.000 claims description 6
- 230000008521 reorganization Effects 0.000 claims description 5
- 238000012545 processing Methods 0.000 claims description 4
- 238000000547 structure data Methods 0.000 claims description 4
- 238000006467 substitution reaction Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000013589 supplement Substances 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 230000001651 autotrophic effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
Abstract
The invention discloses a method and a device for address standardization, which are used for cleaning address data in an address library, removing 'province, city, county, village, special administrative district and autonomous region' data in the data, and creating and assembling a Trie (prefix tree or dictionary tree) type data structure by acquiring names and short names of province, city, county and village levels in the address library. And matching the parameter entering parameters for calling the address standardization method into a corresponding data set in the Trie data structure through a multimode character string matching algorithm. Traversing the data set combines the data of the same key value into a set such that long addresses overlap short addresses. And finally, rejecting branch data which does not belong to the required address hierarchy through a father-child set relation in the address library, completing the complementation of the father stage to which the branch data belongs, forming standard address data and returning the standard address data. The address unifies the standard, and brings convenience to life and work of people.
Description
Technical Field
The invention relates to the technical field of computer science, in particular to a method and a device for address standardization.
Background
In the rapid development of the information technology of the present society, the application of address standardization is more and more widely used, and the application of computer science and technology is closely related to the life of people. For example, delivery address extraction of logistics express delivery, intelligent car navigation, bank card information filling address verification and the like relate to various fields. Address is not standard or standard, and a plurality of inconveniences are brought to people. For example: when an express delivery person delivers the express, some addresses have a situation of multiple names, which leads to an undefined delivery address and a situation of wrong delivery and repeated delivery, and along with the continuous development of the express industry, delivery address data is continuously increased, and the influence of the nonstandard address on the express industry is not bearable. When we use car navigation to go to the destination, an unnormalized address can lead to navigation deviation and even wrong navigation, resulting in unnecessary time waste. When handling related business of banks, staff often can be required to fill address information, administrative division, mistakes, omission and false phenomena exist in the address information, intelligent early warning and reminding cannot be performed on non-standardized address data such as address insufficiency, mistakes and false, and the risk of banking business is improved. Such as the problems described above, it is necessary to normalize the addresses.
Disclosure of Invention
Therefore, the embodiment of the invention provides a method and a device for address standardization, which are used for solving the problems that addresses are not standard or nonstandard in the prior art and bring a plurality of inconveniences to people.
In order to achieve the above object, the embodiment of the present invention provides the following technical solutions:
in a first aspect, a method of address normalization includes:
data in the address library is subjected to data cleaning to form a Trie data structure set;
the parameter entering parameters of the address standardization method are called to be matched with corresponding data sets in the Trie data structure;
traversing the Trie data set to combine the data with the same key value into a set to form a new data set;
and removing the address hierarchy which does not belong to the requirement from the new data set through the parent-child set relation in the address library, and completing the supplement of the parent level to which the address hierarchy belongs to finally form standard address data.
Further, when data in the address library is cleaned, the method specifically includes:
the method comprises the steps of carrying out positioning keywords on address standard data through a regular expression (the [ province, city, county, village, town, district, special administrative district, autonomous district ] |special administrative district, |autonomous district, $ ]) on the data, and then carrying out coverage replacement by using address names in a library; and assembling the Trie structure data set according to the address name and short name in the address library.
Further, the parameter entering calling the address standardization method is to match the corresponding data set in the Trie data structure through the multimode character string matching algorithm.
Further, when traversing the Trie data set to combine the data with the same key value into a set, the data is perfected and recombined to form a new data set.
Furthermore, the data perfection is to perfect the 'value' column of the Trie data, the data reorganization is to traverse the returned data to reorganize the data structure, to merge the same nodes of the father node, and to cover the short address operation with the long address for the different nodes of the father node.
Further, the data obtained after traversing the Trie data is detailed node data without repeated father level.
Further, the detailed structure of the data is as follows: address node name, start and end character positions, and base information for the current address node.
Further, the set of data structures is formed into three types of data: address name data in the address library, address name data formed by regular matching substitution, address name abbreviation data.
In a second aspect, an apparatus for address normalization includes:
the data cleaning module is used for cleaning the data in the address library to form a Trie data structure set;
the data matching module is used for matching the parameter entering parameters for calling the address standardization method with corresponding data sets in the Trie data structure;
the data combination module is used for traversing the Trie data set to combine the data with the same key value into a set to form a new data set;
and the standard address data processing module is used for removing the address levels which do not belong to the requirements from the set through the father-son set relation in the address library, completing the complementation of the father level to which the address levels belong, and finally forming standard address data.
Further, the data combination module includes:
the data perfecting module is used for perfecting a value column of the Trie data;
and the data reorganization module is used for traversing the returned data to reorganize the data structure, merging the nodes with the same father node, and overlapping the nodes with different father nodes with long addresses to obtain short addresses.
The invention has at least the following beneficial effects: the address data in the address library is subjected to data cleaning, the data of province, city, county, village, town, special administrative district and autonomous region in the data are removed, and a data structure in the form of a Trie (prefix tree or dictionary tree) is created and assembled by acquiring names and short names of province, city, county and village levels in the address library. And matching the parameter entering parameters for calling the address standardization method into a corresponding data set in the Trie data structure through a multimode character string matching algorithm. Traversing the data set combines the data of the same key value into a set such that long addresses overlap short addresses. And finally, rejecting branch data which does not belong to the required address hierarchy through a father-child set relation in the address library, completing the complementation of the father stage to which the branch data belongs, forming standard address data and returning the standard address data. The address unifies the standard, and brings convenience to life and work of people.
Drawings
In order to more clearly illustrate the prior art and the present invention, the drawings used in the description of the prior art and the embodiments of the present invention will be briefly described. It will be apparent to those skilled in the art that the drawings in the following description are merely exemplary and that other drawings may be derived from the drawings provided without the inventive effort to those skilled in the art.
The structures, proportions, sizes, etc. shown in the present specification are shown only for the purposes of illustration and description, and are not intended to limit the scope of the invention, which is defined by the claims, for example, modifications, variations in proportions, or otherwise, used in the practice of the invention, which are particularly adapted to specific environments without departing from the spirit and scope of the invention.
FIG. 1 is a flowchart of an overall method for address normalization according to an embodiment of the present invention;
fig. 2 is a data structure diagram of a Trie provided in an embodiment of the present invention;
fig. 3 is a flowchart of a Trie data structure set provided in an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.
In the description of the present invention, unless otherwise indicated, the meaning of "a plurality" is two or more. The terms "first," "second," "third," "fourth," and the like in the description and in the claims of the invention, if any, are intended to distinguish between the referenced objects. For schemes with time sequence flows, such term expressions are not necessarily to be understood as describing a specific order or sequence, nor are such term expressions to distinguish between importance levels, positional relationships, etc. for schemes with device structures.
Furthermore, the terms "comprises," "comprising," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements that are expressly listed but may include other steps or elements not expressly listed but inherent to such process, method, article, or apparatus or steps or elements that may be added based on a further optimization of the inventive concept.
The invention provides a method for address standardization, which comprises the following steps:
s1: and (3) cleaning the data in the address library, removing the data of province, city, county, village, special administrative area and autonomous area, and splicing the Trie data structure by combining the corresponding name and short name in the address library.
The formation of the data structure set is divided into three types of data: address name data in the address library, address name data formed by regular matching substitution, address name abbreviation data.
Specifically, when data in the address library is cleaned, positioning keywords are used for address standard data by applying regularities (the province, the city, the county, the special administrative district and the autonomous district) aiming at the data with the province, the county, the special administrative district and the autonomous district, and the address names in the address library are replaced by coverage; and assembling the Trie structure data according to the address name and abbreviation in the address library.
Referring to fig. 2, fig. 2 shows a data structure of a Trie, which is also called a dictionary tree or a prefix tree, in computer science, and is an ordered tree for storing an associated array, and is characterized in that all descendants of a node have the same prefix, that is, a string corresponding to the node, and a root node corresponds to an empty string. The Trie data structure typically contains "keys" which are node names, and "values" which are specific entity structures. The key value in Trie is the address name or its abbreviation.
Referring to fig. 3, more specifically:
s101: adding the complete address name data in the address library into a Trie data structure set;
s102: judging whether the address name in the address library is abbreviated, if so, adding the abbreviated address data into a Trie data structure set (if so, splitting, traversing and adding);
s103: the new value is added to the Trie data structure by matching the value with the key in the complete address name of the address with the regular expression "([ province and county village and township area ] |special administrative area|autonomous area) $". Finally, the addition of three pieces of data of one address is formed.
Taking "X-summer X-family autotrophic area" as an example:
s101: adding the X-summer X-family autonomous region into a Trie data structure set;
s102: the data of the X-summer X-family autonomous region in the address library is called X-summer, and the X-summer data is added into the Trie data structure set;
s103, replacing the character of the "autonomous region" matched in the "X summer X family autonomous region" with null through regularization, changing the data into the "X summer X family", and adding the data into the Trie data structure set, so that one piece of address data of the "X summer X family autonomous region" forms three pieces of enumeration data in the Trie data structure set.
S2: and matching the parameter entering parameters for calling the address standardization method with the corresponding data set in the Trie data structure through a multimode character string matching algorithm.
Specifically, parameters of the calling method are matched with corresponding data sets in the Trie data structure through a multimode character string matching algorithm. A multimode string matching algorithm (Aho-Corasick), also known as an AC automaton, is a computer science used to match substrings in a finite set of "dictionaries" (sets of Trie data structures) in an input string of strings (corresponding to the parameter of our method). The algorithm is different from the common character string matching, and can be matched with all dictionary strings at the same time, so that the matching speed is remarkably improved.
More specifically, the multimode string matching algorithm (Aho-Corasick) principle is to first cache the following three cases through a vocabulary at the beginning:
jumping according to character transfer
Skipping in response to character transfer failure
Successful matching output table
In the matching process, matching does not need to be performed from the beginning of a new slave document, but the jump is performed directly through the buffer, so that the time complexity similar to linearity is realized.
S3: traversing the Trie data set combines the data of the same key value into a set, if the key values are different, the key value of the long address is covered with the key value of the short address, and the different key values are added into the set to form a new data set.
Specifically, in step S3, the data returned in step S2 is perfected and reassembled. The data perfection is embodied in a 'value' column of perfecting Trie data, wherein 'key' is the name or short of an address, and 'value' is specific information corresponding to the address, such as: address coding, parent level to which it belongs, address level, etc. The data reorganization will traverse the data returned in S2 to recombine the data structure, and perform the operation of "long address override short address" on the same value of the node, that is, different types of "key" values operate according to the logic of "long address override short address". For example, the data of "XYuan City" and "XYuan" will be overlaid with the data of "XYuan" in the list. For another example: the parent level of the X shop is X original city and X celebration straight city, and then the X shop needs to be added.
The data obtained after traversing the Trie data again is detailed node data without repeated father level. The data detailed structure is as follows: address node name, start and end character position, and basic information of the current address node (address code, address name, address hierarchy, all parent IDs of the current address, abbreviation).
S4: and removing the address hierarchy which does not belong to the requirement from the new data set through the parent-child set relation in the address library, and completing the supplement of the parent level to which the address hierarchy belongs to finally form standard address data.
Step S4 is the last data processing before the data is formed into the table conversion address. Traversing the data structures, and completing the father level of each piece of data meeting the condition set according to the AllParentId (all father level IDs of the current address) in each data structure, thereby finally forming all standardized address sets meeting the condition.
An embodiment of the present invention provides an apparatus for address normalization, including:
the data cleaning module is used for cleaning the data in the address library to form a Trie data structure set;
the data matching module is used for matching the parameter entering parameters for calling the address standardization method with corresponding data sets in the Trie data structure;
the data combination module is used for traversing the Trie data set to combine the data with the same key value into a set to form a new data set;
and the standard address data processing module is used for removing the address levels which do not belong to the requirements from the set through the father-son set relation in the address library, completing the complementation of the father level to which the address levels belong, and finally forming standard address data.
The data combination module comprises a data perfecting module and a data reorganizing module, wherein the data perfecting module is used for perfecting the 'value' column of the Trie data; the data reorganization module is used for traversing the returned data to reorganize the data structure, merging the nodes with the same father node, and overlapping the nodes with different father nodes with long addresses to obtain short addresses.
Any combination of the technical features of the above embodiments may be performed (as long as there is no contradiction between the combination of the technical features), and for brevity of description, all of the possible combinations of the technical features of the above embodiments are not described; these examples, which are not explicitly written, should also be considered as being within the scope of the present description.
The invention has been described above with particularity and detail in connection with general description and specific embodiments. It should be noted that it is obvious that several variations and modifications can be made to these specific embodiments without departing from the spirit of the present invention, which are all within the scope of protection of the present application. Accordingly, the scope of protection of the present application is to be determined by the claims appended hereto.
Claims (8)
1. A method of address normalization, comprising:
data in the address library is subjected to data cleaning to form a Trie data structure set;
the parameter entering parameters of the address standardization method are called to be matched with corresponding data sets in the Trie data structure;
traversing the Trie data set to combine the data with the same key value into a set to form a new data set;
removing address levels which do not belong to the requirements from the new data set through father-child set relations in the address library, completing complementation of the father level to which the address levels belong, and finally forming standard address data;
when data in the address library is cleaned, the method specifically comprises the following steps:
the method comprises the steps of carrying out positioning keywords on address standard data through a regular expression (the [ province, city, county, village, town, district, special administrative district, autonomous district ] |special administrative district, |autonomous district, $ ]) on the data, and then carrying out coverage replacement by using address names in a library; assembling a Trie structure data set according to the address name and abbreviation in the address library;
the parameter entering calling the address standardization method is to match the corresponding data set in the Trie data structure through the multimode character string matching algorithm.
2. The method of claim 1, wherein traversing the Trie data set to combine data of the same key values into a set is performed by perfecting and reorganizing the data to form a new data set.
3. The method of address normalization according to claim 2, wherein the data perfecting is perfecting a "value" column of Trie data, the data reorganizing is traversing returned data to reorganize a data structure, merging nodes with the same parent node, and overlaying nodes with different parent nodes with long addresses.
4. The method of claim 1, wherein the data obtained by traversing Trie data is detailed node data without repeated parent.
5. The method of address normalization according to claim 4, wherein the data detail structure is: address node name, start and end character positions, and base information for the current address node.
6. The method of address normalization according to claim 1, wherein the set of data structures is formed in three data types: address name data in the address library, address name data formed by regular matching substitution, address name abbreviation data.
7. An apparatus for address normalization, comprising:
the data cleaning module is used for cleaning the data in the address library to form a Trie data structure set;
the data matching module is used for matching the parameter entering parameters for calling the address standardization method with corresponding data sets in the Trie data structure;
the data combination module is used for traversing the Trie data set to combine the data with the same key value into a set to form a new data set;
the standard address data processing module is used for removing address levels which do not belong to requirements from the set through father-child set relations in the address library, completing complementation of the father level to which the address levels belong, and finally forming standard address data;
when data in the address library is cleaned, the method specifically comprises the following steps:
the method comprises the steps of carrying out positioning keywords on address standard data through a regular expression (the [ province, city, county, village, town, district, special administrative district, autonomous district ] |special administrative district, |autonomous district, $ ]) on the data, and then carrying out coverage replacement by using address names in a library; assembling a Trie structure data set according to the address name and abbreviation in the address library;
the parameter entering calling the address standardization method is to match the corresponding data set in the Trie data structure through the multimode character string matching algorithm.
8. The apparatus of claim 7, wherein the data combining module comprises:
the data perfecting module is used for perfecting a value column of the Trie data;
and the data reorganization module is used for traversing the returned data to reorganize the data structure, merging the nodes with the same father node, and overlapping the nodes with different father nodes with long addresses to obtain short addresses.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110997680.9A CN113704574B (en) | 2021-08-27 | 2021-08-27 | Address standardization method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110997680.9A CN113704574B (en) | 2021-08-27 | 2021-08-27 | Address standardization method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113704574A CN113704574A (en) | 2021-11-26 |
| CN113704574B true CN113704574B (en) | 2024-02-09 |
Family
ID=78656209
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110997680.9A Active CN113704574B (en) | 2021-08-27 | 2021-08-27 | Address standardization method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113704574B (en) |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100911762B1 (en) * | 2008-06-23 | 2009-08-11 | (주)지디에스케이 | System and method for standardizing address |
| CN106649464A (en) * | 2016-09-26 | 2017-05-10 | 深圳市数字城市工程研究中心 | Method of building Chinese address tree and device |
| CN107133215A (en) * | 2017-05-20 | 2017-09-05 | 复旦大学 | A kind of Chinese canonical address recognition methods of offline handwriting |
| CN108228825A (en) * | 2018-01-02 | 2018-06-29 | 北京市燃气集团有限责任公司 | A kind of station address data cleaning method based on participle |
| CN109033225A (en) * | 2018-06-29 | 2018-12-18 | 福州大学 | Chinese address identifying system |
| CN109815498A (en) * | 2019-01-25 | 2019-05-28 | 深圳市小赢信息技术有限责任公司 | A kind of Chinese address standardized method, device and electronic equipment |
| WO2020168750A1 (en) * | 2019-02-18 | 2020-08-27 | 平安科技（深圳）有限公司 | Address information standardization method and apparatus, computer device and storage medium |
| CN112269839A (en) * | 2020-11-18 | 2021-01-26 | 网易（杭州）网络有限公司 | Data storage method and device in block chain, electronic equipment and storage medium |
| CN112364114A (en) * | 2020-11-16 | 2021-02-12 | 深圳壹账通智能科技有限公司 | Address standardization method and device, computer equipment and storage medium |
| CN112632213A (en) * | 2020-12-03 | 2021-04-09 | 大箴(杭州)科技有限公司 | Address information standardization method and device, electronic equipment and storage medium |
| CN112749169A (en) * | 2021-01-20 | 2021-05-04 | 北京明略昭辉科技有限公司 | Address tree construction method, address planning specification method, device and electronic equipment |
| CN112835894A (en) * | 2021-01-25 | 2021-05-25 | 武汉烽火普天信息技术有限公司 | Address matching method based on address coding and similarity calculation |
| CN112836497A (en) * | 2021-01-29 | 2021-05-25 | 上海寻梦信息技术有限公司 | Address correction method, device, electronic equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10282436B2 (en) * | 2017-01-04 | 2019-05-07 | Samsung Electronics Co., Ltd. | Memory apparatus for in-place regular expression search |
-
2021
- 2021-08-27 CN CN202110997680.9A patent/CN113704574B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100911762B1 (en) * | 2008-06-23 | 2009-08-11 | (주)지디에스케이 | System and method for standardizing address |
| CN106649464A (en) * | 2016-09-26 | 2017-05-10 | 深圳市数字城市工程研究中心 | Method of building Chinese address tree and device |
| CN107133215A (en) * | 2017-05-20 | 2017-09-05 | 复旦大学 | A kind of Chinese canonical address recognition methods of offline handwriting |
| CN108228825A (en) * | 2018-01-02 | 2018-06-29 | 北京市燃气集团有限责任公司 | A kind of station address data cleaning method based on participle |
| CN109033225A (en) * | 2018-06-29 | 2018-12-18 | 福州大学 | Chinese address identifying system |
| CN109815498A (en) * | 2019-01-25 | 2019-05-28 | 深圳市小赢信息技术有限责任公司 | A kind of Chinese address standardized method, device and electronic equipment |
| WO2020168750A1 (en) * | 2019-02-18 | 2020-08-27 | 平安科技（深圳）有限公司 | Address information standardization method and apparatus, computer device and storage medium |
| CN112364114A (en) * | 2020-11-16 | 2021-02-12 | 深圳壹账通智能科技有限公司 | Address standardization method and device, computer equipment and storage medium |
| CN112269839A (en) * | 2020-11-18 | 2021-01-26 | 网易（杭州）网络有限公司 | Data storage method and device in block chain, electronic equipment and storage medium |
| CN112632213A (en) * | 2020-12-03 | 2021-04-09 | 大箴(杭州)科技有限公司 | Address information standardization method and device, electronic equipment and storage medium |
| CN112749169A (en) * | 2021-01-20 | 2021-05-04 | 北京明略昭辉科技有限公司 | Address tree construction method, address planning specification method, device and electronic equipment |
| CN112835894A (en) * | 2021-01-25 | 2021-05-25 | 武汉烽火普天信息技术有限公司 | Address matching method based on address coding and similarity calculation |
| CN112836497A (en) * | 2021-01-29 | 2021-05-25 | 上海寻梦信息技术有限公司 | Address correction method, device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113704574A (en) | 2021-11-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5909570A (en) | Template mapping system for data translation | |
| JP2718881B2 (en) | Token identification system | |
| US20050177578A1 (en) | Efficient type annontation of XML schema-validated XML documents without schema validation | |
| CN110738027B (en) | Computer-implemented method, apparatus, and storage medium for generating spreadsheet formulas | |
| US20150278268A1 (en) | Data encoding and corresponding data structure | |
| JPH11505052A (en) | System and method for reducing search range of lexical dictionary | |
| JP2009259284A (en) | Method of querying structure of compressed data | |
| CN105550225A (en) | Index construction method and query method and apparatus | |
| WO2019118151A1 (en) | Split mapping for dynamic rendering and maintaining consistency of data processed by applications | |
| CN111400354B (en) | Machine tool manufacturing BOM (Bill of Material) storage query and tree structure construction method based on MES (manufacturing execution System) | |
| CN109800337B (en) | Multi-mode regular matching algorithm suitable for large alphabet | |
| CN101425007B (en) | Method capable of structuredly displaying electronic table function cue | |
| CN113704574B (en) | Address standardization method and device | |
| US20210406229A1 (en) | Schema Agnostic Migration Of Delineated Data Between Relational Databases | |
| CN110221778A (en) | Processing method, system, storage medium and the electronic equipment of hotel's data | |
| CN110032664A (en) | A method of quickly establishing the full node address index of bit coin block chain | |
| CN111090636B (en) | Efficient tracing method based on one-object-one-code | |
| CN103488639B (en) | A kind of querying method of XML data | |
| US8204917B2 (en) | Apparatus, method, and computer program product thereof for storing a data and data storage system comprising the same | |
| US8849866B2 (en) | Method and computer program product for creating ordered data structure | |
| CN110647577A (en) | Data cube partitioning method and device, computer equipment and storage medium | |
| CN102193967B (en) | The relatively value of bounded domain | |
| CN113886445A (en) | Implementation method for specifying mapping contents of multiple data dictionaries in unloading processing process | |
| CN113947349A (en) | Material data processing method and system | |
| EP1387292A1 (en) | Method and apparatus for combining data of biological sequences into a non-redundant data source |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |