CN108334563A - A kind of method and device of data query - Google Patents
A kind of method and device of data query Download PDFInfo
- Publication number
- CN108334563A CN108334563A CN201810020220.9A CN201810020220A CN108334563A CN 108334563 A CN108334563 A CN 108334563A CN 201810020220 A CN201810020220 A CN 201810020220A CN 108334563 A CN108334563 A CN 108334563A
- Authority
- CN
- China
- Prior art keywords
- data
- root node
- inquired
- trigram models
- inquiring
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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/2433—Query languages
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Mathematical Physics (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A kind of method and device of data query, this method include：All tables in database are constructed into one or more directed acyclic graphs according to foreign key constraint relationship；Data area to be verified is expressed as a trigram models, the directed acyclic graph is traversed according to the trigram models, traversing result is converted into structured query language sentence；By the trigram models and the data buffer storage inquired according to the structured query language sentence in cache pool；It when inquiring data, is first inquired in the cache pool, does not inquire related data again to inquiring in the database.The program is it is possible to prevente effectively from the repetition to data is inquired.
Description
Technical field
The embodiment of the present disclosure relates to, but are not limited to database field, espespecially a kind of method and device of data query.
Background technology
When providing big data solution for client, it usually needs establish complicated data model, and by data
Model is stored in relevant database.Related application will be handled the mass data of client according to data model.One
Denier finds that data model is wrong in processing procedure, and rollback to the handling result of mass data or the cost re-run all can
It is very high, therefore ensure that the correctness of data model is vital.The correctness of previous data model is all by field
The artificial review of expert (inspection) ensures, when data model is extremely complex, it is ensured that correctness is only manually very tired
Difficult.It thus just needs to formulate a series of proof rules, it is careful to carry out the data model being stored in relevant database
Verification.But current many data verification methods need to write a large amount of SQL (Structured Query Language, knot
Structure query language) sentence, and specify data to carry out repeating inquiry database, not only efficiency is low in this way, and time-consuming, and
Have an impact to the performance of database.
Invention content
The embodiment of the present disclosure provides a kind of method and device of data query, effectively to avoid the repetition to data from inquiring.
A kind of method of data query, including：
All tables in database are constructed into one or more directed acyclic graphs according to foreign key constraint relationship；
Data area to be verified is expressed as a trigram models, is traversed according to the trigram models described oriented
Traversing result is converted to structured query language sentence by acyclic figure；
By the trigram models and the data buffer storage inquired according to the structured query language sentence in cache pool
In；
It when inquiring data, is first inquired in the cache pool, does not inquire related data again to inquiring in the database.
Optionally, the trigram models include following element：Root node type, leaf segment vertex type and root node mark,
Wherein, the leaf segment vertex type determines that the type of data to be verified, the root node type and root node mark are to be verified
The range of data.
Optionally, it when the root node type is empty, indicates to carry out inquiring and authenticating to all tables of data.
Optionally, described to traverse the directed acyclic graph according to the trigram models, traversing result is converted into structure
Change query language statement, including：
One is inquired after from the root node in the trigram models to the path of leaf node, by the root node and institute
State leaf node stacking successively；
After having traversed the directed acyclic graph, then heap stack element popped successively, during popping using leaf node table as
Target is inquired, and the combination for root node table and root node being identified after the completion of popping is as condition query.
Optionally, it is to identify root node table and root node in the case where it is empty to determine root node not after the completion of popping
Combination as condition query.
A kind of device of data query, wherein including：
Module is built, for all tables in database to be constructed one or more oriented nothings according to foreign key constraint relationship
Ring figure；
Spider module, for data area to be verified to be expressed as a trigram models, according to the triple mould
Type traverses the directed acyclic graph, and traversing result is converted to structured query language sentence；
Cache module, for by the trigram models and the data inquired according to the structured query language sentence
It is buffered in cache pool；
Enquiry module when for inquiring data, is first inquired in the cache pool, is not inquired described in related data arrive again
It is inquired in database.
Optionally, the trigram models include following element：Root node type, leaf segment vertex type and root node mark,
Wherein, the leaf segment vertex type determines that the type of data to be verified, the root node type and root node mark are to be verified
The range of data.
Optionally, it when the root node type is empty, indicates to carry out inquiring and authenticating to all tables of data.
Optionally, the spider module traverses the directed acyclic graph according to the trigram models, traversing result is turned
It is changed to structured query language sentence, including：Inquire a road from the root node in the trigram models to leaf node
After diameter, by the root node and leaf node stacking successively；After having traversed the directed acyclic graph, then successively by heap stack element
It pops, using leaf node table as inquiry target during popping, by the combination of root node table and root node mark after the completion of popping
As condition query.
Optionally, the spider module is in the case where it is empty to determine root node not, by root node table after the completion of popping
Combination with root node mark is as condition query.
A kind of device of data query, including：Memory, processor and storage can transport on a memory and on a processor
Capable computer program, wherein the processor realizes following steps when executing described program：
All tables in database are constructed into one or more directed acyclic graphs according to foreign key constraint relationship；
Data area to be verified is expressed as a trigram models, is traversed according to the trigram models described oriented
Traversing result is converted to structured query language sentence by acyclic figure；
By the trigram models and the data buffer storage inquired according to the structured query language sentence in cache pool
In；
It when inquiring data, is first inquired in the cache pool, does not inquire related data again to inquiring in the database.
To sum up, the embodiment of the present invention provides a kind of method and device of data query, it is possible to prevente effectively to the weight of data
Check is ask.
Description of the drawings
Fig. 1 is a kind of flow chart of the method for data query of the embodiment of the present disclosure；
Fig. 2 is the schematic diagram of the database module of the embodiment of the present disclosure；
Fig. 3 is the schematic diagram of the DAG of the embodiment of the present disclosure；
Fig. 4 is the schematic diagram of the trigram models of the embodiment of the present disclosure；
Fig. 5 is a kind of schematic diagram of the device of data query of the embodiment of the present disclosure.
Specific implementation mode
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with attached drawing to the present invention
Embodiment be described in detail.It should be noted that in the absence of conflict, in the embodiment and embodiment in the application
Feature mutually can arbitrarily combine.
Assuming that user needs to verify all table data in a database, have mutually before tables of data external key according to
The relationship of relying, user need according to different range, and different grain size finds the data in table and carries out accuracy verification.This disclosure is implemented
Example proposes a kind of method of data query, as shown in Figure 1, the method for the present embodiment includes：
All tables in database are constructed one or more directed acyclic graphs by step 11 according to foreign key constraint relationship
(Directed Andcyclic Graph, abbreviation DAG)；
In the present embodiment, from a tables of data along using the table major key as next table migration of foreign key constraint, arriving should
The not no terminal used in another table of table major key, as a DAG.
Multiple DAG can be generally constructed in a database, if there are rings from a table to another table
In the case of, it needs to carry out dismantling according to concrete condition to ring to be multiple DAG；If a table major key is not by other tables as outer
Key is associated with, then the table is stored separately as a root node.
Data area to be verified is expressed as a trigram models by step 12, is traversed according to the trigram models
Traversing result is converted to structured query language sentence by the directed acyclic graph；
In the present embodiment, triple specifically comprises root node type (rootType), leaf segment vertex type
(scopeType), root node ID (rootId).
Leaf segment vertex type determines that the type of examined target, root node type+root node ID determine examined target
Range.For example (data source, original table, 1) can indicate that all original tables for being 1 to data source ID are inquired, (target
Table, object table, 3) it can indicate that the object table for being 3 to object table ID is inquired that (root node and leaf segment vertex type can weigh
It is multiple).
In addition, being extended to trigram models, the case where root node type is EMPTY, such as (EMPTY, target is added
Table, -1) it then indicates to inquire all object tables, it can be positioned based on trigram models in this way and different range data are looked into
It askes.
Step 13 exists the trigram models and the data buffer storage inquired according to the structured query language sentence
In cache pool；
It is traversed according in the DAG of the trigram models in step 12 in a step 11, to be converted to SQL statement,
Find a path from triple root node to leaf node, node stacking successively, after having traversed again by heap stack element successively
It pops, using first element i.e. leaf node table as inquiry target during popping, leaf node father node to root node table is made
To need the table connected, root node table+root node ID groups are cooperated in the case of judging root node not for EMPTY after the completion of popping
For condition query.
When step 14, inquiry data, is first inquired in the cache pool, do not inquire related data and arrive the database again
Middle inquiry.
The cache pool for constructing a trigram models and corresponding data set, to triple root node, leaf segment vertex type, root
Key of the result that node ID is encoded as caching will traverse the SQL that DAG is converted to according to trigram models each time
Sentence goes the data acquisition system inquired as the value of caching, and subsequent query is first fetched from cache pool according to triple, do not had in caching
Database lookup is removed in the case of having again, effectively prevents the repetition inquiry to data.
The method of the present embodiment, by will the different range data query sentence of each table in database is converted into and can be delayed
The trigram models deposited solve data validation process and need to repeat to write to call a large amount of SQL statements and to inquiring data buffer storage
The problem of.
Be below one apply example, data model figure as shown in Figure 2, indicate a database in four table (data
Source, original table, original Table Properties, the mapping of original table object table), and store the part metadata letter in data handling procedure
Breath.
Assuming that all original table object tables mapping data under the personnel of improvement will be 3 to data source ID are verified, then hold
Row following steps：
Step 201, first according to database model diagram by these tables in database according to foreign key constraint build DAG, such as Fig. 3
It is shown；
Next step 202 builds trigram models, root node type is data_source_info, leaf segment vertex type
For o_t_table_mapping, root node ID is 3, i.e., triple (data_source_info, o_t_table_mapping,
3) indicate that finding the original table object table that all data source ID are 3 maps data, finally obtained trigram models, such as Fig. 4 institutes
Show.
The trigram models that step 203, basis obtain extreme saturation in the DAG of database, that is, find one from ternary
The paths that group root node data source table is mapped to leaf node original table object table, Data source table (data_source_
info)->Original table (origin_table)->Original table object table maps (o_t_table_mapping), and result is entered successively
In stack or doubly linked list, the path integration for then obtaining extreme saturation DAG is SQL, and transfer process is as follows：
1) each element is taken out successively from storehouse, first is o_t_table_mapping, obtains SQL statement：
select o_t_table_mapping.*from o_t_table_mapping
2) second table origin_table is taken out, can be seen that father node is origin_table according to DAG figures at this time,
Child nodes are o_t_table_mapping, and father node table is connected on the basis of sentence above and obtains SQL statement：
select o_t_table_mapping.*from o_t_table_mapping join parent on
Child.idCol=parent.idCol.
Above-mentioned parent and child.idCol=parent.idCol is replaced with the father node of taking-up and child nodes to obtain
Sentence：
select o_t_table_mapping.*from o_t_table_mapping join origin_table on
O_t_table_mapping.origin_table_id=origin_table.origin_ta ble_id.
3) first table data_source_info is taken out, can be obtained according to the flow conversion splicing of second step：
select o_t_table_mapping.*from o_t_table_mapping join origin_table on
O_t_table_mapping.origin_table_id=origin_table.origin_ta ble_id join data_
Source_info on origin_table.data_source_info_id=data_source_info_id.
4) it pops time after end, being over from triple leaf node sopeType to root node rootType
It goes through, father node is Data source table at this time, and root node type is not sky, and root node ID connections are obtained up：
select o_t_table_mapping.*from o_t_table_mapping join origin_table on
O_t_table_mapping.origin_table_id=origin_table.origin_ta ble_id join data_
Source_info on origin_table.data_source_info_id=data_source_info_id where
Data_source_info_id=3.
It can thus be seen that according to trigram models to the traversal of database DAG, successfully obtain that data can be inquired
All original table object tables that source ID is 3 map the SQL query statement of data.
Correspondingly, the embodiment of the present disclosure also provides a kind of device of data query, as shown in figure 5, the device of the present embodiment
Including：
Module is built, for all tables in database to be constructed one or more oriented nothings according to foreign key constraint relationship
Ring figure；
Spider module, for data area to be verified to be expressed as a trigram models, according to the triple mould
Type traverses the directed acyclic graph, and traversing result is converted to structured query language sentence；
Cache module, for by the trigram models and the data inquired according to the structured query language sentence
It is buffered in cache pool；
Enquiry module when for inquiring data, is first inquired in the cache pool, is not inquired described in related data arrive again
It is inquired in database.
In one embodiment, the trigram models include following element：Root node type, leaf segment vertex type and root node
Mark, wherein the leaf segment vertex type determines that the type of data to be verified, the root node type and root node mark wait for
The range of verify data.
In one embodiment, it when the root node type is empty, indicates to carry out inquiring and authenticating to all tables of data.
In one embodiment, the spider module traverses the directed acyclic graph according to the trigram models, will traverse
As a result structured query language sentence is converted to, including：One is often inquired from the root node in the trigram models to leaf
Behind the path of node, by the root node and leaf node stacking successively；After having traversed the directed acyclic graph, then by storehouse
Element is popped successively, using leaf node table as inquiry target during popping, by root node table and root node mark after the completion of popping
The combination of knowledge is as condition query.
In one embodiment, the spider module is in the case where it is empty to determine root node not, by root after the completion of popping
The combination of node table and root node mark is as condition query.
The embodiment of the present disclosure also provides a kind of device of data query, including：Memory, processor and it is stored in memory
Computer program that is upper and can running on a processor, wherein the processor realizes following steps when executing described program：
All tables in database are constructed into one or more directed acyclic graphs according to foreign key constraint relationship；
Data area to be verified is expressed as a trigram models, is traversed according to the trigram models described oriented
Traversing result is converted to structured query language sentence by acyclic figure；
By the trigram models and the data buffer storage inquired according to the structured query language sentence in cache pool
In；
It when inquiring data, is first inquired in the cache pool, does not inquire related data again to inquiring in the database.
The embodiment of the present invention additionally provides a kind of computer readable storage medium, is stored with computer executable instructions,
The computer executable instructions are performed the method for realizing the data query.
One of ordinary skill in the art will appreciate that all or part of step in the above method can be instructed by program
Related hardware is completed, and described program can be stored in computer readable storage medium, such as read-only memory, disk or CD
Deng.Optionally, all or part of step of above-described embodiment can also be realized using one or more integrated circuits.Accordingly
Ground, the form that hardware may be used in each module/unit in above-described embodiment are realized, the shape of software function module can also be used
Formula is realized.The present invention is not limited to the combinations of the hardware and software of any particular form.
It these are only the preferred embodiment of the present invention, certainly, the invention may also have other embodiments, without departing substantially from this
In the case of spirit and its essence, those skilled in the art make various corresponding changes in accordance with the present invention
And deformation, but these corresponding change and deformations should all belong to the protection domain of appended claims of the invention.
Claims (11)
1. a kind of method of data query, including：
All tables in database are constructed into one or more directed acyclic graphs according to foreign key constraint relationship；
Data area to be verified is expressed as a trigram models, the directed acyclic is traversed according to the trigram models
Figure, structured query language sentence is converted to by traversing result；
By the trigram models and the data buffer storage inquired according to the structured query language sentence in cache pool；
It when inquiring data, is first inquired in the cache pool, does not inquire related data again to inquiring in the database.
2. the method as described in claim 1, it is characterised in that：
The trigram models include following element：Root node type, leaf segment vertex type and root node mark, wherein the leaf
Node type determines that the type of data to be verified, the root node type and the root node identify the range of data to be verified.
3. method as claimed in claim 2, it is characterised in that：
When the root node type is empty, indicate to carry out inquiring and authenticating to all tables of data.
4. method as described in any one of claims 1-3, it is characterised in that：It is described according to the trigram models traversal described in
Traversing result is converted to structured query language sentence by directed acyclic graph, including：
One is inquired after from the root node in the trigram models to the path of leaf node, by the root node and the leaf
Node stacking successively；
After having traversed the directed acyclic graph, then heap stack element popped successively, using leaf node table as inquiry during popping
Target, the combination for identifying root node table and root node after the completion of popping is as condition query.
5. method as claimed in claim 4, it is characterised in that：
It is in the case where it is empty to determine root node not after the completion of popping, the combination that root node table and root node are identified is as item
Part inquiry.
6. a kind of device of data query, which is characterized in that including：
Module is built, for all tables in database to be constructed one or more directed acyclics according to foreign key constraint relationship
Figure；
Spider module, for data area to be verified to be expressed as a trigram models, according to the trigram models time
The directed acyclic graph is gone through, traversing result is converted into structured query language sentence；
Cache module, for by the trigram models and the data buffer storage inquired according to the structured query language sentence
In cache pool；
Enquiry module when for inquiring data, first being inquired in the cache pool, not inquiring related data and arrive the data again
It is inquired in library.
7. device as claimed in claim 6, it is characterised in that：
The trigram models include following element：Root node type, leaf segment vertex type and root node mark, wherein the leaf
Node type determines that the type of data to be verified, the root node type and the root node identify the range of data to be verified.
8. device as claimed in claim 7, it is characterised in that：
When the root node type is empty, indicate to carry out inquiring and authenticating to all tables of data.
9. such as claim 6-8 any one of them devices, it is characterised in that：
The spider module traverses the directed acyclic graph according to the trigram models, traversing result is converted to structuring
Query language statement, including：One is inquired after from the root node in the trigram models to the path of leaf node, it will be described
Root node and leaf node stacking successively；After having traversed the directed acyclic graph, then heap stack element popped successively, was popped
Using leaf node table as inquiry target in journey, the combination that root node table and root node identify is looked into as condition after the completion of popping
It askes.
10. device as claimed in claim 9, it is characterised in that：
The spider module is in the case where it is empty to determine root node not, by root node table and root node mark after the completion of popping
The combination of knowledge is as condition query.
11. a kind of device of data query, including：Memory, processor and storage can transport on a memory and on a processor
Capable computer program, which is characterized in that the processor realizes following steps when executing described program：
All tables in database are constructed into one or more directed acyclic graphs according to foreign key constraint relationship；
Data area to be verified is expressed as a trigram models, the directed acyclic is traversed according to the trigram models
Figure, structured query language sentence is converted to by traversing result；
By the trigram models and the data buffer storage inquired according to the structured query language sentence in cache pool；
It when inquiring data, is first inquired in the cache pool, does not inquire related data again to inquiring in the database.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810020220.9A CN108334563A (en) | 2018-01-09 | 2018-01-09 | A kind of method and device of data query |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810020220.9A CN108334563A (en) | 2018-01-09 | 2018-01-09 | A kind of method and device of data query |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108334563A true CN108334563A (en) | 2018-07-27 |
Family
ID=62924862
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810020220.9A Pending CN108334563A (en) | 2018-01-09 | 2018-01-09 | A kind of method and device of data query |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108334563A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110399387A (en) * | 2019-07-26 | 2019-11-01 | 北京明略软件系统有限公司 | Method and device based on table incidence relation dynamic generation query SQL |
| CN110968738A (en) * | 2019-11-19 | 2020-04-07 | 国网智能科技股份有限公司 | Intelligent station description file data type template nested loop detection method and system |
| CN114490763A (en) * | 2022-01-24 | 2022-05-13 | 全知科技(杭州)有限责任公司 | Single-machine high-performance batch flow integrated data processing system |
| CN115134224A (en) * | 2022-08-31 | 2022-09-30 | 杭州玳数科技有限公司 | DAG graph monitoring method and system |
| CN119003557A (en) * | 2023-05-17 | 2024-11-22 | 中国石油天然气集团有限公司 | Method and device for rapidly integrating exploration data based on bidirectional cascade |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110047185A1 (en) * | 2006-01-25 | 2011-02-24 | At&T Corp. | Meta-data indexing for xpath location steps |
| CN104077297A (en) * | 2013-03-27 | 2014-10-01 | 日电（中国）有限公司 | Query method and query device based on body |
| CN106407303A (en) * | 2016-08-30 | 2017-02-15 | 北京深思数盾科技股份有限公司 | Data storage method and apparatus, and data query method and apparatus |
-
2018
- 2018-01-09 CN CN201810020220.9A patent/CN108334563A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110047185A1 (en) * | 2006-01-25 | 2011-02-24 | At&T Corp. | Meta-data indexing for xpath location steps |
| CN104077297A (en) * | 2013-03-27 | 2014-10-01 | 日电（中国）有限公司 | Query method and query device based on body |
| CN106407303A (en) * | 2016-08-30 | 2017-02-15 | 北京深思数盾科技股份有限公司 | Data storage method and apparatus, and data query method and apparatus |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110399387A (en) * | 2019-07-26 | 2019-11-01 | 北京明略软件系统有限公司 | Method and device based on table incidence relation dynamic generation query SQL |
| CN110968738A (en) * | 2019-11-19 | 2020-04-07 | 国网智能科技股份有限公司 | Intelligent station description file data type template nested loop detection method and system |
| CN114490763A (en) * | 2022-01-24 | 2022-05-13 | 全知科技(杭州)有限责任公司 | Single-machine high-performance batch flow integrated data processing system |
| CN114490763B (en) * | 2022-01-24 | 2024-07-26 | 全知科技(杭州)有限责任公司 | Single-machine high-performance batch integrated data processing system |
| CN115134224A (en) * | 2022-08-31 | 2022-09-30 | 杭州玳数科技有限公司 | DAG graph monitoring method and system |
| CN119003557A (en) * | 2023-05-17 | 2024-11-22 | 中国石油天然气集团有限公司 | Method and device for rapidly integrating exploration data based on bidirectional cascade |
| CN119003557B (en) * | 2023-05-17 | 2025-09-09 | 中国石油天然气集团有限公司 | Method and device for rapidly integrating exploration data based on bidirectional cascade |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108334563A (en) | A kind of method and device of data query | |
| CN103902698B (en) | A kind of data-storage system and storage method | |
| US10810179B2 (en) | Distributed graph database | |
| US11269834B2 (en) | Detecting quasi-identifiers in datasets | |
| CN114281793B (en) | Data verification method, device and system | |
| EP3243305B1 (en) | Distributed storage and distributed processing query statement reconstruction in accordance with a policy | |
| US9928113B2 (en) | Intelligent compiler for parallel graph processing | |
| AU2019213302A1 (en) | Filtering data lineage diagrams | |
| US20090254505A1 (en) | Reconfigurable hardware accelerator for boolean satisfiability solver | |
| CN103902701B (en) | A kind of data-storage system and storage method | |
| JP7105982B2 (en) | Structured record retrieval | |
| US20140222870A1 (en) | System, Method, Software, and Data Structure for Key-Value Mapping and Keys Sorting | |
| US12019605B2 (en) | Immediately-consistent lock-free indexing for distributed applications | |
| EP3289484A1 (en) | Method and database computer system for performing a database query using a bitmap index | |
| US20060101452A1 (en) | Method and apparatus for preserving dependancies during data transfer and replication | |
| US8176080B2 (en) | Desensitizing character strings | |
| US20170091271A1 (en) | Technology to reduce cost of concatenation for hash array | |
| US12399939B2 (en) | Data processing method and apparatus, readable storage medium, and electronic device | |
| US8782082B1 (en) | Methods and apparatus for multiple-keyword matching | |
| CN110097581A (en) | Method based on point cloud registering ICP algorithm building K-D tree | |
| CN108549666B (en) | Data table sorting method, device, equipment and storage medium | |
| US20170235795A1 (en) | System and method for recursively iterating over a loosely associated data structure | |
| CN115438061B (en) | A method and system for updating customer standard address database | |
| CN108304469A (en) | Method and apparatus for character string fuzzy matching | |
| CN108897787B (en) | Method and device for set intersection in graph database based on SIMD instruction |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180727 |