CN116361328A - Method and device for querying data by using converted SQL statement - Google Patents
Method and device for querying data by using converted SQL statement Download PDFInfo
- Publication number
- CN116361328A CN116361328A CN202310343237.9A CN202310343237A CN116361328A CN 116361328 A CN116361328 A CN 116361328A CN 202310343237 A CN202310343237 A CN 202310343237A CN 116361328 A CN116361328 A CN 116361328A
- Authority
- CN
- China
- Prior art keywords
- sql
- converted
- syntax tree
- abstract syntax
- variable
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24553—Query execution of query operations
- G06F16/24558—Binary matching operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24564—Applying rules; Deductive queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/256—Integrating or interfacing systems involving database management systems in federated or virtual databases
-
- 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/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A method and apparatus for querying data using a converted SQL statement, the method comprising: acquiring a basic SQL sentence comprising query filtering conditions, and converting the basic SQL sentence into an SQL abstract syntax tree; traversing the SQL abstract syntax tree, and judging whether a preset condition is met; if the preset condition is met, a modified SQL abstract syntax tree is obtained according to a predefined rule, and the modified SQL abstract syntax tree is output as a converted SQL sentence; and querying the data meeting the query filtering condition in the database by using the converted SQL sentence.
Description
Technical Field
The present invention relates to the field of databases, and in particular, to a method and apparatus for querying data using a converted SQL statement.
Background
In a WEB application, it is very common to dynamically query a database and return data according to various query conditions input by a user.
Under the framework of mybatis technology in the Java Web back-end development field, a general solution to the requirement is to adopt a dynamic SQL template; but if there are more and more complex requirements for query filtering conditions, the requirements need to be written in the SQL query template file in detail one by one.
Under the Java WEB back-end Hibernate technical framework, a general solution is an HQL criterion query technology. The HQL criterion technique requires one or more Java statements to be handwritten for each query condition to be converted to criterion statements.
The two general technical solutions need to manually maintain SQL query templates or Java criterion sentences, and have the advantages of large workload, elaboration, complexity, error and incapability of being general.
Disclosure of Invention
The application provides a method and a device for querying data by using a converted SQL statement, which can be modified according to a basic SQL query statement and a dynamically variable query filtering condition, and query data is performed in different databases by using the modified SQL statement.
The application provides a method for querying data by using a converted SQL statement, which comprises the following steps:
acquiring a basic SQL sentence comprising query filtering conditions, and converting the basic SQL sentence into an SQL abstract syntax tree;
traversing the SQL abstract syntax tree, and judging whether a preset condition is met;
if the preset condition is met, a modified SQL abstract syntax tree is obtained according to a predefined rule, and the modified SQL abstract syntax tree is output as a converted SQL sentence;
and querying the data meeting the query filtering condition in the database by using the converted SQL sentence.
In an exemplary embodiment, after the obtaining the basic SQL statement including the query filtering condition, the method further includes:
extracting four elements replaced by SQL variables according to the query filtering conditions;
the four elements are SQL variable names, SQL variable data types, query filtering operations and constant values.
In an exemplary embodiment, the traversing the SQL abstract syntax tree and determining whether a preset condition is met comprises:
traversing the SQL abstract syntax tree;
judging whether SQL variable names in the SQL abstract syntax tree are matched with SQL variable names of four-element tuples corresponding to the query filtering conditions or not;
if so, determining that the preset condition is met.
In an exemplary embodiment, the determining whether the SQL variable name in the SQL abstract syntax tree matches the SQL variable name in the four elements corresponding to the query filtering condition includes:
comparing the SQL variable names in the SQL abstract syntax tree with the SQL variable name character strings of the four-element tuples;
and if the character strings of the two variable names are equal, determining that the two variable names are matched.
In an exemplary embodiment, the predefined rule includes:
and according to the SQL variable data type of the four-element tuple, converting the SQL variable into an SQL constant expression corresponding to the SQL constant value of the four-element tuple.
In an exemplary embodiment, the predefined rule further includes:
if the SQL variable is a sub-expression in the SQL binary expression, modifying the binary operator of the SQL binary expression into a binary operator corresponding to the query filtering operation in the four-element tuple.
In an exemplary embodiment, the modifying the binary operator of the SQL binary expression into the binary operator corresponding to the query filtering operation in the four-element tuple comprises:
according to the value of the query filtering operation and the preset corresponding relation in the mapping relation table of the SQL binary operator, replacing the query filtering operation of the four-element tuple with the binary operator; the preset corresponding relation comprises binary operators corresponding to different values of query filtering operation.
In an exemplary embodiment, the values of the query filtering operations in the mapping relation table of the SQL binary operators are in one-to-one correspondence with the binary operators.
In order to solve the above problems, the present invention also provides an apparatus for querying data using a converted SQL statement, the apparatus comprising: a memory and a processor; the method is characterized in that the memory is used for storing a program for inquiring data by using a converted SQL statement, and the processor is used for reading and executing the program for inquiring data by using the converted SQL statement and executing the method in any of the above embodiments.
In order to solve the above-described problems, the present invention also provides a computer-readable storage medium storing computer-executable instructions which, when executed by a processor, perform the operations in the method of any one of the above-described embodiments.
Compared with the related art, the application provides a method and a device for querying data by using a converted SQL statement, wherein the method comprises the following steps: acquiring a basic SQL sentence comprising query filtering conditions, and converting the basic SQL sentence into an SQL abstract syntax tree; traversing the SQL abstract syntax tree, and judging whether a preset condition is met; if the preset condition is met, a modified SQL abstract syntax tree is obtained according to a predefined rule, and the modified SQL abstract syntax tree is output as a converted SQL sentence; and querying the data meeting the query filtering condition in the database by using the converted SQL sentence. The method and the device can be modified according to basic SQL query sentences and dynamically variable query filtering conditions, and query data is carried out in different databases by using the modified SQL sentences.
Additional features and advantages of the application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the application. Other advantages of the present application may be realized and attained by the structure particularly pointed out in the written description and drawings.
Drawings
The accompanying drawings are included to provide an understanding of the technical aspects of the present application, and are incorporated in and constitute a part of this specification, illustrate the technical aspects of the present application and together with the examples of the present application, and not constitute a limitation of the technical aspects of the present application.
FIG. 1 is a flow chart of a method for querying data using a converted SQL statement in an embodiment of the application;
fig. 2 is a schematic diagram of an apparatus for querying data using a converted SQL statement according to an embodiment of the present application.
Detailed Description
The present application describes a number of embodiments, but the description is illustrative and not limiting and it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible within the scope of the embodiments described herein. Although many possible combinations of features are shown in the drawings and discussed in the detailed description, many other combinations of the disclosed features are possible. Any feature or element of any embodiment may be used in combination with or in place of any other feature or element of any other embodiment unless specifically limited.
The present application includes and contemplates combinations of features and elements known to those of ordinary skill in the art. The embodiments, features and elements of the present disclosure may also be combined with any conventional features or elements to form a unique inventive arrangement as defined in the claims. Any feature or element of any embodiment may also be combined with features or elements from other inventive arrangements to form another unique inventive arrangement as defined in the claims. Thus, it should be understood that any of the features shown and/or discussed in this application may be implemented alone or in any suitable combination. Accordingly, the embodiments are not to be restricted except in light of the attached claims and their equivalents. Further, various modifications and changes may be made within the scope of the appended claims.
Furthermore, in describing representative embodiments, the specification may have presented the method and/or process as a particular sequence of steps. However, to the extent that the method or process does not rely on the particular order of steps set forth herein, the method or process should not be limited to the particular sequence of steps described. Other sequences of steps are possible as will be appreciated by those of ordinary skill in the art. Accordingly, the particular order of the steps set forth in the specification should not be construed as limitations on the claims. Furthermore, the claims directed to the method and/or process should not be limited to the performance of their steps in the order written, and one skilled in the art can readily appreciate that the sequences may be varied and still remain within the spirit and scope of the embodiments of the present application.
In some technologies, under the framework of mybatis technology in the Java Web backend development domain, a common solution to this need is to use dynamic SQL templates, for example:
the query returns BLOG data for the current active state, which has two optional query conditions title, autther.
It can be seen that the XML element if contains all dynamic condition matching conditions and corresponding SQL filter statements. If there are more and more complex query filtering condition requirements, the requirements are written in the SQL query template file in detail one by one.
Under the Java WEB back-end Hibernate technical framework, the most common solution is the HQL criterion query technique.
All Student objects whose age, is equal to 22 or whose age is null (null) are queried.
Criteria cr=session.createCriteria(Student.class);
cr.add(Restrictions.eq(“age”,new Integer(22));
cr.add(Restrictions.isNull(“age”));
It can be seen that each query condition requires one or more Java statements to be handwritten.
The two general technical solutions need to manually maintain SQL query templates or Java criterion sentences, and have the advantages of large workload, elaboration, complexity, error and incapability of being general.
The inventor proposes a method for querying data using a converted SQL statement aiming at the problems.
The embodiment of the disclosure provides a method for querying data by using a converted SQL statement, as shown in FIG. 1, the method comprises steps S100-S130;
s100, acquiring a basic SQL sentence comprising query filtering conditions, and converting the basic SQL sentence into an SQL abstract syntax tree;
s110, traversing the SQL abstract syntax tree, and judging whether a preset condition is met or not;
s120, if the preset condition is met, a modified SQL abstract syntax tree is obtained according to a predefined rule, and the modified SQL abstract syntax tree is output as a converted SQL sentence;
s130, querying the data meeting the query filtering condition in the database by utilizing the converted SQL statement.
In this embodiment, the basic SQL statement may be a general query statement, and the writing format of the statement is not particularly limited.
In an exemplary embodiment, after the obtaining the basic SQL statement including the query filtering condition, the method further includes: extracting four elements replaced by SQL variables according to the query filtering conditions; the four elements are SQL variable names, SQL variable data types, query filtering operations and constant values. In this embodiment, the query filtering condition dynamically transmitted can be organized into a list of four-element tuples, where a single tuple contains four elements, namely, SQL variable name (field), SQL variable data type (format), query filtering operation (op), and constant value (value).
In an exemplary embodiment, the traversing the SQL abstract syntax tree and determining whether a preset condition is met comprises: traversing the SQL abstract syntax tree; judging whether the SQL variable names in the SQL abstract syntax tree are matched with the SQL variable names of the four-element tuples corresponding to the query filtering conditions or not; and thirdly, if the matching is carried out, determining that the preset condition is met. And step four, if the two are not matched, ending the flow of the method.
In an exemplary embodiment, the determining whether the SQL variable name in the SQL abstract syntax tree matches the SQL variable name of the four-element tuple corresponding to the query filtering condition includes:
comparing the SQL variable names in the SQL abstract syntax tree with the SQL variable name character strings of the four-element tuples;
and if the character strings of the two variable names are equal, determining that the two variable names are matched.
In S120, if the preset condition is satisfied, a modified SQL abstract syntax tree is obtained according to a predefined rule, and the modified SQL abstract syntax tree is output as a converted SQL statement.
In an exemplary embodiment, the predefined rule includes: and according to the SQL variable data type of the four-element tuple, converting the SQL variable into an SQL constant expression corresponding to the SQL constant value of the four-element tuple. In this embodiment, if the SQL variable (SQL VariantRef) exists at another location, for example, exists as a function parameter, the SQL variable is replaced with the SQL constant expression corresponding to the constant value of the four-element tuple according to the SQL variable data type (format) of the four-element tuple. In this embodiment there is also the case that if the SQL variable (SQL Variant Ref) is a sub-expression in a certain SQL binary expression (SQL BinaryOpExpr), the constant values of the tuples are converted into the appropriate SQL constant expression according to the SQL variable data type (format) of the four-element tuple, replacing the SQL variable.
In an exemplary embodiment, the predefined rule further includes: if the SQL variable is a sub-expression in the SQL binary expression, modifying the binary operator of the SQL binary expression into a binary operator corresponding to the query filtering operation in the four-element tuple. In the embodiment, if the SQL variable (SQL Variant Ref) is a sub-expression in a certain SQL binary expression (SQL BinaryOpExpr), according to the SQL variable data type (format) of the four-element tuple, converting the constant value of the tuple into a proper SQL constant expression to replace the SQL variable; while dynamically modifying binary operators (SQL BinaryOperator) of the SQL binary expression according to values of query filtering operations (ops) of the four-element tuples.
For example: the SQL basic query statement is:
SELECT id,name FROM user WHERE(ISNULL(:userId)OR id=:userId)
the query filtering condition quadruple is as follows:
SQL variable name | SQL variable format | Query filtering operations | Constant value |
userId | integer | greaterThan | 1 |
Converted SQL statement:
SELECT id,name FROM user WHERE(ISNULL(1)OR id>1)
it can be seen that in the converted SQL statement, the function parameters in the underlying SQL statement are correctly converted, and the original binary expression id=: userId has been converted to a new expression id >1.
In an exemplary embodiment, the modifying the binary operator of the SQL binary expression into the binary operator corresponding to the query filtering operation in the four-element tuple comprises: according to the value of the query filtering operation and the preset corresponding relation in the mapping relation table of the SQL binary operator, replacing the query filtering operation of the four-element tuple with the binary operator; the preset corresponding relation comprises binary operators corresponding to different values of query filtering operation.
In an exemplary embodiment, the values of the query filtering operations in the mapping relation table of the SQL binary operators are in one-to-one correspondence with the binary operators. Wherein the mapping table is shown in table 1 below:
table 1 mapping relationship table of SQL binary operators
Query filtering operations (op) | SQL binary operator (SQL Binary Operator) |
equals | = |
not Equal | <> |
like | LIKE |
not Like | NOT LIKE |
greater Than | > |
greater Than Or Equal | >= |
lesser Than | < |
lesser Than Or Equal | <= |
In an exemplary embodiment, for some particular types of databases, some special query filtering operations (ops) require modifying both the left and right sub-expressions of the SQL binary expression to represent more complex operations. In this embodiment, modifying the left and right sub-expressions of the SQL binary expression simultaneously replaces the left and right sub-expressions (the SQL variable to be replaced and the corresponding SQL field) in the original SQL expression with nested SQL expressions to achieve more complex logic. For example: in the SQL statement of the MySQL database,
the original expression: name-! Name;
will be replaced with: name-! = 'abc' OR ISNULL (Name) =1;
from the above substitution, the left sub-expression Name of the original expression is replaced with Name-! = 'abc'; right sub-expression Name is replaced with ISNULL (Name) =1; SQL operator-! =replaced with OR. The conversion rules in this embodiment are dependent on the actual database, and the conversion rules of different databases are not identical, but have in common that the original expression needs to be converted into a nested multi-level expression.
Example one
For SQL query statement transformations, a specific example of an equivalent transformation of a notEquat operation under the mysql database is as follows:
in this example, SQL is not equal to the comparator < > cannot match a column with a value of NULL in the mysql database, but ORACLE can, in order to ensure that the query filtering effect across databases is consistent, therefore, the rule in this embodiment needs to be used for equivalent conversion;
the SQL basic query statement is:
SELECT id,name FROM user WHERE(ISNULL(:userName)OR name=:userName)
query filter condition quadruples:
SQL variable name | SQL variable format | Query filtering operations | Constant value |
userName | string | notEqual | a |
The converted sentence is:
SELECT id,name FROM user WHERE(ISNULL(1)OR(name<>'a'OR ISNULL(name)=1))
it can be seen that, in the converted SQL statement, the binary expression name=: userName in the basic SQL statement is converted into a new expression according to the conversion rule: name < 'a' OR ISNULL (name) =1.
In this embodiment, a method for modifying an SQL variable placeholder and a nearby SQL binary expression in a basic SQL statement to generate a final SQL statement according to the basic SQL query statement and a dynamically variable query filtering condition is provided in this embodiment. That is, only a simple basic SQL statement is needed to be prepared, and the detailed and complicated field-by-field operation preparation of various IF condition paragraphs in the original SQL template is omitted; and the cross-database query can be easily realized based on SQL conversion rules, and the operation is simple and convenient.
The present application also provides an apparatus for querying data using a converted SQL statement, as shown in fig. 2, the apparatus comprising: a memory 210 and a processor 220; the memory is used for storing a program for inquiring data by using the converted SQL statement, and the processor is used for reading and executing the program for inquiring data by using the converted SQL statement and executing the method in any of the above embodiments.
The present application also provides a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, perform the operations of the method of any of the above embodiments.
Those of ordinary skill in the art will appreciate that all or some of the steps, systems, functional modules/units in the apparatus, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between the functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed cooperatively by several physical components. Some or all of the components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.
Claims (10)
1. A method of querying data using a converted SQL statement, the method comprising:
acquiring a basic SQL sentence comprising query filtering conditions, and converting the basic SQL sentence into an SQL abstract syntax tree;
traversing the SQL abstract syntax tree, and judging whether a preset condition is met;
if the preset condition is met, a modified SQL abstract syntax tree is obtained according to a predefined rule, and the modified SQL abstract syntax tree is output as a converted SQL sentence;
and querying the data meeting the query filtering condition in the database by using the converted SQL sentence.
2. The method of claim 1, wherein after retrieving the basic SQL statement including the query filtering conditions, the method further comprises:
extracting four elements replaced by SQL variables according to the query filtering conditions;
the four elements are SQL variable names, SQL variable data types, query filtering operations and constant values.
3. The method of claim 2, wherein traversing the SQL abstract syntax tree and determining whether a preset condition is met comprises:
traversing the SQL abstract syntax tree;
judging whether SQL variable names in the SQL abstract syntax tree are matched with SQL variable names of four-element tuples corresponding to the query filtering conditions or not;
if so, determining that the preset condition is met.
4. The method for querying data using a converted SQL statement according to claim 3, wherein the determining whether the SQL variable name in the SQL abstract syntax tree matches the SQL variable name of the four-element tuple corresponding to the query filtering condition comprises:
comparing the SQL variable names in the SQL abstract syntax tree with the SQL variable name character strings of the four-element tuples;
and if the character strings of the two variable names are equal, determining that the two variable names are matched.
5. A method of querying data using a converted SQL statement as claimed in claim 3, wherein the predefined rules comprise:
and according to the SQL variable data type of the four-element tuple, converting the SQL variable into an SQL constant expression corresponding to the SQL constant value of the four-element tuple.
6. The method of claim 5, wherein the predefined rules further comprise:
if the SQL variable is a sub-expression in the SQL binary expression, modifying the binary operator of the SQL binary expression into a binary operator corresponding to the query filtering operation in the four-element tuple.
7. The method of claim 6, wherein modifying the binary operators of the SQL binary expression into binary operators corresponding to the query filtering operation in the four-element tuple comprises:
according to the value of the query filtering operation and the preset corresponding relation in the mapping relation table of the SQL binary operator, replacing the query filtering operation of the four-element tuple with the binary operator; the preset corresponding relation comprises binary operators corresponding to different values of query filtering operation.
8. The method of claim 7, wherein the values of the query filtering operations in the mapping table of the SQL binary operators are in one-to-one correspondence with the binary operators.
9. An apparatus for querying data using a converted SQL statement, the apparatus comprising: a memory and a processor; wherein the memory is used for storing a program for inquiring data by using a converted SQL sentence, and the processor is used for reading and executing the program for inquiring data by using the converted SQL sentence and executing the method of any one of claims 1-8.
10. A computer readable storage medium storing computer executable instructions which when executed by a processor perform operations in the method of any of claims 1-8.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310343237.9A CN116361328A (en) | 2023-03-31 | 2023-03-31 | Method and device for querying data by using converted SQL statement |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202310343237.9A CN116361328A (en) | 2023-03-31 | 2023-03-31 | Method and device for querying data by using converted SQL statement |
Publications (1)
Publication Number | Publication Date |
---|---|
CN116361328A true CN116361328A (en) | 2023-06-30 |
Family
ID=86931210
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202310343237.9A Pending CN116361328A (en) | 2023-03-31 | 2023-03-31 | Method and device for querying data by using converted SQL statement |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN116361328A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116756727A (en) * | 2023-08-22 | 2023-09-15 | 浙江华东工程数字技术有限公司 | Data authority control method and device, electronic equipment and storage medium |
CN117349332A (en) * | 2023-12-06 | 2024-01-05 | 宁波港信息通信有限公司 | Method and device for generating application programming interface API and electronic equipment |
-
2023
- 2023-03-31 CN CN202310343237.9A patent/CN116361328A/en active Pending
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN116756727A (en) * | 2023-08-22 | 2023-09-15 | 浙江华东工程数字技术有限公司 | Data authority control method and device, electronic equipment and storage medium |
CN116756727B (en) * | 2023-08-22 | 2023-12-29 | 浙江华东工程数字技术有限公司 | Data authority control method and device, electronic equipment and storage medium |
CN117349332A (en) * | 2023-12-06 | 2024-01-05 | 宁波港信息通信有限公司 | Method and device for generating application programming interface API and electronic equipment |
CN117349332B (en) * | 2023-12-06 | 2024-03-01 | 宁波港信息通信有限公司 | Method and device for generating application programming interface API and electronic equipment |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10769142B2 (en) | Graph processing in database | |
CN116361328A (en) | Method and device for querying data by using converted SQL statement | |
CN111046630B (en) | Syntax tree extraction method of JSON data | |
US7676453B2 (en) | Partial query caching | |
US8719299B2 (en) | Systems and methods for extraction of concepts for reuse-based schema matching | |
CN110543517A (en) | Method, device and medium for realizing complex query of mass data based on elastic search | |
TWI686707B (en) | Method and device for obtaining data inventory | |
CN107491476B (en) | Data model conversion and query analysis method suitable for various big data management systems | |
CN112579610A (en) | Multi-data source structure analysis method, system, terminal device and storage medium | |
US9053207B2 (en) | Adaptive query expression builder for an on-demand data service | |
US10776352B2 (en) | Generic query language for data stores | |
US20200201834A1 (en) | Systems and methods of efficient extensions of relational tables in a database | |
CN105302842A (en) | Data processing method and device | |
CN111125199B (en) | Database access method and device and electronic equipment | |
CN114116767A (en) | Method and device for converting SQL (structured query language) query statement of database | |
CN110569243A (en) | data query method, data query plug-in and data query server | |
CN116610697A (en) | Query method, storage medium and device for database query statement | |
US11379485B2 (en) | Inferred predicates for query optimization | |
CN113779068B (en) | Data query method, device, equipment and storage medium | |
CN108052522B (en) | Method and system for dynamically optimizing OLAP pre-calculation model | |
CN112527794A (en) | Data processing method and system for realizing set data types in database | |
CN110162574A (en) | Determination method, apparatus, server and the storage medium of fast resampling mode | |
US11803545B1 (en) | Runtime statistics feedback for query plan cost estimation | |
CN118093632B (en) | Graph database query method and device based on large language model and graph structure | |
CN110968634B (en) | Method for realizing ETL conversion processing by utilizing programmable function based on XML description in big data scene |
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 |