CN106610999A - Query processing method and device - Google Patents
Query processing method and device Download PDFInfo
- Publication number
- CN106610999A CN106610999A CN201510700918.1A CN201510700918A CN106610999A CN 106610999 A CN106610999 A CN 106610999A CN 201510700918 A CN201510700918 A CN 201510700918A CN 106610999 A CN106610999 A CN 106610999A
- Authority
- CN
- China
- Prior art keywords
- subquery
- query
- syntax tree
- subtree
- query statement
- 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; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/80—Information retrieval; Database structures therefor; File system structures therefor of semi-structured data, e.g. markup language structured data such as SGML, XML or HTML
- G06F16/83—Querying
- G06F16/835—Query processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/80—Information retrieval; Database structures therefor; File system structures therefor of semi-structured data, e.g. markup language structured data such as SGML, XML or HTML
- G06F16/83—Querying
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a query processing method and device. The method comprises the steps of: receiving a query statement comprising an XQuery query statement; performing grammar analysis on the query statement to generate a grammar tree, wherein the grammar tree is a tree representation form of grammar structures for inquiring source codes of the statement, and each node on the grammar tree expresses a grammar structure included in the query statement; performing sub tree splitting on the grammar tree to obtain sub trees, wherein the nodes included in each sub tree constitute a sub query statement; executing the sub query statements corresponding to the sub trees respectively in parallel to obtain sub query result sets corresponding to the sub trees respectively; merging the sub query result sets, and outputting a query result corresponding to the query statement. Sub tree splitting is performed on the grammar tree corresponding to the query statement to split the query statement into a plurality of sub query statements, the sub query statements are executed in parallel, and the execution results of the sub query statements are merged to obtain a query result of the query statement, so that the query processing efficiency is improved.
Description
Technical field
The invention belongs to database technical field, more particularly, to a kind of inquiry processing method and device.
Background technology
Extensible markup language (Extensible Markup Language, abbreviation XML) data
Base management system is in recent years fast-developing a kind of new data base management system, and it stores and retrieves
Data be XML document.The retrieval language of XML data is the mark formulated by World Wide Web Consortium (W3C)
Accurate Xquery language.
With the arriving in big data epoch, the XML data stored in XML database management system will be non-
Chang Ju great, and multi-core technology (Multi-Cores) is also ripe day by day, it is anticipated that following multinuclear is processed
Device will become computer standard configuration.Data query is carried out in such substantial amounts of data, if still adopting
With traditional single thread query engine mode, low-down query processing efficiency will be caused.
The content of the invention
For above-mentioned problem, the present invention provides a kind of inquiry processing method and device, to carry
High query processing speed.
The invention provides a kind of inquiry processing method, including：
Query statement is received, the query statement includes XQuery query statements；
Syntax parsing, generative grammar tree are carried out to the query statement, the syntax tree is the inquiry language
The tree-shaped form of expression of the grammatical structure of the source code of sentence, each node on the syntax tree represent described and look into
A kind of grammatical structure included in asking sentence；
Subtree fractionation is carried out to the syntax tree, each subtree is obtained, the node included in each subtree is constituted
Subquery sentence；
Described in executed in parallel, each subtree distinguishes corresponding subquery sentence, obtains each subtree and corresponds to respectively
Subquery results collection；
Each subquery results collection is merged, Query Result corresponding with the query statement is exported.
The invention provides a kind of query processing device, including：
Receiver module, for receiving query statement, the query statement includes XQuery query statements；
Parsing generation module, for syntax parsing is carried out to the query statement, generative grammar tree is described
Syntax tree is the tree-shaped form of expression of the grammatical structure of the source code of the query statement, on the syntax tree
A kind of grammatical structure that each node is included in representing the query statement；
Module is split, for subtree fractionation is carried out to the syntax tree, each subtree is obtained, in each subtree
Comprising node constitute subquery sentence；
Performing module, distinguishes corresponding subquery sentence for each subtree described in executed in parallel, obtains described
Each subtree distinguishes corresponding subquery results collection；
Output module, for each subquery results collection is merged, exports look into corresponding with the query statement
Ask result.
Inquiry processing method and device that the present invention is provided, after query statement is received, pass through first
Syntax parsing is carried out to the query statement, corresponding syntax tree is generated, and then by carrying out son to the syntax tree
The query statement is split as multiple subquery sentences by the fractionation of tree, afterwards by each subquery of executed in parallel
Sentence, obtains the implementing result i.e. subquery results collection of each subquery sentence, eventually through by each subquery
Result set merges, and obtains Query Result corresponding with the query statement for receiving and exports the Query Result.It is logical
Crossing carries out subtree fractionation to the corresponding syntax tree of query statement, and query statement is split as multiple subquery languages
Sentence, by each subquery sentence of executed in parallel, and then the implementing result merging of each subquery sentence is looked into
The Query Result of sentence is ask, query processing efficiency is improve.
Description of the drawings
Fig. 1 is the flow chart of inquiry processing method embodiment of the present invention；
Fig. 2 is a kind of structural representation of syntax tree；
Fig. 3 is the flow chart of inquiry processing method embodiment of the present invention two；
Fig. 4 is the structural representation of query processing device embodiment of the present invention；
Fig. 5 is the structural representation of query processing device embodiment of the present invention two.
Specific embodiment
Fig. 1 is the flow chart of inquiry processing method embodiment of the present invention, as shown in figure 1, the method bag
Include following steps：
Step 101, reception query statement, the query statement include XQuery query statements.
The present embodiment is illustrated as a example by using XQuery query statement Ways for Querying XML Data.Work as user
Need, from data base during Ways for Querying XML Data, to be input into corresponding XQuery query statements to data base.
Step 102, syntax parsing, generative grammar tree are carried out to the query statement.
Wherein, the syntax tree is the tree-shaped form of expression of the grammatical structure of the source code of the query statement,
A kind of grammatical structure that each node on the syntax tree is included in representing the query statement.
As XQuery query statements are a kind of query statements of standard, which necessarily meets certain grammer
Rule, therefore, by the syntax parsing according to grammatical ruless, energy are carried out to the XQuery query statements
The all grammatical structures included in accessing the XQuery query statements.
Specifically, morphology parsing can be carried out to the XQuery query statements using lexical analyzer first,
And then the analysis of grammatical structure is carried out using syntax analyzer to each participle.
Further, generate syntax tree corresponding with the grammatical structure for parsing.Syntax tree is used as a kind of tree-shaped knot
Structure, be the tree-shaped representation of XQuery query statements, the XQuery of each node on behalf in syntax tree
A kind of grammatical structure included in query statement.
For tree-shaped representation, which has the concepts such as root node, father node, child node.This reality
Apply in example, when the syntax tree corresponding to XQuery query statements is generated, be according to being somebody's turn to do that inverted order is generated
Syntax tree, i.e., according to the raw order from child node to father node finally to root node come the syntax tree that generates.
Wherein, the leaf node of the bottom is corresponding to not subdivisible least unit in the XQuery query statements
Grammatical structure, root node is the XQuery query statements, finally collects to be formed equivalent to each child node
The XQuery query statements, and the node between leaf node and root node is located at, expression is also
The grammatical structure that can be split again, that is to say, that there is between father node and child node associating between grammer,
So as to form filiation.
For example, with query statement for $ i in doc (" Name.xml ") where $ i/person/id=1
As a example by return $ i/person/name, its corresponding syntax tree structure is as shown in Figure 2.Wherein, root node
It is the query statement, three nodes of ground floor are corresponded respectively to after the query statement carries out syntax parsing
Three kinds of grammatical structures of the highest level included in the query statement for obtaining：ForClause,
WhereClause, ReturnClause.Wherein, varClause and expr represent in syntax tree respectively
Individual intermediateness, which is converted to according to its left and right brotgher of node in the processing procedure of syntax tree respectively
ForClause, WhereClause, ReturnClause one of which, or keep initial form expr.
Step 103, subtree fractionation is carried out to the syntax tree, obtain each subtree, include in each subtree
Node constitute subquery sentence.
Generally, for simple query statement, syntax tree and Fig. 2 institutes of its tree for being formed
The structure shown is similar to, and based on such syntax tree structure, can carry out subtree fractionation to the syntax tree, i.e.,
Each branched structure of the syntax tree will be obtained, each branched structure corresponds to a subtree, each subtree
In each node for including correspond to a strip query statement.It is understood that per strip query statement
Generation type be according to sequentially forming from top to down, and, per strip query statement in can not
Comprising one of root node node.For with structure shown in Fig. 2,6 strip query statements of acquisition can be split.
Described in step 104, executed in parallel, each subtree distinguishes corresponding subquery sentence, obtains each son
The corresponding subquery results collection of tree difference.
For splitting the every strip query statement for obtaining, it is one process thread of its distribution, so as to,
Each subquery sentence, each subquery language are performed by each corresponding process thread parallel of subquery sentence difference
The implementing result of sentence is subquery results collection.Wherein, executed in parallel is the meaning for performing respectively.
Step 105, by each subquery results collection merge, export it is corresponding with the query statement inquiry knot
Really.
Finally, be that each subquery results collection merges by the Query Result of each subquery sentence, obtain with it is defeated
The corresponding Query Result of query statement for entering.
In the present embodiment, after query statement is received, first by carrying out grammer to the query statement
Parsing, generates corresponding syntax tree, and then by the fractionation of subtree is carried out to the syntax tree, this is inquired about
Sentence is split as multiple subquery sentences, afterwards by each subquery sentence of executed in parallel, obtains every height
The implementing result of query statement is subquery results collection, eventually through each subquery results collection is merged, is obtained
To Query Result corresponding with the query statement for receiving and export the Query Result.By to query statement
Corresponding syntax tree carries out subtree fractionation, query statement is split as multiple subquery sentences, by parallel
Each subquery sentence is performed, and then the implementing result merging of each subquery sentence is obtained into looking into for query statement
Ask result.The subquery sentence splits, each subquery sentence of executed in parallel, merges each subquery results collection
Mode, query processing efficiency can be significantly improved.
Fig. 3 is the flow chart of inquiry processing method embodiment of the present invention two, as shown in figure 3, the method bag
Include following steps：
Step 201, reception query statement, the query statement is XQuery query statements.
Step 202, syntax parsing, generative grammar tree are carried out to the query statement.
Abovementioned steps are consistent with correspondence step in embodiment illustrated in fig. 1, repeat no more.
Step 203, determine in the syntax tree and rely on the presence or absence of data dependence, control, if not existing,
Then execution step 204.
Otherwise, rely on if there is data dependence, control, according to mode of the prior art, directly hold
The above-mentioned XQuery query statements of row, obtain Query Result.
In the present embodiment, the possible structure of query statement of input is more complicated, to its corresponding syntax tree
During carrying out subtree fractionation, it may not be possible to split and obtain separate multiple subtrees, it is possible to cannot
The syntax tree is smoothly split as into multiple independent subtrees so that carried out useless deconsolidation process process.
In order to avoid flogging a dead horse, in the present embodiment, before subtree fractionation is carried out, syntax tree is carried out first
In with the presence or absence of data dependence, control rely on judgement, if do not exist in syntax tree data dependence, control
Rely on, then illustrate that the syntax tree can be split as multiple independent subtrees, so as to query statement can be split
It is divided into multiple independent subquery sentences.Otherwise, rely on if there is data dependence, control in syntax tree,
Then illustrate that the syntax tree can not be split as multiple independent subtrees, can only according to mode of the prior art,
Above-mentioned XQuery query statements are directly performed, Query Result is obtained.
Wherein it is determined that rely on the presence or absence of data dependence, control in syntax tree, can be in the following way
Realize：
Directed graph corresponding with syntax tree is generated, the closure between directed graph interior joint is according in syntax tree
Filiation between corresponding node determines.If there is ring in directed graph, it is determined that exist in syntax tree data according to
Rely, control is relied on；If there is no ring in directed graph, it is determined that there is no data dependence, control in syntax tree
Rely on.
Wherein, the closure between directed graph interior joint both can be according to the father in syntax tree between corresponding node
Subrelation points to child node by father node, it is also possible to point to father node by child node, as long as in ensureing directed graph
Closure between all nodes is consistent, i.e., be all to point to child node by father node, or be all by son
Node points to father node.
Wherein, above-mentioned directed graph is the figure shape representation of the syntax tree, and each node in figure is with only
One property.That is, because syntax tree embody be query statement grammatical structure, which may be different
There is in branch identical node, i.e., same node is possibly be present on the diverse location of syntax tree.But,
In directed graph, same node is unique expression, i.e., no matter same node is occurred in that in syntax tree several times,
Only represented with a unique node in directed graph.But, what deserves to be explained is, the same node and its
Father node, the relation of child node have expression in directed graph, will not be omitted.
Step 204, subtree fractionation is carried out to the syntax tree, obtain each subtree, include in each subtree
Node constitute subquery sentence.
Step 205, according to it is each process thread loading condition, determine that each subquery sentence is corresponding respectively
Thread is processed, each subquery sentence is performed by each process thread correspondence determined, each subquery is obtained
Sentence distinguishes corresponding subquery results collection.
In the present embodiment, when thread is processed for the distribution of each subquery sentence, can be according to all process lines
In journey, each processes the loading condition of thread selecting.Each processes the process load of thread can be with its process
The parameters such as the quantity of the subquery sentence crossed, operating time tolerance.
Specifically, it is possible to obtain all process the loading condition of thread, and to all processing thread according to negative
Load is ranked up from light to heavy, it is assumed that the quantity of the subquery sentence that current queries sentence splits out is M, then
The process thread for coming front M is selected in thread from all processing, M sub- query statement is divided respectively
Dispensing M processes thread and carries out executed in parallel process.
Step 206, according to the type of each subquery sentence, concentrate from each subquery results and determine
The subquery results collection corresponding with the subquery sentence of output type.
Step 207, institute is concentrated according to the corresponding subquery results of the subquery sentence of the output type
Comprising output condition, other subquery results collection are merged, inquiry corresponding with the query statement is exported
As a result.
In the present embodiment, during each subquery results collection merging is carried out, it is first determined go out output class
Subquery results collection corresponding to the subquery sentence of type, and then, it is other are sub according to the subquery results collection
The subquery results collection of query statement merges.
Wherein, the type of each subquery sentence can the corresponding father node of subquery sentence type list
Show, i.e., in the corresponding syntax tree of query statement under root node each node of ground floor type.
For a query statement, which can describe the constraints to output result i.e. output condition,
Grammatical structure of the output condition corresponding to output type, " Return " in such as embodiment illustrated in fig. 1
Output condition is represented.Therefore, node corresponding with output type is also had in its corresponding syntax tree
“ReturnClause”。
As the implementing result of the subquery sentence of output type characterizes output condition, therefore, according to this
The requirement of output condition, the implementing result of other subquery sentences is merged, you can be inquired about
The Query Result of sentence.
In the present embodiment, before splitting in the independent subtree for carrying out syntax tree, carry out whether syntax tree is deposited
In the judgement that data dependence, control are relied on, it is ensured that the effectiveness that syntax tree splits.So as to based on language
Query statement can be split as independent multiple subquery sentences by method tree split result, and executed in parallel is each
Subquery sentence, merges the mode of the implementing result of each subquery sentence, is conducive to improving query statement
Treatment effeciency.
Fig. 4 is the structural representation of query processing device embodiment of the present invention, as shown in figure 4, this is looked into
Asking processing meanss includes：Receiver module 11, parsing generation module 12, fractionation module 13, execution mould
Block 14, output module 15.
Receiver module 11, for receiving query statement, the query statement includes XQuery query statements.
Parsing generation module 12, for syntax parsing, generative grammar tree, institute are carried out to the query statement
The tree-shaped form of expression of the grammatical structure of the source code that syntax tree is the query statement is stated, on the syntax tree
Each node represent the query statement in a kind of grammatical structure for including.
Module 13 is split, for subtree fractionation is carried out to the syntax tree, each subtree, each subtree is obtained
In the node that includes constitute subquery sentence.
Performing module 14, distinguishes corresponding subquery sentence for each subtree described in executed in parallel, obtains institute
State each subtree and distinguish corresponding subquery results collection.
Output module 15, for each subquery results collection is merged, exports corresponding with the query statement
Query Result.
The query processing device of the present embodiment can be used for the technical side for performing embodiment of the method shown in Fig. 1
Case, which realizes that principle is similar with technique effect, and here is omitted.
Fig. 5 is the structural representation of query processing device embodiment of the present invention two, as shown in figure 5, in figure
On the basis of 4 illustrated embodiments, the query processing device also includes：Determining module 21.
Determining module 21, relies on the presence or absence of data dependence, control for determining in the syntax tree.
If it is determined that module 21 determines do not exist that data dependence, control are relied on, then the fractionation module 13 is held
Row is described to carry out subtree fractionation to the syntax tree, the step of obtain each subtree.
Specifically, the determining module 21 includes：Signal generating unit 211, the first determining unit 212.
Signal generating unit 211, for generating directed graph corresponding with the syntax tree, saves in the directed graph
Closure between point is determined according to the filiation in the syntax tree between corresponding node.
First determining unit 212, during for there is ring in the directed graph, in determining the syntax tree
There is data dependence, control to rely on；When there is no ring in the directed graph, determine in the syntax tree not
There is data dependence, control to rely on.
The performing module 14 is additionally operable to：According to each loading condition for processing thread, determine that each son is looked into respectively
The corresponding process thread of sentence is ask, each subquery sentence is performed by each process thread correspondence determined.
Wherein, the output module 15 includes：Second determining unit 151, combining unit 152.
Second determining unit 151, for the type according to each subquery sentence, ties from each subquery
Fruit is concentrated and determines the subquery results collection corresponding with the subquery sentence of output type.
Combining unit 152, for the corresponding subquery knot of the subquery sentence according to the output type
Output condition included in fruit collection, other subquery results collection are merged, and are exported and the query statement pair
The Query Result answered.
The query processing device of the present embodiment can be used for the technical side for performing embodiment of the method shown in Fig. 3
Case, which realizes that principle is similar with technique effect, and here is omitted.
One of ordinary skill in the art will appreciate that：Realize all or part of step of said method embodiment
Can be completed by the related hardware of programmed instruction, aforesaid program can be stored in a computer-readable
Take in storage medium, the program upon execution, performs the step of including said method embodiment；And it is aforementioned
Storage medium include：ROM, RAM, magnetic disc or CD etc. are various can be with Jie of store program codes
Matter.
Finally it should be noted that：Various embodiments above is only illustrating technical scheme rather than right
Its restriction；Although being described in detail to the present invention with reference to foregoing embodiments, this area it is common
Technical staff should be understood：Which still can be modified to the technical scheme described in foregoing embodiments,
Or equivalent is carried out to which part or all technical characteristic；And these modifications or replacement, and
The scope of the essence disengaging various embodiments of the present invention technical scheme of appropriate technical solution is not made.
Claims (10)
1. a kind of inquiry processing method, it is characterised in that include：
Query statement is received, the query statement includes XQuery query statements；
Syntax parsing, generative grammar tree are carried out to the query statement, the syntax tree is the inquiry language
The tree-shaped form of expression of the grammatical structure of the source code of sentence, each node on the syntax tree represent described and look into
A kind of grammatical structure included in asking sentence；
Subtree fractionation is carried out to the syntax tree, each subtree is obtained, the node included in each subtree is constituted
Subquery sentence；
Described in executed in parallel, each subtree distinguishes corresponding subquery sentence, obtains each subtree and corresponds to respectively
Subquery results collection；
Each subquery results collection is merged, Query Result corresponding with the query statement is exported.
2. method according to claim 1, it is characterised in that described that son is carried out to the syntax tree
Tree splits, and before obtaining each subtree, also includes：
Rely on the presence or absence of data dependence, control in determining the syntax tree；
If not existing, perform it is described carry out subtree fractionation to the syntax tree, the step of obtain each subtree.
3. method according to claim 2, it is characterised in that in the determination syntax tree be
It is no to there is data dependence, control dependence, including：
Generate corresponding with syntax tree directed graph, the closure between the directed graph interior joint according to
Filiation in the syntax tree between corresponding node determines；
If there is ring in the directed graph, it is determined that there is data dependence, control in the syntax tree and rely on；
If there is no ring in the directed graph, it is determined that there is no data dependence, control in the syntax tree
Rely on.
4. the method according to any one of claims 1 to 3, it is characterised in that the executed in parallel
Each subtree distinguishes corresponding subquery sentence, including：
According to each loading condition for processing thread, the corresponding process thread of each subquery sentence is determined respectively,
Each subquery sentence is performed by each process thread correspondence determined.
5. the method according to any one of claims 1 to 3, it is characterised in that described that each son is looked into
Ask result set to merge, export Query Result corresponding with the query statement, including：
According to the type of each subquery sentence, concentrate from each subquery results and determine and output type
The corresponding subquery results collection of subquery sentence；
According to the output included in the corresponding subquery results collection of the subquery sentence of the output type
Condition, other subquery results collection are merged, and export Query Result corresponding with the query statement.
6. a kind of query processing device, it is characterised in that include：
Receiver module, for receiving query statement, the query statement includes XQuery query statements；
Parsing generation module, for syntax parsing is carried out to the query statement, generative grammar tree is described
Syntax tree is the tree-shaped form of expression of the grammatical structure of the source code of the query statement, on the syntax tree
A kind of grammatical structure that each node is included in representing the query statement；
Module is split, for subtree fractionation is carried out to the syntax tree, each subtree is obtained, in each subtree
Comprising node constitute subquery sentence；
Performing module, distinguishes corresponding subquery sentence for each subtree described in executed in parallel, obtains described
Each subtree distinguishes corresponding subquery results collection；
Output module, for each subquery results collection is merged, exports look into corresponding with the query statement
Ask result.
7. device according to claim 6, it is characterised in that also include：
Determining module, relies on the presence or absence of data dependence, control for determining in the syntax tree；
If not existing, the fractionation module execution is described to carry out subtree fractionation to the syntax tree, obtains
The step of each subtree.
8. device according to claim 7, it is characterised in that the determining module includes：
Signal generating unit, for generating directed graph corresponding with the syntax tree, between the directed graph interior joint
Closure determined according to filiation between corresponding node in the syntax tree；
First determining unit, during for there is ring in the directed graph, is present in determining the syntax tree
Data dependence, control are relied on；When there is no ring in the directed graph, do not exist in determining the syntax tree
Data dependence, control are relied on.
9. the device according to any one of claim 6 to 8, it is characterised in that the performing module
It is additionally operable to：
According to each loading condition for processing thread, the corresponding process thread of each subquery sentence is determined respectively,
Each subquery sentence is performed by each process thread correspondence determined.
10. the device according to any one of claim 6 to 8, it is characterised in that the output mould
Block includes：
Second determining unit, for the type according to each subquery sentence, from each subquery results collection
In determine the subquery results collection corresponding with the subquery sentence of output type；
Combining unit, for the corresponding subquery results collection of the subquery sentence according to the output type
Included in output condition, other subquery results collection are merged, are exported corresponding with the query statement
Query Result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510700918.1A CN106610999A (en) | 2015-10-26 | 2015-10-26 | Query processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510700918.1A CN106610999A (en) | 2015-10-26 | 2015-10-26 | Query processing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106610999A true CN106610999A (en) | 2017-05-03 |
Family
ID=58612458
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510700918.1A Pending CN106610999A (en) | 2015-10-26 | 2015-10-26 | Query processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106610999A (en) |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107391721A (en) * | 2017-07-31 | 2017-11-24 | 武汉票据交易中心有限公司 | A kind of data screening method and system |
| CN108197255A (en) * | 2017-12-29 | 2018-06-22 | 上海瑞家信息技术有限公司 | A kind of method, equipment and computer readable storage medium that query tree is set |
| CN108806797A (en) * | 2018-06-27 | 2018-11-13 | 思派（北京）网络科技有限公司 | A kind of processing method and system of medical data |
| CN108874907A (en) * | 2018-05-25 | 2018-11-23 | 北京明略软件系统有限公司 | A kind of data query method and apparatus, computer readable storage medium |
| CN108920575A (en) * | 2018-06-22 | 2018-11-30 | 北京优特捷信息技术有限公司 | Daily record data analysis method, device and readable storage medium storing program for executing based on dynamic sensing |
| CN109299215A (en) * | 2018-09-28 | 2019-02-01 | 平安科技（深圳）有限公司 | Resource allocation methods, device and storage medium, the server of inverted index inquiry |
| CN109344177A (en) * | 2018-09-18 | 2019-02-15 | 图普科技（广州）有限公司 | A kind of model combination method and device |
| CN109408553A (en) * | 2018-08-27 | 2019-03-01 | 平安科技（深圳）有限公司 | Report polymerization, system, computer equipment and storage medium |
| CN110008237A (en) * | 2019-01-14 | 2019-07-12 | 阿里巴巴集团控股有限公司 | A kind of similar inquiry identifying method and device |
| CN110515823A (en) * | 2018-05-21 | 2019-11-29 | 百度在线网络技术（北京）有限公司 | Program code complexity evaluation methodology and device |
| CN110704551A (en) * | 2018-06-21 | 2020-01-17 | 中兴通讯股份有限公司 | Data processing method, device, equipment and computer readable storage medium |
| CN111400342A (en) * | 2019-01-03 | 2020-07-10 | 百度在线网络技术（北京）有限公司 | Database updating method, device, equipment and storage medium |
| CN111797618A (en) * | 2020-06-10 | 2020-10-20 | 云南电网有限责任公司 | Log analysis method and device based on syntax tree analysis |
| CN112783922A (en) * | 2021-02-01 | 2021-05-11 | 广州海量数据库技术有限公司 | Query method and device based on relational database |
| CN113268495A (en) * | 2021-05-25 | 2021-08-17 | 深圳壹账通智能科技有限公司 | Data searching method and device, electronic equipment and storage medium |
| CN113360521A (en) * | 2021-07-08 | 2021-09-07 | 北京优特捷信息技术有限公司 | Log query method, device, equipment and storage medium |
| CN113553411A (en) * | 2021-06-30 | 2021-10-26 | 北京百度网讯科技有限公司 | Query statement generation method and device, electronic equipment and storage medium |
| US11507575B2 (en) * | 2019-11-21 | 2022-11-22 | Sap Se | Complex query rewriting |
| CN115994152A (en) * | 2023-03-24 | 2023-04-21 | 云账户技术(天津)有限公司 | Verification method, device, equipment and storage medium of MySQL query statement |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101561817A (en) * | 2009-06-02 | 2009-10-21 | 天津大学 | Conversion algorithm from XQuery to SQL query language and method for querying relational data |
| CN101667190A (en) * | 2009-09-29 | 2010-03-10 | 天津大学 | XQuery-based query engine system |
| CN102156782A (en) * | 2011-04-14 | 2011-08-17 | 国电南瑞科技股份有限公司 | Graph theory-based formula parallel calculation management method for electric power system |
| CN103177120A (en) * | 2013-04-12 | 2013-06-26 | 同方知网(北京)技术有限公司 | Index-based XPath query mode tree matching method |
| CN103823885A (en) * | 2014-03-07 | 2014-05-28 | 河海大学 | Data provenance dependence relation analysis model-based data dependence analysis method |
| CN104850493A (en) * | 2015-04-24 | 2015-08-19 | 百度在线网络技术（北京）有限公司 | Method and device for detecting loophole of source code |
-
2015
- 2015-10-26 CN CN201510700918.1A patent/CN106610999A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101561817A (en) * | 2009-06-02 | 2009-10-21 | 天津大学 | Conversion algorithm from XQuery to SQL query language and method for querying relational data |
| CN101667190A (en) * | 2009-09-29 | 2010-03-10 | 天津大学 | XQuery-based query engine system |
| CN102156782A (en) * | 2011-04-14 | 2011-08-17 | 国电南瑞科技股份有限公司 | Graph theory-based formula parallel calculation management method for electric power system |
| CN103177120A (en) * | 2013-04-12 | 2013-06-26 | 同方知网(北京)技术有限公司 | Index-based XPath query mode tree matching method |
| CN103823885A (en) * | 2014-03-07 | 2014-05-28 | 河海大学 | Data provenance dependence relation analysis model-based data dependence analysis method |
| CN104850493A (en) * | 2015-04-24 | 2015-08-19 | 百度在线网络技术（北京）有限公司 | Method and device for detecting loophole of source code |
Non-Patent Citations (2)
| Title |
|---|
| 刘珏: ""基于XQuery和语义缓存的XML查询处理技术的研究与实现"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 李尧尧: ""XML数据库多核查询优化"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107391721A (en) * | 2017-07-31 | 2017-11-24 | 武汉票据交易中心有限公司 | A kind of data screening method and system |
| CN108197255A (en) * | 2017-12-29 | 2018-06-22 | 上海瑞家信息技术有限公司 | A kind of method, equipment and computer readable storage medium that query tree is set |
| CN108197255B (en) * | 2017-12-29 | 2021-01-15 | 上海瑞家信息技术有限公司 | Method and equipment for setting query tree and computer readable storage medium |
| CN110515823A (en) * | 2018-05-21 | 2019-11-29 | 百度在线网络技术（北京）有限公司 | Program code complexity evaluation methodology and device |
| CN110515823B (en) * | 2018-05-21 | 2023-04-07 | 百度在线网络技术（北京）有限公司 | Program code complexity evaluation method and device |
| CN108874907A (en) * | 2018-05-25 | 2018-11-23 | 北京明略软件系统有限公司 | A kind of data query method and apparatus, computer readable storage medium |
| CN110704551B (en) * | 2018-06-21 | 2023-02-17 | 中兴通讯股份有限公司 | Data processing method, device, equipment and computer readable storage medium |
| CN110704551A (en) * | 2018-06-21 | 2020-01-17 | 中兴通讯股份有限公司 | Data processing method, device, equipment and computer readable storage medium |
| CN108920575A (en) * | 2018-06-22 | 2018-11-30 | 北京优特捷信息技术有限公司 | Daily record data analysis method, device and readable storage medium storing program for executing based on dynamic sensing |
| CN108806797A (en) * | 2018-06-27 | 2018-11-13 | 思派（北京）网络科技有限公司 | A kind of processing method and system of medical data |
| CN109408553A (en) * | 2018-08-27 | 2019-03-01 | 平安科技（深圳）有限公司 | Report polymerization, system, computer equipment and storage medium |
| CN109344177A (en) * | 2018-09-18 | 2019-02-15 | 图普科技（广州）有限公司 | A kind of model combination method and device |
| CN109299215A (en) * | 2018-09-28 | 2019-02-01 | 平安科技（深圳）有限公司 | Resource allocation methods, device and storage medium, the server of inverted index inquiry |
| CN111400342A (en) * | 2019-01-03 | 2020-07-10 | 百度在线网络技术（北京）有限公司 | Database updating method, device, equipment and storage medium |
| CN110008237A (en) * | 2019-01-14 | 2019-07-12 | 阿里巴巴集团控股有限公司 | A kind of similar inquiry identifying method and device |
| CN110008237B (en) * | 2019-01-14 | 2023-05-02 | 创新先进技术有限公司 | Similar query recognition method and device |
| US11507575B2 (en) * | 2019-11-21 | 2022-11-22 | Sap Se | Complex query rewriting |
| CN111797618A (en) * | 2020-06-10 | 2020-10-20 | 云南电网有限责任公司 | Log analysis method and device based on syntax tree analysis |
| CN112783922B (en) * | 2021-02-01 | 2022-02-25 | 广州海量数据库技术有限公司 | Query method and device based on relational database |
| CN112783922A (en) * | 2021-02-01 | 2021-05-11 | 广州海量数据库技术有限公司 | Query method and device based on relational database |
| CN113268495A (en) * | 2021-05-25 | 2021-08-17 | 深圳壹账通智能科技有限公司 | Data searching method and device, electronic equipment and storage medium |
| CN113553411A (en) * | 2021-06-30 | 2021-10-26 | 北京百度网讯科技有限公司 | Query statement generation method and device, electronic equipment and storage medium |
| CN113553411B (en) * | 2021-06-30 | 2023-08-29 | 北京百度网讯科技有限公司 | Query statement generation method and device, electronic equipment and storage medium |
| CN113360521A (en) * | 2021-07-08 | 2021-09-07 | 北京优特捷信息技术有限公司 | Log query method, device, equipment and storage medium |
| CN115994152A (en) * | 2023-03-24 | 2023-04-21 | 云账户技术(天津)有限公司 | Verification method, device, equipment and storage medium of MySQL query statement |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106610999A (en) | Query processing method and device | |
| CN107491561B (en) | Ontology-based urban traffic heterogeneous data integration system and method | |
| US20240012810A1 (en) | Clause-wise text-to-sql generation | |
| CN107291807B (en) | SPARQL query optimization method based on graph traversal | |
| CN102609451A (en) | SQL (structured query language) query plan generation method oriented to streaming data processing | |
| CN109614432B (en) | System and method for acquiring data blood relationship based on syntactic analysis | |
| US8631028B1 (en) | XPath query processing improvements | |
| US20130006968A1 (en) | Data integration system | |
| Fegaras et al. | An optimization framework for map-reduce queries | |
| CN107169033A (en) | Relation data enquiring and optimizing method with parallel framework is changed based on data pattern | |
| CN104199831A (en) | Information processing method and device | |
| CN110688397B (en) | SQL-based distributed data unified access system and method | |
| CN106372177A (en) | Query expansion method supporting correlated query and fuzzy grouping of mixed data type | |
| KR20060122276A (en) | Relation extraction from documents for the automatic construction of ontologies | |
| CN109815283A (en) | A kind of heterogeneous data source visual inquiry method | |
| US20110238683A1 (en) | System and method for sparql-query processing using the parametrized-sparql-query in based dbms | |
| CN105335366A (en) | SQL statement processing method and apparatus and server | |
| CN108009270A (en) | A kind of text searching method calculated based on distributed memory | |
| CN107025263A (en) | Sentence analytic method for database statement | |
| CN107818181A (en) | Indexing means and its system based on Plcient interactive mode engines | |
| US8001110B2 (en) | Apparatus, method, and computer program product for processing databases | |
| US8086561B2 (en) | Document searching system and document searching method | |
| CN107273525A (en) | Functional expression querying method and system | |
| Anyanwu et al. | Algebraic optimization for processing graph pattern queries in the cloud | |
| CN104298657A (en) | Evaluation index analysis system based on expression |
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 | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20200811 |
|
| AD01 | Patent right deemed abandoned |