CN112783919A - Method and device for processing character strings of query statement - Google Patents
Method and device for processing character strings of query statement Download PDFInfo
- Publication number
- CN112783919A CN112783919A CN202110142308.XA CN202110142308A CN112783919A CN 112783919 A CN112783919 A CN 112783919A CN 202110142308 A CN202110142308 A CN 202110142308A CN 112783919 A CN112783919 A CN 112783919A
- Authority
- CN
- China
- Prior art keywords
- character
- identifier
- bracket
- string
- analyzed
- 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
- 238000000034 method Methods 0.000 title claims abstract description 20
- 238000003672 processing method Methods 0.000 claims description 17
- 238000004590 computer program Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000000007 visual effect Effects 0.000 description 3
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000002123 temporal effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (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 method and a device for processing character strings of query sentences, wherein the method comprises the following steps: when the character string of the SQL query statement is processed, judging whether the current character is an English letter q or not; when the current character is an English letter q, continuously judging whether the next character is an apostrophe character; when the next character is an apostrophe character, taking the first character behind the apostrophe character as a first identifier; taking characters between a first identifier and a second identifier as an extracted character string, wherein the second identifier is positioned behind the first identifier, and the first character behind the second identifier is an apostrophe character; when the first character is a character used for representing a left bracket, the second identifier is a character of a right bracket corresponding to the first character; when the first character is for an alphabetic character, the second identifier is the same as the first character. The invention makes the starting and stopping symbols of the character string more flexible and the character string more intuitive.
Description
Technical Field
The invention relates to the technical field of character string processing of query statements, in particular to a character string processing method and device of a query statement.
Background
Databases are used to store various types of data, including numeric, temporal, string, and the like. In a common relational database, when SQL refers to a character string, a single quotation mark wraps the corresponding character string, and the single quotation mark plays a role in referring to the character string in the SQL. For example:
insert into a(id,info)values(1,'abc')；
Update a set info＝'dawef'where id＝1；
if one wants to insert an apostrophe into a database, for example, the string we want to insert is a 'b' c, if it is directly wrapped with an apostrophe, like:
insert into a(id,info)values(1,'a'b'c')；
at this time, the character string 'a' b 'c' in the SQL cannot be judged by the program; many relational databases are now being escape with escape characters. The partial database escape symbol is [ c ], if the SQL string is:
insert into a(id,info)values(1,'a\'b\'c')；
the part database escape symbol is [ c ], and if the SQL string is:
insert into a(id,info)values(1,'a”b”c')；
it can be seen that the SQL string does not look as intuitive and understandable whether the escape symbol is [ or. Therefore, for the current mainstream relational database, the character strings are all enclosed by [ in ]. However, if the character string contains [ a ] character, the character needs to be transferred, and the character string is troublesome to process and is not intuitive.
Disclosure of Invention
In view of this, the present invention provides a method and an apparatus for processing a character string of a query statement, so that starting and stopping symbols of the character string are more flexible and the character string is more intuitive.
In one aspect, the present invention provides a method for processing a string of a query statement, including: when the character string of the SQL query statement is processed, judging whether the current character is an English letter q or not;
when the current character is an English letter q, continuously judging whether the next character is an apostrophe character;
when the next character is an apostrophe character, taking the first character behind the apostrophe character as a first identifier; taking characters between the first identifier and a second identifier as an extracted character string, wherein the second identifier is positioned behind the first identifier, and the first character behind the second identifier is an apostrophe character; when the first character is a character used for representing a left bracket, the second identifier is a character of a right bracket corresponding to the first character; when the first character is for an alphabetic character, the second identifier is the same as the first character.
Further, when the first identifier is a character representing a left side small bracket, and the second identifier is a character representing a right side small bracket,
the step of regarding the character between the first identifier and the second identifier as the extracted character string includes:
sequentially acquiring characters behind the characters of the left small brackets as characters to be analyzed,
judging whether the character to be analyzed is a character of a right small bracket or not;
and when the character to be analyzed is the character of the right small bracket and the character behind the character to be analyzed is an apostrophe, taking the character between the character behind the character of the left small bracket and the character of the right small bracket as the extracted character string.
Further, when the first identifier is a character representing a bracket in the left side, and the second identifier is a character representing a bracket in the right side,
the step of regarding the character between the first identifier and the second identifier as the extracted character string includes:
sequentially acquiring characters behind the characters of the brackets in the left side as characters to be analyzed,
judging whether the character to be analyzed is a character of a bracket on the right side;
and when the character to be analyzed is the character of the middle bracket on the right side and the character behind the character to be analyzed is the apostrophe, taking the character between the character behind the character of the middle bracket on the left side and the character of the middle bracket on the right side as the extracted character string.
Further, when the first identifier is a character representing a left brace, and the second identifier is a character representing a right brace,
the step of regarding the character between the first identifier and the second identifier as the extracted character string includes:
sequentially acquiring characters behind the characters of the left brace as characters to be analyzed,
judging whether the character to be analyzed is a character of a right brace or not;
and when the character to be analyzed is the character of the right brace and the character behind the character to be analyzed is an apostrophe, taking the character between the character behind the character of the left brace and the character of the right brace as the extracted character string.
Further, when the first identifier is a character for characterizing a left side angle bracket, and the second identifier is a character for characterizing a right side angle bracket,
the step of regarding the character between the first identifier and the second identifier as the extracted character string includes:
sequentially acquiring characters behind the characters of the left side angle brackets as characters to be analyzed,
judging whether the character to be analyzed is a character of a right angle bracket or not;
and when the character to be analyzed is the character of the right angle bracket and the character behind the character to be analyzed is an apostrophe, taking the character between the character behind the character of the left angle bracket and the character of the right angle bracket as the extracted character string.
Furthermore, when the first identifier and the second identifier are both alphabetic characters,
the step of regarding the character between the first identifier and the second identifier as the extracted character string includes:
sequentially acquiring characters behind the alphabetic characters as characters to be analyzed,
judging whether the character to be analyzed is an alphabetic character or not;
and when the character to be analyzed is an alphabetical character and the next character of the character to be analyzed is an apostrophe, taking the character between the first identifier and the second identifier as an extracted character string.
The invention also provides a character string processing device of the query statement, which comprises:
the judging module is used for judging whether the current character is an English letter q or not when the character string of the SQL query statement is processed; when the current character is an English letter q, continuously judging whether the next character is an apostrophe character;
the processing module is used for taking the first character behind the one-quotation mark character as a first identifier when the next character is the one-quotation mark character; taking characters between the first identifier and a second identifier as an extracted character string, wherein the second identifier is positioned behind the first identifier, and the first character behind the second identifier is an apostrophe character; when the first character is a character used for representing a left bracket, the second identifier is a character of a right bracket corresponding to the first character; when the first character is for an alphabetic character, the second identifier is the same as the first character.
Further, the first identifier is a character for representing a left small bracket, and the second identifier is a character for representing a right small bracket; or, the first identifier is a character characterizing the bracket on the left side, and the second identifier is a character characterizing the bracket on the right side; or, the first identifier is a character for representing a left brace, and the second identifier is a character for representing a right brace; or, the first identifier is a character for representing a left corner bracket, and the second identifier is a character for representing a right corner bracket; or, the first identifier and the second identifier are both the same alphabetic character.
In a third aspect, the present invention also provides a computer-readable storage medium on which a computer program is stored, which, when executed by a processor, implements the above-described character string processing method of a query statement.
In a fourth aspect, the present invention also provides a computer apparatus comprising: one or more processors; storage means for storing one or more programs; the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the above-described string processing method of a query statement.
The method and the device for processing the character string of the query statement provide a new character string definition mode, so that the starting and stopping symbols of the character string are more flexible, and the character string is more visual.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a flowchart of a character string processing method of a query sentence according to an exemplary first embodiment of the present invention.
Fig. 2 is a flowchart of a character string processing method of a query sentence according to an exemplary second embodiment of the present invention.
Fig. 3 is a flowchart of a character string processing method of a query statement according to an exemplary third embodiment of the present invention.
Fig. 4 is a flowchart of a character string processing method of a query sentence according to an exemplary fourth embodiment of the present invention.
Fig. 5 is a flowchart of a character string processing method of a query sentence according to an exemplary fifth embodiment of the present invention.
Fig. 6 is a flowchart of a character string processing method of a query sentence according to an exemplary sixth embodiment of the present invention.
Fig. 7 is a flowchart of a character string processing method of a query sentence according to an exemplary seventh embodiment of the present invention.
Fig. 8 is a block diagram showing a structure of a character string processing apparatus of a query sentence according to an exemplary eighth embodiment of the present invention.
Detailed Description
Embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
It should be noted that, in the case of no conflict, the features in the following embodiments and examples may be combined with each other; moreover, all other embodiments that can be derived by one of ordinary skill in the art from the embodiments disclosed herein without making any creative effort fall within the scope of the present disclosure.
It is noted that various aspects of the embodiments are described below within the scope of the appended claims. It should be apparent that the aspects described herein may be embodied in a wide variety of forms and that any specific structure and/or function described herein is merely illustrative. Based on the disclosure, one skilled in the art should appreciate that one aspect described herein may be implemented independently of any other aspects and that two or more of these aspects may be combined in various ways. For example, an apparatus may be implemented and/or a method practiced using any number of the aspects set forth herein. Additionally, such an apparatus may be implemented and/or such a method may be practiced using other structure and/or functionality in addition to one or more of the aspects set forth herein.
Fig. 1 is a flowchart of a method for processing a character string of a query statement according to an exemplary first embodiment of the present invention, and as shown in fig. 1, the method for processing a character string of a query statement according to the present invention includes:
step 101: when the character string of the SQL query statement is processed, judging whether the current character is an English letter q or not;
step 102: when the current character is an English letter q, continuously judging whether the next character is an apostrophe character;
step 103: when the next character is an apostrophe character, taking the first character behind the apostrophe character as a first identifier;
step 104: taking characters between the first identifier and a second identifier as an extracted character string, wherein the second identifier is positioned behind the first identifier, and the first character behind the second identifier is an apostrophe character; when the first character is a character used for representing a left bracket, the second identifier is a character of a right bracket corresponding to the first character; when the first character is for an alphabetic character, the second identifier is the same as the first character.
In this embodiment, in order to avoid that when a character string is enclosed by a single bracket [ in ], an escape problem needs to be handled when the character [ in ] is encountered, a special mode of q' is defined:
a. the beginning character of the string is q 'c and the ending character of the string is c'. c is a visible character.
b. The beginning character of the string is q 'c and the ending character of the string is d'. c and d are a pair of brackets which can be small brackets (and), middle brackets (and), big brackets (and), angle brackets (and).
For example, SQL string requiring insertion of string a 'b' c
insert into a(id,info)values(1,'a”b”c')；
There are a number of writing methods available:
insert into a(id,info)values(1,q'aa'b'ca')；
insert into a(id,info)values(1,q'ba'b'cb')；
insert into a(id,info)values(1,q'<a'b'c>')；
insert into a(id,info)values(1,q'[a'b'c]')；
……
through the flexible character string starting and ending symbol, various complex escape characters are prevented from being added into the character string, so that the character string is simpler to process and more visual.
Fig. 2 to 7 are flowcharts of character string processing methods of a query sentence according to exemplary second to seventh embodiments of the present invention. Fig. 2 is a general flow diagram, and specifically as shown in fig. 2, the method for processing a character string of a query statement includes:
a. starting phrase processing, acquiring a first character, and if the first character is not [ q ], carrying out the original phrase processing flow;
b. if the first character is [ q ], judging whether the next character is [ q ]; if not, the original phrase processing flow is carried out; otherwise, entering a [ q' ] character string processing flow;
c. a character string processing flow, namely, a first character c after the character string processing flow is obtained [ q':
d. and if the character variable c is one of left brackets (q { ], entering a corresponding flow branch, and otherwise, directly entering a sub-flow of character string processing (q' c) ].
Fig. 3-7 are flowcharts of string processing methods corresponding to various specific characters, respectively. As shown in fig. 3 in particular, q' < beginning string logic:
a. acquiring a character variable d, and judging whether the character is [ sic ]; if not, adding the character d into the tail end of the character string s, and continuously acquiring the next character to repeat the step a;
b. if the character variable d is [ sic ], continuously acquiring a next character variable e, and judging whether the character is [ sic ]; if not, adding the character d and the character e into the tail end of the character string s, and continuously acquiring the next character to repeat the step a;
c. if the character variable e is [' ], returning the character string s and entering the next phrase processing flow.
As shown in fig. 4, q' (starting string logic:
a. acquiring a character variable d, and judging whether the character is [ sic ]; if not, adding the character d into the tail end of the character string s, and continuously acquiring the next character to repeat the step a;
b. if the character variable d is [ C ], continuously acquiring a next character variable e, and judging whether the character is [ C ]; if not, adding the character d and the character e into the tail end of the character string s, and continuously acquiring the next character to repeat the step a;
c. if the character variable e is [' ], returning the character string s and entering the next phrase processing flow.
As shown in fig. 5, q' [ starting string logic:
a. acquiring a character variable d, and judging whether the character is [ ]; if not, adding the character d into the tail end of the character string s, and continuously acquiring the next character to repeat the step a;
b. if the character variable d is [ ], continuously acquiring a next character variable e, and judging whether the character is [' ]; if not, adding the character d and the character e into the tail end of the character string s, and continuously acquiring the next character to repeat the step a;
c. if the character variable e is [' ], returning the character string s and entering the next phrase processing flow.
As shown in fig. 6, q' { starting string logic:
a. acquiring a character variable d, and judging whether the character is [ sic ]; if not, adding the character d into the tail end of the character string s, and continuously acquiring the next character to repeat the step a;
b. if the character variable d is [ } ], continuously acquiring a next character variable e, and judging whether the character is [ or' ]; if not, adding the character d and the character e into the tail end of the character string s, and continuously acquiring the next character to repeat the step a;
c. if the character variable e is [' ], returning the character string s and entering the next phrase processing flow.
As shown in fig. 7, the string logic beginning at q' c:
a. acquiring a character variable d, and judging whether the character variable d is equal to the character variable c; if not, adding the character d into the tail end of the character string s, and continuously acquiring the next character to repeat the step a;
b. if the character variable d is equal to the character variable c, continuously acquiring a next character variable e, and judging whether the character is [ phi ]; if not, adding the character d and the character e into the tail end of the character string s, and continuously acquiring the next character to repeat the step a;
c. if the character variable e is [' ], returning the character string s and entering the next phrase processing flow.
After the [ q' ] character string processing flow is adopted in the embodiment, the characters can effectively avoid complex processing of escape characters, so that the SQL character string is simpler and more visual, and the processing efficiency is higher.
Fig. 8 is a block diagram showing a structure of a character string processing apparatus of a query sentence according to an exemplary eighth embodiment of the present invention. The embodiments shown in fig. 1 to 7 can be applied to this embodiment, and specifically as shown in fig. 8, the character string processing apparatus of a query statement includes:
the judging module 801 is configured to, when processing a character string of an SQL query statement, judge whether a current character is an english letter q; when the current character is an English letter q, continuously judging whether the next character is an apostrophe character;
a processing module 802, configured to, when a next character is an apostrophe character, take a first character following the apostrophe character as a first identifier; taking characters between the first identifier and a second identifier as an extracted character string, wherein the second identifier is positioned behind the first identifier, and the first character behind the second identifier is an apostrophe character; when the first character is a character used for representing a left bracket, the second identifier is a character of a right bracket corresponding to the first character; when the first character is for an alphabetic character, the second identifier is the same as the first character.
Specifically, the first identifier is a character for representing a left small bracket, and the second identifier is a character for representing a right small bracket; or,
the first identifier is a character for representing a bracket in the left side, and the second identifier is a character for representing a bracket in the right side; or,
the first identifier is a character for representing a left brace, and the second identifier is a character for representing a right brace; or,
the first identifier is a character for representing a left corner bracket, and the second identifier is a character for representing a right corner bracket; or,
the first identifier and the second identifier are both the same alphabetic character.
The present invention also provides a computer-readable storage medium on which a computer program is stored, which, when executed by a processor, implements the above-described character string processing method of a query statement.
The present invention also provides a computer apparatus, comprising:
one or more processors;
storage means for storing one or more programs;
when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the above-described character string processing method of a query statement.
The above description is only for the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A character string processing method of a query statement, comprising:
when the character string of the SQL query statement is processed, judging whether the current character is an English letter q or not;
when the current character is an English letter q, continuously judging whether the next character is an apostrophe character;
when the next character is an apostrophe character, taking the first character behind the apostrophe character as a first identifier;
taking characters between the first identifier and a second identifier as an extracted character string, wherein the second identifier is positioned behind the first identifier, and the first character behind the second identifier is an apostrophe character; when the first character is a character used for representing a left bracket, the second identifier is a character of a right bracket corresponding to the first character; when the first character is for an alphabetic character, the second identifier is the same as the first character.
2. The character string processing method of a query statement according to claim 1, characterized in that when the first identifier is a character representing a left side parenthesis and the second identifier is a character representing a right side parenthesis,
the step of regarding the character between the first identifier and the second identifier as the extracted character string includes:
sequentially acquiring characters behind the characters of the left small brackets as characters to be analyzed,
judging whether the character to be analyzed is a character of a right small bracket or not;
and when the character to be analyzed is the character of the right small bracket and the character behind the character to be analyzed is an apostrophe, taking the character between the character behind the character of the left small bracket and the character of the right small bracket as the extracted character string.
3. The method of processing a character string of a query statement according to claim 1, wherein when the first identifier is a character representing a left side middle bracket and the second identifier is a character representing a right side middle bracket,
the step of regarding the character between the first identifier and the second identifier as the extracted character string includes:
sequentially acquiring characters behind the characters of the brackets in the left side as characters to be analyzed,
judging whether the character to be analyzed is a character of a bracket on the right side;
and when the character to be analyzed is the character of the middle bracket on the right side and the character behind the character to be analyzed is the apostrophe, taking the character between the character behind the character of the middle bracket on the left side and the character of the middle bracket on the right side as the extracted character string.
4. The method of processing a character string of a query statement according to claim 1, wherein when the first identifier is a character representing a left brace and the second identifier is a character representing a right brace,
the step of regarding the character between the first identifier and the second identifier as the extracted character string includes:
sequentially acquiring characters behind the characters of the left brace as characters to be analyzed,
judging whether the character to be analyzed is a character of a right brace or not;
and when the character to be analyzed is the character of the right brace and the character behind the character to be analyzed is an apostrophe, taking the character between the character behind the character of the left brace and the character of the right brace as the extracted character string.
5. The method of processing a character string of a query statement according to claim 1, wherein when the first identifier is a character representing a left side angle bracket and the second identifier is a character representing a right side angle bracket,
the step of regarding the character between the first identifier and the second identifier as the extracted character string includes:
sequentially acquiring characters behind the characters of the left side angle brackets as characters to be analyzed,
judging whether the character to be analyzed is a character of a right angle bracket or not;
and when the character to be analyzed is the character of the right angle bracket and the character behind the character to be analyzed is an apostrophe, taking the character between the character behind the character of the left angle bracket and the character of the right angle bracket as the extracted character string.
6. The method of processing a character string of a query statement according to claim 1, wherein when the first identifier and the second identifier are both alphabetic characters,
the step of regarding the character between the first identifier and the second identifier as the extracted character string includes:
sequentially acquiring characters behind the alphabetic characters as characters to be analyzed,
judging whether the character to be analyzed is an alphabetic character or not;
and when the character to be analyzed is an alphabetical character and the next character of the character to be analyzed is an apostrophe, taking the character between the first identifier and the second identifier as an extracted character string.
7. A character string processing apparatus of a query sentence, comprising:
the judging module is used for judging whether the current character is an English letter q or not when the character string of the SQL query statement is processed; when the current character is an English letter q, continuously judging whether the next character is an apostrophe character;
the processing module is used for taking the first character behind the one-quotation mark character as a first identifier when the next character is the one-quotation mark character; taking characters between the first identifier and a second identifier as an extracted character string, wherein the second identifier is positioned behind the first identifier, and the first character behind the second identifier is an apostrophe character; when the first character is a character used for representing a left bracket, the second identifier is a character of a right bracket corresponding to the first character; when the first character is for an alphabetic character, the second identifier is the same as the first character.
8. The character string processing apparatus of a query statement according to claim 7,
the first identifier is a character for representing a left small bracket, and the second identifier is a character for representing a right small bracket; or,
the first identifier is a character for representing a bracket in the left side, and the second identifier is a character for representing a bracket in the right side; or,
the first identifier is a character for representing a left brace, and the second identifier is a character for representing a right brace; or,
the first identifier is a character for representing a left corner bracket, and the second identifier is a character for representing a right corner bracket; or,
the first identifier and the second identifier are both the same alphabetic character.
9. A computer-readable storage medium on which a computer program is stored, the program, when executed by a processor, implementing the character string processing method of a query statement according to any one of claims 1 to 6.
10. A computer device, comprising:
one or more processors;
storage means for storing one or more programs;
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of string processing of a query statement as claimed in any one of claims 1-6 above.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110142308.XA CN112783919A (en) | 2021-02-02 | 2021-02-02 | Method and device for processing character strings of query statement |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110142308.XA CN112783919A (en) | 2021-02-02 | 2021-02-02 | Method and device for processing character strings of query statement |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112783919A true CN112783919A (en) | 2021-05-11 |
Family
ID=75760485
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110142308.XA Pending CN112783919A (en) | 2021-02-02 | 2021-02-02 | Method and device for processing character strings of query statement |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112783919A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113641695A (en) * | 2021-08-11 | 2021-11-12 | 杭州安恒信息技术股份有限公司 | Character extraction method, device, equipment and medium for database statement |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1506875A (en) * | 2002-12-12 | 2004-06-23 | 华为技术有限公司 | Characteristic character string extracting and substituting method in language localization |
| JP2004192344A (en) * | 2002-12-11 | 2004-07-08 | Sharp Corp | Information processor |
| US20090210404A1 (en) * | 2008-02-14 | 2009-08-20 | Wilson Kelce S | Database search control |
| CN110727703A (en) * | 2019-09-23 | 2020-01-24 | 苏宁云计算有限公司 | Method and device for automatically identifying comments in JSON (Java Server object notation) code |
-
2021
- 2021-02-02 CN CN202110142308.XA patent/CN112783919A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004192344A (en) * | 2002-12-11 | 2004-07-08 | Sharp Corp | Information processor |
| CN1506875A (en) * | 2002-12-12 | 2004-06-23 | 华为技术有限公司 | Characteristic character string extracting and substituting method in language localization |
| US20090210404A1 (en) * | 2008-02-14 | 2009-08-20 | Wilson Kelce S | Database search control |
| CN110727703A (en) * | 2019-09-23 | 2020-01-24 | 苏宁云计算有限公司 | Method and device for automatically identifying comments in JSON (Java Server object notation) code |
Non-Patent Citations (1)
| Title |
|---|
| 叮咚侠: "oracle中的q\'转义字符用法", pages 1 - 3, Retrieved from the Internet <URL:《https://blog.csdn.net/home_zhang/article/details/100135894》> * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113641695A (en) * | 2021-08-11 | 2021-11-12 | 杭州安恒信息技术股份有限公司 | Character extraction method, device, equipment and medium for database statement |
| CN113641695B (en) * | 2021-08-11 | 2024-03-22 | 杭州安恒信息技术股份有限公司 | Character extraction method, device, equipment and medium for database statement |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8630841B2 (en) | Regular expression word verification | |
| US8676826B2 (en) | Method, system and program storage device for automatic incremental learning of programming language grammar | |
| US10089411B2 (en) | Method and apparatus and computer readable medium for computing string similarity metric | |
| US11556812B2 (en) | Method and device for acquiring data model in knowledge graph, and medium | |
| US20090049080A1 (en) | Relationship management for data modeling in an integrated development environment | |
| WO2015021879A1 (en) | Method and device for mining data regular expression | |
| CN108415998B (en) | Application dependency relationship updating method, terminal, device and storage medium | |
| US10740211B2 (en) | Methods and systems to tag tokens in log messages | |
| CN109144514B (en) | JSON format data analysis and storage method and device | |
| CN104320312A (en) | Network application safety test tool and fuzz test case generation method and system | |
| CN112100198B (en) | Database SQL statement optimization method, device, equipment and storage medium | |
| CN114090671A (en) | Data import method and device, electronic equipment and storage medium | |
| CN112783919A (en) | Method and device for processing character strings of query statement | |
| US20200065330A1 (en) | XML Data Manipulation Method and Apparatus | |
| US20070078840A1 (en) | Custom function library for inverse query evaluation of messages | |
| US9495638B2 (en) | Scalable, rule-based processing | |
| CN112667636B (en) | Index establishing method, device and storage medium | |
| CN111444208B (en) | Data updating method and related equipment | |
| CN112883088B (en) | Data processing method, device, equipment and storage medium | |
| US8136094B2 (en) | Relationship management for data modeling in an integrated development environment | |
| CN111966630A (en) | File type detection method, device, equipment and medium | |
| CN110795617A (en) | Error correction method and related device for search terms | |
| US10380195B1 (en) | Grouping documents by content similarity | |
| CN109814923A (en) | Data processing method, device, computer equipment and storage medium | |
| CN112765963A (en) | Sentence segmentation method and device, computer equipment and storage medium |
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 |