CN113537886B - Site splitting method and device - Google Patents
Site splitting method and device Download PDFInfo
- Publication number
- CN113537886B CN113537886B CN202110800382.6A CN202110800382A CN113537886B CN 113537886 B CN113537886 B CN 113537886B CN 202110800382 A CN202110800382 A CN 202110800382A CN 113537886 B CN113537886 B CN 113537886B
- Authority
- CN
- China
- Prior art keywords
- temporary fence
- target site
- site
- fence
- temporary
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- 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/29—Geographical information databases
Abstract
The disclosure provides a station splitting method and a station splitting device. The station splitting method comprises the following steps: under the condition of splitting the target site, judging whether the target site meets a first preset condition or not; if the target site meets the first preset condition, splitting the target site into a first site and a second site, and generating a first temporary fence of the first site and a second temporary fence of the second site; judging whether the first temporary fence and the second temporary fence meet a second preset condition or not; if the first temporary fence and the second temporary fence meet the second preset condition, starting the first temporary fence and the second temporary fence; address library binding tasks and keyword binding tasks are performed for the first and second temporary pens, respectively, to split the target site into the first and second sites.
Description
Technical Field
The disclosure relates to the field of information processing, and in particular relates to a site splitting method and device.
Background
At present, with the development of services and the change of service directions which are responsible for different sites, the original sites need to be split. The existing splitting mode mainly comprises the following steps: the online data is not processed, only split processing is carried out on the online, and the online is still a unified site.
Disclosure of Invention
The inventor found through research that since the site did not fully achieve splitting, an order dispatch error resulted.
Accordingly, the site splitting scheme can effectively avoid order dispatch errors.
According to a first aspect of an embodiment of the present disclosure, there is provided a station splitting method, including: under the condition of splitting a target site, judging whether the target site meets a first preset condition or not; if the target site meets a first preset condition, splitting the target site into a first site and a second site, and generating a first temporary fence of the first site and a second temporary fence of the second site; judging whether the first temporary fence and the second temporary fence meet a second preset condition or not; if the first temporary fence and the second temporary fence meet a second preset condition, starting the first temporary fence and the second temporary fence; and performing an address library binding task and a keyword binding task for the first temporary fence and the second temporary fence respectively so as to split the target site into a first site and a second site.
In some embodiments, determining whether the target site meets a first preset condition comprises: judging whether the target site has incomplete fence related tasks or not; if the target site does not have incomplete fence related task states, judging whether the address library maintenance rate or the keyword maintenance rate of the target site reaches a preset threshold; if the address library maintenance rate or the keyword maintenance rate of the target site reaches a preset threshold, judging whether the target site comprises abnormal road area data or not; and if the target site does not comprise the abnormal road area data, determining that the target site meets a first preset condition.
In some embodiments, the fence-related tasks include verifying an address library binding task and a keyword binding task associated with a fence of the target site.
In some embodiments, the address library maintenance rate of the target site is a ratio of the number of addresses to be maintained in the target site to the total number of addresses; the keyword maintenance rate of the target site is the ratio of the number of keywords to be maintained in the target site to the total number of keywords.
In some embodiments, determining whether the first temporary fence and the second temporary fence meet a second preset condition comprises: judging whether a blank area exists between the first temporary fence and the second temporary fence; if no blank area exists between the first temporary fence and the second temporary fence, judging whether a crossing area exists between the first temporary fence and the second temporary fence; if no crossing area exists between the first temporary fence and the second temporary fence, judging whether the business attributes of the first temporary fence and the second temporary fence are consistent; and if the business attributes of the first temporary fence and the second temporary fence are consistent, determining that the first temporary fence and the second temporary fence meet a second preset condition.
In some embodiments, the toboggan data associated with the target site is not written to a database during the process of splitting the target site.
In some embodiments, after splitting the target site into a first site and a second site, associating the data with the first site or the second site according to address information of the data; and writing the data into a database.
According to a second aspect of the embodiments of the present disclosure, there is provided a station splitting apparatus, including: the first processing module is configured to judge whether a target site meets a first preset condition or not under the condition of splitting the target site, split the target site into a first site and a second site if the target site meets the first preset condition, and generate a first temporary fence of the first site and a second temporary fence of the second site; a second processing module configured to determine whether the first and second temporary fences satisfy a second preset condition, and if the first and second temporary fences satisfy the second preset condition, to enable the first and second temporary fences; and a third processing module configured to perform an address library binding task and a keyword binding task for the first and second temporary pens, respectively, so as to split the target site into a first site and a second site.
According to a third aspect of embodiments of the present disclosure, there is provided a station splitting apparatus, including: a memory configured to store instructions; a processor coupled to the memory, the processor configured to perform a method according to any of the embodiments described above based on instructions stored in the memory.
According to a fourth aspect of embodiments of the present disclosure, there is provided a computer readable storage medium, wherein the computer readable storage medium stores computer instructions which, when executed by a processor, implement a method as in any of the embodiments described above.
Other features of the present disclosure and its advantages will become apparent from the following detailed description of exemplary embodiments of the disclosure, which proceeds with reference to the accompanying drawings.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the solutions in the prior art, the drawings that are required for the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present disclosure, and that other drawings may be obtained according to these drawings without inventive faculty for a person skilled in the art.
FIG. 1 is a flow diagram of a site splitting method according to one embodiment of the present disclosure;
FIG. 2 is a flow diagram of a station splitting method according to another embodiment of the present disclosure;
FIG. 3 is a flow diagram of a station splitting method according to yet another embodiment of the present disclosure;
fig. 4 is a schematic structural diagram of a station splitting apparatus according to an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of a station splitting apparatus according to another embodiment of the present disclosure.
Detailed Description
The following description of the technical solutions in the embodiments of the present disclosure will be made clearly and completely with reference to the accompanying drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are only some embodiments of the present disclosure, not all embodiments. The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses. All other embodiments, which can be made by one of ordinary skill in the art without inventive effort, based on the embodiments in this disclosure are intended to be within the scope of this disclosure.
The relative arrangement of the components and steps, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless it is specifically stated otherwise.
Meanwhile, it should be understood that the sizes of the respective parts shown in the drawings are not drawn in actual scale for convenience of description.
Techniques, methods, and apparatus known to one of ordinary skill in the relevant art may not be discussed in detail, but should be considered part of the specification where appropriate.
In all examples shown and discussed herein, any specific values should be construed as merely illustrative, and not a limitation. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further discussion thereof is necessary in subsequent figures.
Fig. 1 is a flow chart of a station splitting method according to an embodiment of the present disclosure. In some embodiments, the following site splitting method is performed by the site splitting device.
In step 101, in the case of splitting the target site, it is determined whether the target site satisfies a first preset condition.
In some embodiments, step 101 is shown in fig. 2.
At step 201, it is determined whether there are incomplete fence-related tasks at the target site.
In some embodiments, the fence-related tasks include verifying an address library binding task and a keyword binding task associated with the fence of the target site to ensure that both the address and the keyword associated with the fence of the target site are in a normal state.
In step 202, if the target site does not have an incomplete fence-related task, it is determined whether the address library maintenance rate or the keyword maintenance rate of the target site reaches a preset threshold.
In some embodiments, the address library maintenance rate for the target site is the ratio of the number of addresses to be maintained in the target site to the total number of addresses. The keyword maintenance rate of the target site is the ratio of the number of keywords to be maintained in the target site to the total number of keywords.
In step 203, if the address library maintenance rate or the keyword maintenance rate of the target site reaches the preset threshold, it is determined whether the target site includes abnormal road area data.
It should be noted that, a plurality of ways may be covered in one site. If the order address of a user is "99999 building in the Beijing Daxing area Daxing economy development area Beijing Dong headquarter," in the process of resolving the address, the sending site corresponding to the address is determined to be the Beijing Daxing area Beijing Dong headquarter business, but the address of "99999 building" is not included in the range of each road area covered in the site, so that the road area corresponding to the order address is used as an abnormal road area and also can be used as a No. 0 road area.
In step 204, if the destination site does not include the abnormal road area data, it is determined that the destination site meets the first preset condition.
Returning to fig. 1. In step 102, if the target site meets the first preset condition, splitting the target site into a first site and a second site, and generating a first temporary fence of the first site and a second temporary fence of the second site.
In step 103, it is determined whether the first temporary fence and the second temporary fence satisfy a second preset condition.
In some embodiments, step 103 is as shown in FIG. 3.
In step 301, it is determined whether a white space exists between the first temporary fence and the second temporary fence.
Here, after the target site is divided into the first site and the second site, if the sum of the temporary fence area of the first site and the second temporary fence area of the second site is smaller than the fence area of the target site, it indicates that a blank area exists between the first temporary fence and the second temporary fence.
In step 302, if there is no clear area between the first temporary fence and the second temporary fence, it is further determined whether there is an intersection area between the first temporary fence and the second temporary fence.
If there is a region of cross overlap between the first temporary fence and the second temporary fence, then it is indicated that there is a region of cross between the first temporary fence and the second temporary fence.
In step 303, if there is no intersection area between the first temporary fence and the second temporary fence, it is determined whether the traffic attributes of the first temporary fence and the second temporary fence are consistent.
For example, the business attributes of the fence can include at least one of a pickup and a dispatch.
In step 304, if the business attributes of the first temporary fence and the second temporary fence are consistent, it is determined that the first temporary fence and the second temporary fence meet a second preset condition.
Returning to fig. 1. At step 104, if the first and second temporary fences meet a second preset condition, the first and second temporary fences are enabled.
In step 105, an address library binding task and a keyword binding task are performed for the first and second temporary pens, respectively, to split the target site into the first and second sites.
In some embodiments, the toboggan data associated with the target site is not written to the database during the process of splitting the target site.
In some embodiments, after splitting the target site into the first site and the second site, the toboggan data is associated with the first site or the second site according to the address information of the toboggan data, and the toboggan data is written into the database.
Here, after splitting station a into station A1 and station B1, the data of the original station a is allocated to station A1 or station B1 according to the address information. Therefore, in the process of splitting the station a into the station A1 and the station B1, the data is written into the database, and the association relationship between the data and the station needs to be readjusted after splitting is finished. Accordingly, after the target site is split into the first site and the second site, the data is associated with the first site or the second site according to the address information of the data, and then the data is written into the database, so that the processing efficiency of the data is effectively improved.
Fig. 4 is a schematic structural diagram of a station splitting apparatus according to an embodiment of the present disclosure. The site splitting apparatus includes a first processing module 41, a second processing module 42, and a third processing module 43.
The first processing module 41 is configured to determine whether the target site meets a first preset condition in the case of splitting the target site, split the target site into a first site and a second site if the target site meets the first preset condition, and generate a first temporary fence of the first site and a second temporary fence of the second site.
In some embodiments, the first processing module 41 determines whether the target site has an incomplete fence-related task, if the target site does not have an incomplete fence-related task state, determines whether an address library maintenance rate or a keyword maintenance rate of the target site reaches a preset threshold, if the address library maintenance rate or the keyword maintenance rate of the target site reaches the preset threshold, determines whether abnormal road zone data is included in the target site, and if the target site does not include abnormal road zone data, determines that the target site satisfies a first preset condition.
The second processing module 42 is configured to determine whether the first and second temporary fences satisfy a second preset condition, and if the first and second temporary fences satisfy the second preset condition, to enable the first and second temporary fences.
In some embodiments, the second processing module 42 determines whether a blank area exists between the first temporary fence and the second temporary fence, further determines whether an intersection area exists between the first temporary fence and the second temporary fence if the blank area does not exist between the first temporary fence and the second temporary fence, determines whether the business attributes of the first temporary fence and the second temporary fence are consistent if the intersection area does not exist between the first temporary fence and the second temporary fence, and determines that the first temporary fence and the second temporary fence satisfy a second preset condition if the business attributes of the first temporary fence and the second temporary fence are consistent.
The third processing module 43 is configured to perform an address library binding task and a keyword binding task for the first and second temporary pens, respectively, in order to split the target site into the first and second sites.
In some embodiments, third processing module 43 does not write the toboggan data associated with the target site into the database during the process of splitting the target site. The third processing module 43 associates the data with the first site or the second site according to the address information of the data after splitting the target site into the first site and the second site, and writes the data into the database.
Fig. 5 is a schematic structural diagram of a station splitting apparatus according to another embodiment of the present disclosure. As shown in fig. 5, the station splitting apparatus includes a memory 51 and a processor 52.
The memory 51 is for storing instructions and the processor 52 is coupled to the memory 51, the processor 52 being configured to perform a method as referred to in any of the embodiments of fig. 1-3 based on the instructions stored by the memory.
As shown in fig. 5, the station splitting apparatus further includes a communication interface 53 for information interaction with other devices. Meanwhile, the station splitting apparatus further includes a bus 54, and the processor 52, the communication interface 53, and the memory 51 perform communication with each other through the bus 54.
The memory 31 may comprise a high-speed RAM memory or may further comprise a non-volatile memory (non-volatile memory), such as at least one disk memory. The memory 51 may also be a memory array. The memory 51 may also be partitioned and the blocks may be combined into virtual volumes according to certain rules.
Further, the processor 52 may be a central processing unit CPU, or may be an application specific integrated circuit ASIC, or one or more integrated circuits configured to implement embodiments of the present disclosure.
The present disclosure also relates to a computer readable storage medium having stored thereon computer instructions which, when executed by a processor, implement a method as referred to in any of the embodiments of fig. 1-3.
In some embodiments, the functional unit blocks described above may be implemented as general-purpose processors, programmable logic controllers (Programmable Logic Controller, abbreviated as PLCs), digital signal processors (Digital Signal Processor, abbreviated as DSPs), application specific integrated circuits (Application Specific Integrated Circuit, abbreviated as ASICs), field programmable gate arrays (Field-Programmable Gate Array, abbreviated as FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or any suitable combination thereof for performing the functions described in the present disclosure.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program for instructing relevant hardware, where the program may be stored in a computer readable storage medium, and the storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The description of the present disclosure has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the disclosure in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiments were chosen and described in order to best explain the principles of the disclosure and the practical application, and to enable others of ordinary skill in the art to understand the disclosure for various embodiments with various modifications as are suited to the particular use contemplated.
Claims (8)
1. A site splitting method, comprising:
under the condition of splitting a target site, judging whether the target site meets a first preset condition or not;
if the target site meets a first preset condition, splitting the target site into a first site and a second site, and generating a first temporary fence of the first site and a second temporary fence of the second site;
judging whether the first temporary fence and the second temporary fence meet a second preset condition or not;
if the first temporary fence and the second temporary fence meet a second preset condition, starting the first temporary fence and the second temporary fence;
performing an address library binding task and a keyword binding task for the first temporary fence and the second temporary fence, respectively, so as to split the target site into a first site and a second site;
wherein determining whether the target site meets a first preset condition comprises:
judging whether the target site has incomplete fence related tasks or not;
if the target site does not have incomplete fence related task states, judging whether the address library maintenance rate or the keyword maintenance rate of the target site reaches a preset threshold;
if the address library maintenance rate or the keyword maintenance rate of the target site reaches a preset threshold, judging whether the target site comprises abnormal road area data or not;
if the target site does not comprise abnormal road area data, determining that the target site meets a first preset condition;
the determining whether the first temporary fence and the second temporary fence meet a second preset condition includes:
judging whether a blank area exists between the first temporary fence and the second temporary fence;
if no blank area exists between the first temporary fence and the second temporary fence, judging whether a crossing area exists between the first temporary fence and the second temporary fence;
if no crossing area exists between the first temporary fence and the second temporary fence, judging whether the business attributes of the first temporary fence and the second temporary fence are consistent;
and if the business attributes of the first temporary fence and the second temporary fence are consistent, determining that the first temporary fence and the second temporary fence meet a second preset condition.
2. The method of claim 1, wherein,
the fence-related tasks include verifying an address library binding task and a keyword binding task associated with a fence of the target site.
3. The method of claim 1, wherein,
the address library maintenance rate of the target site is the ratio of the number of addresses to be maintained in the target site to the total number of addresses;
the keyword maintenance rate of the target site is the ratio of the number of keywords to be maintained in the target site to the total number of keywords.
4. A method according to any one of claims 1-3, further comprising:
in splitting the target site, the data associated with the target site is not written to a database.
5. The method of claim 4, further comprising:
after splitting the target site into a first site and a second site, associating the data with the first site or the second site according to the address information of the data;
and writing the data into a database.
6. A station splitting apparatus, comprising:
the first processing module is configured to judge whether a target site meets a first preset condition or not under the condition that the target site is split, split the target site into a first site and a second site and generate a first temporary fence of the first site and a second temporary fence of the second site if the target site meets the first preset condition, judge whether an incomplete fence-related task exists in the target site, judge whether an address library maintenance rate or a keyword maintenance rate of the target site reaches a preset threshold if the target site does not have an incomplete fence-related task state, judge whether abnormal road area data is included in the target site if the address library maintenance rate or the keyword maintenance rate of the target site reaches the preset threshold, and determine whether the target site meets the first preset condition if the target site does not include the abnormal road area data;
a second processing module configured to determine whether the first temporary fence and the second temporary fence satisfy a second preset condition, if the first temporary fence and the second temporary fence satisfy the second preset condition, enable the first temporary fence and the second temporary fence, wherein the determination is made as to whether a blank area exists between the first temporary fence and the second temporary fence, if the blank area does not exist between the first temporary fence and the second temporary fence, determine whether an intersection area exists between the first temporary fence and the second temporary fence, if the intersection area does not exist between the first temporary fence and the second temporary fence, determine whether the business attributes of the first temporary fence and the second temporary fence are consistent, and if the business attributes of the first temporary fence and the second temporary fence are consistent, determine that the first temporary fence and the second temporary fence satisfy the second preset condition;
and a third processing module configured to perform an address library binding task and a keyword binding task for the first and second temporary pens, respectively, so as to split the target site into a first site and a second site.
7. A station splitting apparatus, comprising:
a memory configured to store instructions;
a processor coupled to the memory, the processor configured to perform the method of any of claims 1-6 based on instructions stored by the memory.
8. A computer readable storage medium storing computer instructions which, when executed by a processor, implement the method of any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110800382.6A CN113537886B (en) | 2021-07-15 | 2021-07-15 | Site splitting method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110800382.6A CN113537886B (en) | 2021-07-15 | 2021-07-15 | Site splitting method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113537886A CN113537886A (en) | 2021-10-22 |
| CN113537886B true CN113537886B (en) | 2023-09-05 |
Family
ID=78099419
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110800382.6A Active CN113537886B (en) | 2021-07-15 | 2021-07-15 | Site splitting method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113537886B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105227618A (en) * | 2014-07-04 | 2016-01-06 | 中国移动通信集团广东有限公司 | A kind of communication site's position information processing method and system |
| CN107315762A (en) * | 2017-04-20 | 2017-11-03 | 多点生活(中国)网络科技有限公司 | Service network matching process and system |
| CN110069579A (en) * | 2017-08-30 | 2019-07-30 | 北京京东尚科信息技术有限公司 | Fence method of partition and device |
| CN110858347A (en) * | 2018-08-23 | 2020-03-03 | 北京京东尚科信息技术有限公司 | Method and device for logistics distribution and order distribution |
| CN111047228A (en) * | 2020-03-13 | 2020-04-21 | 武汉元光科技有限公司 | Bus station separating method and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9351223B2 (en) * | 2012-07-25 | 2016-05-24 | At&T Mobility Ii Llc | Assignment of hierarchical cell structures employing geolocation techniques |
-
2021
- 2021-07-15 CN CN202110800382.6A patent/CN113537886B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105227618A (en) * | 2014-07-04 | 2016-01-06 | 中国移动通信集团广东有限公司 | A kind of communication site's position information processing method and system |
| CN107315762A (en) * | 2017-04-20 | 2017-11-03 | 多点生活(中国)网络科技有限公司 | Service network matching process and system |
| CN110069579A (en) * | 2017-08-30 | 2019-07-30 | 北京京东尚科信息技术有限公司 | Fence method of partition and device |
| CN110858347A (en) * | 2018-08-23 | 2020-03-03 | 北京京东尚科信息技术有限公司 | Method and device for logistics distribution and order distribution |
| CN111047228A (en) * | 2020-03-13 | 2020-04-21 | 武汉元光科技有限公司 | Bus station separating method and system |
Non-Patent Citations (1)
| Title |
|---|
| 刘超.定制公交线路和站点设计研究.《中国优秀硕士学位论文全文数据库工程科技Ⅱ辑》.2020,(第02期),第C034-722页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113537886A (en) | 2021-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2021027531A1 (en) | Block chain transaction record processing method and device | |
| JP6605672B2 (en) | Multi-round input search method, system, and terminal device | |
| CN104021161A (en) | Cluster storage method and device | |
| CN104516921A (en) | Automatic response method and device | |
| CN104850502A (en) | Method, apparatus and device for accessing data | |
| CN105989066A (en) | Information processing method and device | |
| CN102959548A (en) | Data storage method, search method and device | |
| CN115048435A (en) | Intelligent database storage method and system | |
| CN110851434B (en) | Data storage method, device and equipment | |
| CN108829903B (en) | Method and system for judging consistency of codes of FPGA redundant design and integrated circuit | |
| CN113537886B (en) | Site splitting method and device | |
| CN104573112A (en) | Page query method and data processing node for OLTP cluster database | |
| US8332595B2 (en) | Techniques for improving parallel scan operations | |
| CN111857600B (en) | Data reading and writing method and device | |
| CN106991116B (en) | Optimization method and device for database execution plan | |
| CN111694992B (en) | Data processing method and device | |
| CN103530345A (en) | Short text characteristic extension and fitting characteristic library building method and device | |
| CN101976582A (en) | Storage modeling method and device | |
| CN114428776A (en) | Index partition management method and system for time sequence data | |
| CN107169313A (en) | The read method and computer-readable recording medium of DNA data files | |
| KR101664712B1 (en) | Bloomfilter query apparatus and method for identifying true positiveness without accessing hashtable | |
| CN112860758A (en) | Search method, search device, electronic equipment and computer storage medium | |
| CN111651119B (en) | Method, device and circuit for acquiring target data in memory | |
| CN104981775A (en) | Providing context in functional testing of Web services | |
| CN114443616B (en) | FPGA-based parallel heterogeneous database acceleration method and device |
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 |