CN112069232A - Method and device for inquiring broadband service coverage area - Google Patents
Method and device for inquiring broadband service coverage area Download PDFInfo
- Publication number
- CN112069232A CN112069232A CN202010935351.7A CN202010935351A CN112069232A CN 112069232 A CN112069232 A CN 112069232A CN 202010935351 A CN202010935351 A CN 202010935351A CN 112069232 A CN112069232 A CN 112069232A
- Authority
- CN
- China
- Prior art keywords
- segmentation
- cell
- coverage
- segmentation segment
- name
- 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.)
- Granted
Links
Images
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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2468—Fuzzy queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/242—Query formulation
- G06F16/243—Natural language query formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/20—Natural language analysis
- G06F40/279—Recognition of textual entities
- G06F40/289—Phrasal analysis, e.g. finite state techniques or chunking
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Artificial Intelligence (AREA)
- Fuzzy Systems (AREA)
- Health & Medical Sciences (AREA)
- Audiology, Speech & Language Pathology (AREA)
- General Health & Medical Sciences (AREA)
- Automation & Control Theory (AREA)
- Probability & Statistics with Applications (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method and a device for inquiring a broadband service coverage area, wherein the method comprises the following steps: acquiring each first segmentation segment contained in the covering cell name of the broadband covering cell data record, and setting the score of the covering cell name corresponding to the first segmentation segment; storing each first segmentation segment corresponding to each broadband coverage cell data record and a coverage cell set corresponding to each first segmentation segment in a segmentation index base; the coverage cell set is used for storing the names of coverage cells containing the first segmentation segments and scores of the coverage cells corresponding to the first segmentation segments; and acquiring each second segmentation segment contained in the query cell name, and determining a query result according to the first segmentation segment matched with each second segmentation segment in the segmentation index library and the score of each coverage cell name corresponding to the first segmentation segment in the coverage cell set corresponding to the first segmentation segment. The method improves the comprehensiveness and reliability of the query result.
Description
Technical Field
The invention relates to the field of electronic information, in particular to a method and a device for inquiring a broadband service coverage area.
Background
With the rapid development of broadband services and the current situation of popularization of the mobile internet, the demand for on-line collection of broadband installation becomes an important component of the development of the broadband services at present. Whether the user-installed broadband requirements can be met depends to a great extent on: whether the cell in which the user is located has achieved optical fiber coverage.
The current inquiry method of broadband cell coverage is mainly based on the comparison between the information filled by the user and the coverage cell library, and the most similar information is searched and provided for the user to be selected. The comparison method comprises a database SQL query method (including direct query and fuzzy query) and a character string matching algorithm (such as KMP). For example, in the database SQL query method, taking fuzzy query as an example, a cell name and a county area input by the foreground are used as query conditions, wild cards are added before and after the cell name, and all queried results are provided for the user to select. In the character string matching algorithm, taking a KMP algorithm as an example, taking a cell name input by a user as S1, taking all covered cells of an input county area from a database as a list SList, circularly taking a cell name from the SList as S2, firstly taking S1 as a main string and S2 as a substring for matching, and if the cell name is not matched, taking S2 as the main string and S1 as the substring for matching, and displaying S2 for recording successful matching to the user for selection.
However, in the process of implementing the present invention, the inventor finds that the existing broadband cell coverage query method has the following disadvantages: firstly, based on the database SQL query method, the query is usually only whether the covered cell name in the database contains the cell name to be searched, for example, if the cell is the cell of the western garden, and the cell name stored in the database is the western garden, the cell name cannot be matched with the western garden accurately, so that the cell name cannot be matched with the western garden. Secondly, based on a character string matching method, if wrongly written characters exist in the cell name input by the user, a matching algorithm is invalid; the designation of a cell is not consistent with the designation of a coverage cell, such as a starlight garden, commonly referred to as a starlight cell, and the use of a starlight garden to match a starlight cell may also fail.
Disclosure of Invention
In view of the above, the present invention is proposed to provide a method and apparatus for querying a coverage area of a broadband service, which overcome the above problems or at least partially solve the above problems.
According to an aspect of the present invention, there is provided a method for querying a coverage area of a broadband service, including:
acquiring each first segmentation segment contained in a coverage cell name corresponding to a broadband coverage cell data record, and setting the score of the coverage cell name corresponding to the first segmentation segment according to the appearance sequence of each first segmentation segment in the coverage cell name;
storing each first segmentation segment corresponding to each broadband coverage cell data record and a coverage cell set corresponding to each first segmentation segment in a preset segmentation index base; the coverage cell set corresponding to the first segmentation segment is used for storing each coverage cell name containing the first segmentation segment and the score of each coverage cell name corresponding to the first segmentation segment;
and obtaining each second segmentation segment contained in the query cell name, and determining a query result corresponding to the query cell name according to scores of the first segmentation segment corresponding to each second segmentation segment in the segmentation index library and each coverage cell name in the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment.
According to another aspect of the present invention, there is provided an apparatus for querying a coverage area of a broadband service, including:
the acquisition module is suitable for acquiring each first segmentation segment contained in a coverage cell name corresponding to the broadband coverage cell data record, and setting the score of the coverage cell name corresponding to the first segmentation segment according to the appearance sequence of each first segmentation segment in the coverage cell name;
the index storage module is suitable for storing each first segmentation segment corresponding to each broadband coverage cell data record and a coverage cell set corresponding to each first segmentation segment in a preset segmentation index base; the coverage cell set corresponding to the first segmentation segment is used for storing each coverage cell name containing the first segmentation segment and the score of each coverage cell name corresponding to the first segmentation segment;
and the query module is suitable for acquiring each second segmentation segment contained in the query cell name, and determining a query result corresponding to the query cell name according to the scores of the first segmentation segment corresponding to each second segmentation segment in the segmentation index library and each coverage cell name in the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment.
According to still another aspect of the present invention, there is provided an electronic apparatus including: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is used for storing at least one executable instruction, and the executable instruction enables the processor to execute the operation corresponding to the query method of the broadband service coverage.
According to still another aspect of the present invention, there is provided a computer storage medium, in which at least one executable instruction is stored, and the executable instruction causes a processor to execute an operation corresponding to the above query method for broadband service coverage.
In the method and the device for inquiring the coverage range of the broadband service, first, each first segmentation segment contained in the coverage cell name corresponding to the data record of the broadband coverage cell is obtained, and the score of the coverage cell name corresponding to the first segmentation segment is set according to the appearance sequence of each first segmentation segment in the coverage cell name; then, storing each first segmentation segment corresponding to each broadband coverage cell data record and a coverage cell set corresponding to each first segmentation segment in a preset segmentation index base; the coverage cell set corresponding to the first segmentation segment is used for storing each coverage cell name containing the first segmentation segment and the score of each coverage cell name corresponding to the first segmentation segment; and finally, acquiring each second segmentation segment contained in the query cell name, and determining a query result corresponding to the query cell name according to scores of the first segmentation segment corresponding to the first segmentation segment in the first segmentation segment matched with each second segmentation segment in the segmentation index library and the coverage cell name corresponding to the first segmentation segment matched with each second segmentation segment in the coverage cell set. Therefore, the method carries out query by means of the word segmentation segments, so that the complete cell name is split into the word segmentation segments, a query result can be given under the condition that the names cannot be accurately matched, and the comprehensiveness and the reliability of the query result are improved.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1 is a flowchart illustrating a method for querying a coverage area of a broadband service according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating a method for querying a coverage area of a broadband service according to a second embodiment of the present invention;
fig. 3 is a structural diagram illustrating an inquiry apparatus for broadband service coverage according to a third embodiment of the present invention;
fig. 4 shows a schematic structural diagram of an electronic device according to a fifth embodiment of the present invention;
fig. 5 shows a schematic structure diagram of the participle index database.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
Example one
Fig. 1 shows a flowchart of a method for querying a coverage area of a broadband service according to an embodiment of the present invention. As shown in fig. 1, the method includes:
step S110: acquiring each first segmentation segment contained in the covering cell name corresponding to the broadband covering cell data record, and setting the score of the covering cell name corresponding to the first segmentation segment according to the appearance sequence of each first segmentation segment in the covering cell name.
The broadband coverage cell data record is used for storing relevant information of a cell covered by the broadband service, and specifically includes contents such as a cell location and a cell name of the covered cell. Specifically, the word segmentation processing is performed on the coverage cell name corresponding to the broadband coverage cell data record, so as to obtain each first word segmentation included in the coverage cell name.
Since a plurality of first segmentation segments are included in one coverage cell name, the appearance order of each first segmentation segment in the coverage cell name is different, and the score of the coverage cell name corresponding to the first segmentation segment is set according to the appearance order of each first segmentation segment in the coverage cell name. For example, the score of the first segmentation segment closer to the middle is higher, and the score of the first segmentation segment closer to the head and tail is lower.
Step S120: storing each first segmentation segment corresponding to each broadband coverage cell data record and a coverage cell set corresponding to each first segmentation segment in a preset segmentation index base; the coverage cell set corresponding to the first segmentation segment is used for storing each coverage cell name containing the first segmentation segment and the score of each coverage cell name corresponding to the first segmentation segment.
The method comprises the steps of summarizing first segmentation segments corresponding to broadband coverage cell data records, summarizing coverage cell names including the first segmentation segments aiming at the first segmentation segments, adding the coverage cell names including the first segmentation segments into coverage cell sets corresponding to the first segmentation segments, and further storing scores of the coverage cell names corresponding to the first segmentation segments aiming at the coverage cell names.
Step S130: and obtaining each second segmentation segment contained in the query cell name, and determining a query result corresponding to the query cell name according to scores of the first segmentation segment corresponding to each first segmentation segment in the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment and the first segmentation segment matched with each second segmentation segment in the segmentation index library.
The query cell name is a cell name of whether the broadband coverage is required to be queried, and can be obtained through user input and other modes. A segmentation process is performed on the query cell name to determine the various second segmentation segments contained therein. And matching the second segmentation segment with each first segmentation segment in the segmentation index library to obtain a coverage cell set corresponding to the successfully matched first segmentation segment, and determining a query result corresponding to the query cell name according to the score of each coverage cell name in the obtained coverage cell set corresponding to the first segmentation segment.
Therefore, the method carries out query by means of the word segmentation segments, so that the complete cell name is split into the word segmentation segments, a query result can be given under the condition that the names cannot be accurately matched, and the comprehensiveness and the reliability of the query result are improved.
Example two
Fig. 2 shows a flowchart of a method for querying a coverage area of a broadband service according to a second embodiment of the present invention. As shown in fig. 2, the method includes:
step S210: and acquiring each first segmentation segment contained in the coverage cell name corresponding to the broadband coverage cell data record, and setting the score of the coverage cell name corresponding to the first segmentation segment according to the appearance sequence of each first segmentation segment in the coverage cell name.
The broadband coverage cell data record is used for storing relevant information of a cell covered by the broadband service, and specifically includes contents such as a cell location and a cell name of the covered cell. Specifically, the word segmentation processing is performed on the coverage cell name corresponding to the broadband coverage cell data record, so as to obtain each first word segmentation included in the coverage cell name. Since a plurality of first segmentation segments are included in one coverage cell name, the appearance order of each first segmentation segment in the coverage cell name is different, and the score of the coverage cell name corresponding to the first segmentation segment is set according to the appearance order of each first segmentation segment in the coverage cell name. For example, the score of the first segmentation segment closer to the middle is higher, and the score of the first segmentation segment closer to the head and tail is lower.
Specifically, an order number is set for each first segmentation segment in the coverage cell name; and setting the score of the coverage cell name corresponding to the first segmentation segment according to the sequence number of each first segmentation segment and the total number corresponding to the coverage cell name. For example, the first segmentation segment appearing in the coverage cell name is numbered 1 in order, the second first segmentation segment appearing in the coverage cell name is numbered 2 … … in order, and so on. Assuming that the coverage cell name is for containing n first segmentation segments, the score (i) of the coverage cell name corresponding to the ith first segmentation segment is calculated by the following formula:
score(i)＝(n-|i-1-n/2|)/n
the score of the coverage cell name corresponding to the first segmentation segment is in a value range of [0.5,1], and the score is higher when the coverage cell name is closer to the middle segmentation segment; the lower the score of the participle closer to the two ends is, the score values of the conditions of 'cell', 'garden', 'dormitory' appearing at the end, the name of the county and the district at the beginning, the name of the village and the town and the like can be effectively reduced, and the accuracy of the matching result is improved.
Step S220: storing each first segmentation segment corresponding to each broadband coverage cell data record and a coverage cell set corresponding to each first segmentation segment in a preset segmentation index base; the coverage cell set corresponding to the first segmentation segment is used for storing each coverage cell name containing the first segmentation segment and the score of each coverage cell name corresponding to the first segmentation segment.
The method comprises the steps of summarizing first segmentation segments corresponding to broadband coverage cell data records, summarizing coverage cell names including the first segmentation segments aiming at the first segmentation segments, adding the coverage cell names including the first segmentation segments into coverage cell sets corresponding to the first segmentation segments, and further storing scores of the coverage cell names corresponding to the first segmentation segments aiming at the coverage cell names. Since a first segmentation segment may appear in multiple coverage cell names at the same time, for each first segmentation segment, the coverage cell names corresponding to the first segmentation segment are summarized into the coverage cell set corresponding to the first segmentation segment.
In addition, considering that there may be duplicate cells in different regions, in order to improve accuracy, when acquiring each first segmentation segment included in the coverage cell name corresponding to the broadband coverage cell data record, further extracting a region identifier included in the broadband coverage cell data record; correspondingly, when storing each first segmentation segment corresponding to each broadband coverage cell data record in a preset segmentation index library, further setting a plurality of segmentation index sub-libraries corresponding to region identifications respectively, and storing each first segmentation segment corresponding to each broadband coverage cell data record in each segmentation index sub-library according to the region identifications contained in each broadband coverage cell data record. The region identifier may be an identifier of a city, a district, a county, or the like.
Step S230: and acquiring each second segmentation segment contained in the query cell name.
The query cell name is a cell name of whether the broadband coverage is required to be queried, and can be obtained through user input and other modes. A segmentation process is performed on the query cell name to determine the various second segmentation segments contained therein.
Step S240: and determining a query result corresponding to the query cell name according to the scores of the first segmentation segment matched with each second segmentation segment in the segmentation index library and each coverage cell name in the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment, which correspond to the first segmentation segment.
In order to avoid the influence caused by the region difference, in the step, a region identifier contained in the query cell name is further obtained; and determining a query result corresponding to the query cell name according to scores of the first segmentation segment matched with each second segmentation segment in the segmentation index sub-library corresponding to the region identification contained in the query cell name and each coverage cell name in the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment, which correspond to the first segmentation segment. That is, in each query process, only the sub-library of the participle index matched with the region range of the current query cell name is queried, so that the phenomenon that the same cell name appears in the sub-libraries corresponding to different regions is avoided.
The following is a description of specific implementation details of this step:
firstly, a coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment is determined as a target cell set. And then, determining the cell values of the names of the coverage cells in the target cell set according to the scores of the names of the coverage cells in the target cell set corresponding to the first segmentation segments. And finally, determining a query result corresponding to the query cell name according to the cell value of each coverage cell name. Specifically, the names of the coverage cells may be sorted in descending order according to the descending order of the cell values, and the query result corresponding to the name of the query cell is displayed according to the descending order result.
When the number of the first segmentation segments matched with the second segmentation segments is multiple, the number of the target cell sets is multiple; correspondingly, when the cell value of each coverage cell name in the target cell set is determined according to the score of each coverage cell name in the target cell set corresponding to the first segmentation segment, the method is implemented by the following steps: aiming at any covering cell name in each target cell set, judging whether the covering cell name appears repeatedly in a plurality of target cell sets; if yes, accumulating a plurality of scores of the covering cell name corresponding to the first segmentation segment in a plurality of target cell sets, and determining a cell division value of the covering cell name according to an accumulation result; if not, taking the score of the coverage cell name corresponding to the first segmentation segment as the cell division value of the coverage cell name.
Therefore, the score of the coverage cell name corresponding to the first segmentation segment can reflect the matching degree of the coverage cell name when the coverage cell name is detected due to the first segmentation segment, if the same coverage cell name is detected due to a plurality of first segmentation segments at the same time, the coverage cell name is obviously matched with the query cell name, so that the cell value of the coverage cell name is improved in a mode of accumulating a plurality of scores, and the cell name is arranged in front for the user to select preferentially.
Therefore, the method not only can accurately detect the cell to be inquired by the user when the inquired cell name cannot be accurately matched with the covering cell name, but also can sequence a plurality of possible cells, and can provide a plurality of cell names which are arranged in a descending order for the user to select according to the searched matching relevance, so that the inquiry accuracy of the covering range is improved, and the method can be widely applied to various fuzzy inquiry modes and the like.
For convenience of understanding, the following describes specific implementation details of the second embodiment of the present invention in detail by taking a specific example as an example:
the example provides a broadband coverage cell query method based on a word segmentation integral algorithm, namely, the method comprises the steps of segmenting the names of coverage cells, indexing the coverage cells by utilizing roots, endowing corresponding scores according to the positions of the roots appearing in the cell names, segmenting the names of the cells input by a user, querying a root bank by utilizing each word, querying the searched cells and the scores, accumulating the scores according to the cell names, arranging all the queried cells from high to low according to the accumulated scores, and displaying the queried cells to the user to be selected. The method improves the fault tolerance rate of the query method, and sorts the cells to be selected according to the degree of correlation, thereby improving the operation friendliness of the system.
Firstly, the construction process of the word segmentation index library is introduced, and the method specifically comprises the following steps:
the method comprises the following steps: reading a piece of broadband coverage cell data, which is denoted by D, wherein each piece of cell data comprises two contents, namely a county area and a cell name, which are denoted by c and v respectively, so that a piece of coverage cell data can be expressed as follows: d (c, v)
Step two: and (3) expressing the read ith cell data by using Di, taking a county area name c on the Di, judging whether a sub-library named by c exists in the participle index library, if not, newly establishing a county area sub-library name c, and expressing by using a symbol M1 (if existing, no new establishment is needed).
Step three: taking the cell name v in the Di, and performing Word segmentation by using a Word tool, wherein the result is as follows:
v→Wi(w1,w2,…,wn)
wherein, W is a word segmentation vector, wi is the ith segment after word segmentation, and n is the total number of the word segmentation segments. Then, calculating the score of each participle corresponding to the cell name v, wherein the calculation formula is as follows:
score(i)＝(n-|i-1-n/2|)/n
the score value range is [0.5,1], the higher the score of the participle segment closer to the middle is, the lower the score of the participle closer to the two ends is, so that the score values of the conditions of 'cell', 'garden', 'dormitory' appearing at the end, the name of county and town at the beginning and the like can be effectively reduced, and the accuracy of the matching result is improved.
After the score is calculated, n word segmentation indexes are obtained:
w1(v,score(1)),w2(v,score(2)),…,wn(v,score(n))
step four: storing wi (v, score (i)) into a participle index library respectively, and merging indexes if the keyword of wi already exists in the library, wherein wi { (v (1), score (1)), (v (2), score (2)), … }.
Step five: and circularly reading the data Di of the broadband coverage cell, and processing according to the steps until the data Di of the coverage cell is completely read.
It follows that a thesaurus index library can be represented as:
participle index base → { M1, M2, …, Mn }
Mi is the ith participle index sub-base (corresponding to a participle index base of a county area, and a participle index base is established in each county area, so that the interference between the same district name and village name of different county companies can be avoided).
The sub-library of the participle index of the ith county area can be represented as:
Mi→{w1,w2,…,wm}
wherein, the word segmentation index sub-library Mi establishes m word segmentations.
The jth participle in a sub-library can be represented as:
wj→{(v,score(1)),(v,score(2)),…,(v,score(p))}
where the participle wj corresponds to p cells and their score (k).
Through the three-layer structure, a word segmentation index library of a three-level system is formed. The structure of the word segmentation index library is shown in fig. 5. Fig. 5 shows a schematic structure diagram of the participle index database. As shown in fig. 5, the participle index database further includes a plurality of participle index sub-databases respectively corresponding to different regions. Each sublibrary further comprises a plurality of participle segments, and each participle segment corresponds to a covering cell set formed by a plurality of cell names. Wherein each coverage cell in the set of coverage cells is further provided with a corresponding score. Taking the sub-library of the participle index corresponding to the region 1 as an example (the sub-library of the participle index corresponding to the region 2 is not drawn in detail), three participle segments contained in the sub-library are shown: word segmentation segment 01, word segmentation segment 02, word segmentation segment 03 (more word segmentation segments may actually be included). The following description will be given only by taking the word segmentation segment 01 and the word segmentation segment 03 as examples. The coverage cell set corresponding to the segmentation segment 01 includes three cells, namely a coverage cell name 001, a coverage cell name 002 and a coverage cell name 004, and the coverage cell set corresponding to the segmentation segment 03 includes three cells, namely a coverage cell name 001, a coverage cell name 002 and a coverage cell name 003. Therefore, when the segmentation segment 01 and the segmentation segment 03 are used together as a first segmentation segment matched with a second segmentation segment, two target cell sets are provided, and the coverage cell name 001 and the coverage cell name 002 in the two target cell sets appear for multiple times, and scores at the respective occurrences need to be accumulated to obtain a cell value corresponding to a coverage cell.
Next, a process of online matching query is introduced, which specifically includes the following steps:
the method comprises the following steps: and selecting a county and district repository Mi according to the county and district names provided by the user.
Step two: segmenting the cell names provided by the user to generate m segmented fragments, and recording the result as W (W1, W2, …, wm);
step three: and respectively extracting the corresponding cell name list in the Mi by using the keyword wj of each participle segment generated in the step two as L (j).
Step four: the Cumulative score (c _ score) of each cell name (i.e. the abbreviation of the covering cell name) v in each list l (j) is counted. Namely: firstly, creating a list Lout for storing statistical results, and then counting scores according to the following steps:
reading a cell (v, score) from L (1), if the cell name v exists in Lout, the cell name is repeatedly appeared in a plurality of cell name lists, therefore, the scores corresponding to a plurality of cell names are accumulated to obtain the cell value of the coverage cell name.
If the cell name v does not exist in Lout, a cell (v, c _ score) is newly created in Lout. In other words, if the cell name appears only once, the score corresponding to the cell name appearing is directly used as the cell value of the overlay cell name.
And repeating the steps until the cell data in the L (1) is read. The cyclic treatment L (2) to L (m) is continued. And when the m lists are counted, obtaining a cell list associated with the inquired cell name: lout [ (v1, c _ score (1)), (v2, c _ score (2)), …, (vq, c _ score (q)) ], wherein the cell division value of the k-th cell is c _ score (k) with co-matching to q cells. And finally, sequencing the cells in the list Lout in a descending order according to the accumulated integral c _ score to obtain Lsort, and displaying the Lsort at a user end for the user to select.
Therefore, in the application, the method for constructing the index library of the coverage cell division words is as follows: after dividing the cell names of the broadband coverage cells into words, scoring by using a formula score (i) ═ n- | i-1-n/2|)/n, and effectively shielding interference information; and storing the scored participle segments into corresponding county and district databases to establish a participle index database of a three-level system. In addition, the method comprises the steps of segmenting words of the cells input by the user, searching in the corresponding county and district sub-base by taking the segmentation word segments as keywords, summarizing all searched lists, calculating accumulated points, and displaying the accumulated points to the user from high to low according to the points.
In summary, the broadband coverage cell query method based on the word segmentation integration algorithm provided by the embodiment has at least the following advantages:
first, the fault tolerance for user input in a query is improved. For example, the name of the input cell is starlight cell, and the name of the coverage cell is starlight garden and starlight garden. The matching cells cannot be found by using the SQL query method. With string matching algorithms, matching cells cannot be found. However, with the method in this application, the starlight garden, participled to get "starlight" and "cell", can be matched to the starlight cell and the starlight perfect garden.
Second, query speed is increased. The method of using SQL query needs to access the database, the system overhead is increased by establishing the connection of the database, and the acceleration effect of the index in the database is reduced and the matching speed is reduced by using the fuzzy query method. By utilizing the character string matching algorithm, because the length of the cell name is generally not 6 characters, the influence of the time complexity of the character string matching algorithm on the matching speed is small, but the number of cells to be matched is large, the number of character string matching times is greatly increased, and the matching time is increased. However, with the method in the present application, when building the word segmentation index library, operations such as word segmentation and calculation of scores need to be performed on each cell name, and accordingly, when providing query services, since the word segmentation index library is already in the memory, query operations of the method are all completed in the memory, and the time complexity of reading data of the three-level structure implemented by the index is constant, thereby greatly improving matching efficiency.
And finally, the cells to be selected are arranged in a descending order according to the accumulated scores, the high accumulated score indicates that the similarity degree with the search terms of the user is large, the arrangement is closer to the front during display, the user can find the name of the target cell, and the operation friendliness of the system is improved. For example, there are starlight garden in the cell to be matched, and garden era, the cells in the garden. (wherein the show is a name of a county district unit), if the 'garden district' is input, the former two methods cannot be matched with the district, however, the method can be arranged into a garden district, a show garden era and a starlight garden according to the sequence of scores except the query result.
EXAMPLE III
Fig. 3 is a schematic structural diagram of an inquiry apparatus for broadband service coverage provided by the third embodiment of the present invention, which specifically includes:
an obtaining module 31, adapted to obtain each first segmentation segment included in the coverage cell name corresponding to the broadband coverage cell data record, and set a score of the coverage cell name corresponding to each first segmentation segment according to an appearance order of the first segmentation segment in the coverage cell name;
an index storage module 32, adapted to store, in a preset segmentation index library, each first segmentation segment corresponding to each broadband coverage cell data record and a coverage cell set corresponding to each first segmentation segment; the coverage cell set corresponding to the first segmentation segment is used for storing each coverage cell name containing the first segmentation segment and the score of each coverage cell name corresponding to the first segmentation segment;
the query module 33 is adapted to obtain each second segmentation segment included in the query cell name, and determine a query result corresponding to the query cell name according to the scores of the first segmentation segment corresponding to each second segmentation segment in the segmentation index library and each overlay cell name in the overlay cell set corresponding to the first segmentation segment matching the second segmentation segment.
Optionally, the obtaining module is further adapted to: extracting a region identifier contained in the data record of the broadband coverage cell;
the index storage module is specifically adapted to: setting a plurality of segmentation index sub-libraries corresponding to the region identifiers respectively, and storing first segmentation segments corresponding to the data records of the broadband coverage cells into the segmentation index sub-libraries respectively according to the region identifiers contained in the data records of the broadband coverage cells;
the query module is specifically adapted to: acquiring a region identifier contained in a query cell name; and determining a query result corresponding to the query cell name according to the scores of the first segmentation segment matched with each second segmentation segment in the segmentation index sub-library corresponding to the region identification contained in the query cell name and each coverage cell name in the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment, which correspond to the first segmentation segment.
Optionally, the obtaining module is specifically adapted to:
setting an order number for each first segmentation segment in the coverage cell name;
and setting the score of the coverage cell name corresponding to the first segmentation segment according to the sequence number of each first segmentation segment and the total number corresponding to the coverage cell name.
Optionally, the query module is specifically adapted to:
determining the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment as a target cell set;
determining the cell values of the names of the coverage cells in the target cell set according to the scores of the names of the coverage cells in the target cell set corresponding to the first segmentation segments;
and determining a query result corresponding to the name of the query cell according to the cell values of the names of the coverage cells.
Optionally, the query module is specifically adapted to:
and arranging the names of the coverage cells in a descending order according to the sequence of the cell values from large to small, and displaying the query result corresponding to the name of the query cell according to the descending order.
Optionally, if there are a plurality of first segmentation segments matched with each second segmentation segment, the number of the target cell sets is multiple;
the query module is specifically adapted to:
aiming at any covering cell name in each target cell set, judging whether the covering cell name appears repeatedly in a plurality of target cell sets;
if yes, accumulating a plurality of scores of the covering cell name corresponding to the first segmentation segment in a plurality of target cell sets, and determining a cell division value of the covering cell name according to an accumulation result.
Optionally, the query module is specifically adapted to: if not, taking the score of the coverage cell name corresponding to the first segmentation segment as the cell division value of the coverage cell name.
Example four
An embodiment of the present application provides a non-volatile computer storage medium, where the computer storage medium stores at least one executable instruction, and the computer executable instruction may execute the method for querying the broadband service coverage in any method embodiment described above. The executable instructions may be specifically configured to cause a processor to perform respective operations corresponding to the above-described method embodiments.
EXAMPLE five
Fig. 4 is a schematic structural diagram of an electronic device according to a fifth embodiment of the present invention, and the specific embodiment of the present invention does not limit the specific implementation of the electronic device.
As shown in fig. 4, the electronic device may include: a processor (processor)402, a Communications Interface 406, a memory 404, and a Communications bus 408.
Wherein:
the processor 402, communication interface 406, and memory 404 communicate with each other via a communication bus 408.
A communication interface 406 for communicating with network elements of other devices, such as clients or other servers.
The processor 402 is configured to execute the program 410, and may specifically perform relevant steps in the above-described query method embodiment of the broadband service coverage.
In particular, program 410 may include program code comprising computer operating instructions.
The processor 402 may be a central processing unit CPU, or an Application specific Integrated Circuit ASIC (if an Integrated Circuit), or one or more Integrated circuits configured to implement an embodiment of the present invention. The electronic device comprises one or more processors, which can be the same type of processor, such as one or more CPUs; or may be different types of processors such as one or more CPUs and one or more ASICs.
And a memory 404 for storing a program 410. The memory 404 may comprise high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
The program 510 may be specifically configured to enable the processor 502 to execute the corresponding operations in the above method embodiments.
The algorithms and displays presented herein are not inherently related to any particular computer, virtual machine, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. Moreover, the present invention is not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.
In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments described herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.
The various component embodiments of the invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that a microprocessor or Digital Signal Processor (DSP) may be used in practice to implement some or all of the functionality of some or all of the components in accordance with embodiments of the present invention. The present invention may also be embodied as apparatus or device programs (e.g., computer programs and computer program products) for performing a portion or all of the methods described herein. Such programs implementing the present invention may be stored on computer-readable media or may be in the form of one or more signals. Such a signal may be downloaded from an internet website or provided on a carrier signal or in any other form.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names.
Claims (10)
1. A method for querying a broadband service coverage area comprises the following steps:
acquiring each first segmentation segment contained in a coverage cell name corresponding to a broadband coverage cell data record, and setting the score of the coverage cell name corresponding to the first segmentation segment according to the appearance sequence of each first segmentation segment in the coverage cell name;
storing each first segmentation segment corresponding to each broadband coverage cell data record and a coverage cell set corresponding to each first segmentation segment in a preset segmentation index base; the coverage cell set corresponding to the first segmentation segment is used for storing each coverage cell name containing the first segmentation segment and the score of each coverage cell name corresponding to the first segmentation segment;
and obtaining each second segmentation segment contained in the query cell name, and determining a query result corresponding to the query cell name according to scores of the first segmentation segment corresponding to each second segmentation segment in the segmentation index library and each coverage cell name in the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment.
2. The method of claim 1, wherein the obtaining each first segmentation segment contained in the overlay cell name corresponding to the wideband overlay cell data record comprises: extracting a region identifier contained in the data record of the broadband coverage cell;
then said storing, in a preset segmentation index base, each first segmentation segment corresponding to each wideband coverage cell data record comprises: setting a plurality of segmentation index sub-libraries corresponding to the region identifiers respectively, and storing first segmentation segments corresponding to the data records of the broadband coverage cells into the segmentation index sub-libraries respectively according to the region identifiers contained in the data records of the broadband coverage cells;
then, the determining, according to the scores of the first segmentation segments corresponding to the first segmentation segments in the coverage cell set corresponding to the first segmentation segments matched with the second segmentation segments in the segmentation index library and the second segmentation segments in the query cell name, the query result corresponding to the query cell name includes:
acquiring a region identifier contained in a query cell name;
and determining a query result corresponding to the query cell name according to the scores of the first segmentation segment matched with each second segmentation segment in the segmentation index sub-library corresponding to the region identification contained in the query cell name and each coverage cell name in the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment, which correspond to the first segmentation segment.
3. The method of claim 1, wherein the setting of the score for the overlay cell name corresponding to each first segmentation segment according to the order of occurrence of the first segmentation segment in the overlay cell name comprises:
setting an order number for each first segmentation segment in the coverage cell name;
and setting the score of the coverage cell name corresponding to the first segmentation segment according to the sequence number of each first segmentation segment and the total number corresponding to the coverage cell name.
4. The method of claim 1, wherein the determining a query result corresponding to the query cell name according to scores of the first segmentation segment matching each second segmentation segment in the segmentation index base and each coverage cell name in the coverage cell set corresponding to the first segmentation segment matching each second segmentation segment corresponds to a first segmentation segment comprises:
determining the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment as a target cell set;
determining the cell values of the names of the coverage cells in the target cell set according to the scores of the names of the coverage cells in the target cell set corresponding to the first segmentation segments;
and determining a query result corresponding to the name of the query cell according to the cell values of the names of the coverage cells.
5. The method of claim 4, wherein the determining the query result corresponding to the query cell name based on the cell values of the respective overlay cell names comprises:
and arranging the names of the coverage cells in a descending order according to the sequence of the cell values from large to small, and displaying the query result corresponding to the name of the query cell according to the descending order.
6. The method of claim 4, wherein the first segmentation segment matching each second segmentation segment is plural, and the number of the target cell set is plural;
determining the cell division value of each coverage cell name in the target cell set according to the score of each coverage cell name in the target cell set corresponding to the first segmentation segment includes:
aiming at any covering cell name in each target cell set, judging whether the covering cell name appears repeatedly in a plurality of target cell sets;
if yes, accumulating a plurality of scores of the covering cell name corresponding to the first segmentation segment in a plurality of target cell sets, and determining a cell division value of the covering cell name according to an accumulation result.
7. The method of claim 6, wherein the method further comprises: if not, taking the score of the coverage cell name corresponding to the first segmentation segment as the cell division value of the coverage cell name.
8. An apparatus for querying a coverage area of a broadband service, comprising:
the acquisition module is suitable for acquiring each first segmentation segment contained in a coverage cell name corresponding to the broadband coverage cell data record, and setting the score of the coverage cell name corresponding to the first segmentation segment according to the appearance sequence of each first segmentation segment in the coverage cell name;
the index storage module is suitable for storing each first segmentation segment corresponding to each broadband coverage cell data record and a coverage cell set corresponding to each first segmentation segment in a preset segmentation index base; the coverage cell set corresponding to the first segmentation segment is used for storing each coverage cell name containing the first segmentation segment and the score of each coverage cell name corresponding to the first segmentation segment;
and the query module is suitable for acquiring each second segmentation segment contained in the query cell name, and determining a query result corresponding to the query cell name according to the scores of the first segmentation segment corresponding to each second segmentation segment in the segmentation index library and each coverage cell name in the coverage cell set corresponding to the first segmentation segment matched with each second segmentation segment.
9. An electronic device, comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is used for storing at least one executable instruction, and the executable instruction causes the processor to execute the operation corresponding to the query method of the broadband service coverage range in any one of claims 1 to 7.
10. A computer storage medium having at least one executable instruction stored therein, the executable instruction causing a processor to perform operations corresponding to the method for querying broadband service coverage according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010935351.7A CN112069232B (en) | 2020-09-08 | 2020-09-08 | Broadband service coverage query method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010935351.7A CN112069232B (en) | 2020-09-08 | 2020-09-08 | Broadband service coverage query method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112069232A true CN112069232A (en) | 2020-12-11 |
| CN112069232B CN112069232B (en) | 2023-08-01 |
Family
ID=73664375
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010935351.7A Active CN112069232B (en) | 2020-09-08 | 2020-09-08 | Broadband service coverage query method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112069232B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101876975A (en) * | 2009-11-04 | 2010-11-03 | 中国科学院声学研究所 | Identification method of Chinese place name |
| CN104484790A (en) * | 2014-12-26 | 2015-04-01 | 清华大学深圳研究生院 | Address match method and device of logistics business |
| CN104731797A (en) * | 2013-12-19 | 2015-06-24 | 北京新媒传信科技有限公司 | Keyword extracting method and keyword extracting device |
| CN106651247A (en) * | 2016-11-16 | 2017-05-10 | 成都地图慧科技有限公司 | Address area block matching method based on GIS topology analysis and address area block matching system thereof |
| CN107704503A (en) * | 2017-08-29 | 2018-02-16 | 平安科技（深圳）有限公司 | User's keyword extracting device, method and computer-readable recording medium |
| CN108804642A (en) * | 2018-06-05 | 2018-11-13 | 中国平安人寿保险股份有限公司 | Search method, device, computer equipment and storage medium |
| CN109785919A (en) * | 2018-11-30 | 2019-05-21 | 平安科技（深圳）有限公司 | Noun matching process, device, equipment and computer readable storage medium |
| CN109857947A (en) * | 2019-01-28 | 2019-06-07 | 科大国创软件股份有限公司 | A kind of broadband installation site selecting method and system based on GIS map |
-
2020
- 2020-09-08 CN CN202010935351.7A patent/CN112069232B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101876975A (en) * | 2009-11-04 | 2010-11-03 | 中国科学院声学研究所 | Identification method of Chinese place name |
| CN104731797A (en) * | 2013-12-19 | 2015-06-24 | 北京新媒传信科技有限公司 | Keyword extracting method and keyword extracting device |
| CN104484790A (en) * | 2014-12-26 | 2015-04-01 | 清华大学深圳研究生院 | Address match method and device of logistics business |
| CN106651247A (en) * | 2016-11-16 | 2017-05-10 | 成都地图慧科技有限公司 | Address area block matching method based on GIS topology analysis and address area block matching system thereof |
| CN107704503A (en) * | 2017-08-29 | 2018-02-16 | 平安科技（深圳）有限公司 | User's keyword extracting device, method and computer-readable recording medium |
| CN108804642A (en) * | 2018-06-05 | 2018-11-13 | 中国平安人寿保险股份有限公司 | Search method, device, computer equipment and storage medium |
| CN109785919A (en) * | 2018-11-30 | 2019-05-21 | 平安科技（深圳）有限公司 | Noun matching process, device, equipment and computer readable storage medium |
| CN109857947A (en) * | 2019-01-28 | 2019-06-07 | 科大国创软件股份有限公司 | A kind of broadband installation site selecting method and system based on GIS map |
Non-Patent Citations (2)
| Title |
|---|
| 朱擎量 等: "多元分词技术和全文检索技术在GIS地址定位中的应用", 测绘与空间地理信息, vol. 34, no. 05, pages 191 - 194 * |
| 欧健聪: "基于J2EE的电信宽带网络覆盖查询***设计与开发", 《中国优秀硕士学位论文全文数据库 信息科技辑》, no. 2, pages 138 - 420 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112069232B (en) | 2023-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108170859B (en) | Voice query method, device, storage medium and terminal equipment | |
| KR100721406B1 (en) | Product searching system and method using search logic according to each category | |
| US7213198B1 (en) | Link based clustering of hyperlinked documents | |
| US7827172B2 (en) | “Query-log match” relevance features | |
| KR20080028574A (en) | Integrated search service system and method | |
| CN103049495A (en) | Method, device and equipment for providing searching advice corresponding to inquiring sequence | |
| KR20220119745A (en) | Methods for retrieving content, devices, devices and computer-readable storage media | |
| CN112395881B (en) | Material label construction method and device, readable storage medium and electronic equipment | |
| CN110990701B (en) | Book searching method, computing device and computer storage medium | |
| CN111858581B (en) | Paging query method and device, storage medium and electronic equipment | |
| CN111581496B (en) | Industry data analysis method and data analysis platform based on search engine keyword data | |
| CN109101630B (en) | Method, device and equipment for generating search result of application program | |
| CN112069232B (en) | Broadband service coverage query method and device | |
| KR100709984B1 (en) | Query matching method and system for outputting results matched to query by processing the query according to various logics | |
| CN112650791B (en) | Method, device, computer equipment and storage medium for processing field | |
| CN114036371A (en) | Search term recommendation method, device, equipment and computer-readable storage medium | |
| CN114003685A (en) | Word segmentation position index construction method and device, and document retrieval method and device | |
| CN111506756A (en) | Similar picture searching method and system, electronic device and storage medium | |
| CN110704729A (en) | Application search method and cloud server | |
| CN106815228B (en) | Method and device for selecting class name of search keyword | |
| CN114861062B (en) | Information filtering method and device | |
| KR20070097720A (en) | Query matching method and system using category matching | |
| JP2001147936A (en) | Document retrieval system and method, and recording medium | |
| CN112905569A (en) | Data caching method and device, electronic equipment and storage medium | |
| CN116932781A (en) | Enterprise information matching method and system based on ac automaton |
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 |