CN115039090A

CN115039090A - Data query method, device, server and storage medium

Info

Publication number: CN115039090A
Application number: CN202080094497.1A
Authority: CN
Inventors: 程际
Original assignee: Guangdong Oppo Mobile Telecommunications Corp Ltd; Shenzhen Huantai Technology Co Ltd
Current assignee: Guangdong Oppo Mobile Telecommunications Corp Ltd; Shenzhen Huantai Technology Co Ltd
Priority date: 2020-03-23
Filing date: 2020-03-23
Publication date: 2022-09-09
Also published as: WO2021189195A1

Abstract

The application discloses a data query method, a data query device, a server and a storage medium, wherein the data query method comprises the following steps: according to a label query condition, obtaining a logic expression corresponding to the label query condition, wherein the logic expression comprises single-layer or multi-layer logic, and the label query condition comprises a plurality of label conditions; generating a logic tree according to the logic expression; generating a query statement for querying the label data according to the logic tree; and querying the label data from the database corresponding to the label query condition according to the query statement. The method can realize data query of complex scenes.

Description

Data query method, device, server and storage medium

Technical Field

The present application relates to the field of data processing technologies, and in particular, to a data query method, apparatus, server, and storage medium.

Background

With the rapid development of network information technology, information recommendation technology based on big data technology is also developed. In the information recommendation technology, related information is recommended mainly according to tag data of a user, and in the information recommendation, a service party generally queries the tag data to perform a corresponding service according to the tag data.

Disclosure of Invention

In view of the foregoing problems, the present application proposes a data query method, apparatus, server and storage medium.

In a first aspect, an embodiment of the present application provides a data query method, where the method includes: according to a label query condition, obtaining a logic expression corresponding to the label query condition, wherein the logic expression comprises single-layer or multi-layer logic, and the label query condition comprises a plurality of label conditions; generating a logic tree according to the logic expression; generating a query statement for querying the label data according to the logic tree; and querying the label data from the database corresponding to the label query condition according to the query statement.

In a second aspect, an embodiment of the present application provides a data query apparatus, where the apparatus includes: the system comprises an expression generation module, a tree generation module, a statement generation module and a tag query module, wherein the expression generation module is used for acquiring a logic expression corresponding to a tag query condition according to the tag query condition, the logic expression comprises single-layer or multi-layer logic, and the tag query condition comprises a plurality of tag conditions; the tree generating module is used for generating a logic tree according to the logic expression; the statement generating module is used for generating a query statement for querying the label data according to the logic tree; and the label query module is used for querying the label data from the database corresponding to the label query condition according to the query statement.

In a third aspect, an embodiment of the present application provides a server, including: one or more processors; a memory; one or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to perform the data query method provided by the first aspect above.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, where a program code is stored in the computer-readable storage medium, and the program code may be called by a processor to execute the data query method provided in the first aspect.

According to the scheme provided by the application, the logic expression corresponding to the label query condition is obtained according to the label query condition, the logic expression comprises single-layer or multi-layer logic, the label query condition comprises a plurality of label conditions, then the logic tree is generated according to the logic expression, the query statement used for querying the label data is generated according to the logic tree, and finally the label data is queried from the database corresponding to the label query condition according to the query statement. Therefore, the label query condition formed by the label conditions is analyzed into the logic expression, the logic tree generated by the logic expression generates the query statement, and the label data is queried.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 shows a flow diagram of a data query method according to one embodiment of the present application.

Fig. 2 is a schematic diagram of a logic tree provided in an embodiment of the present application.

FIG. 3 is a diagram illustrating another example of a logic tree according to an embodiment of the present application.

FIG. 4 shows a flow diagram of a data query method according to another embodiment of the present application.

FIG. 5 shows a flow diagram of a data query method according to yet another embodiment of the present application.

FIG. 6 shows a flow diagram of a data query method according to yet another embodiment of the present application.

FIG. 7 shows a block diagram of a data query device according to an embodiment of the present application.

Fig. 8 is a block diagram of a server according to an embodiment of the present application for executing a data query method according to an embodiment of the present application.

Fig. 9 is a storage unit according to an embodiment of the present application, configured to store or carry program code for implementing a data query method according to an embodiment of the present application.

Detailed Description

In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application.

In information push, a business party usually queries the tag data, and the business party can determine a user, content and the like to be pushed through the queried tag data. For example, when a service party performs a circle taking on a user, the service party queries the corresponding user by using a plurality of label conditions.

In a conventional scheme of tag query, multiple tag conditions are usually restricted to the same level, the combination logic between each tag condition is restricted to full and logic or full or logic, and when the query logic is synthesized at the back end, the conditions of the respective tags are synthesized first and then combined at the same level, and are connected by using "and" or ", for example, condition 1+ condition 2, condition 3/condition 4.

The inventor finds that with the continuous increase of the number and the demand of the service parties, more and more user groups need to be circled, the demand points of the service parties in actual use are more and more detailed and complex, and the logical conditions of single-layer condition combination are difficult to continuously meet the user group circled demand of the service parties. For example: a certain service party needs to advertise for a user group which is installed with application a and application B at the same time but is not installed with application C, and the full or logic is difficult to realize.

In view of the above problems, the inventors propose a data query method, an apparatus, a server, and a storage medium provided in the embodiments of the present application, where a logic expression supporting multi-layer logic is obtained according to a tag query condition including multiple tag conditions, a logic tree is then generated according to the logic expression, a query statement is generated according to the logic tree, and finally, a query statement is used to query tag data, so as to meet the requirements of a complex service scenario. The specific data query method is described in detail in the following embodiments.

Referring to fig. 1, fig. 1 is a schematic flowchart illustrating a data query method according to an embodiment of the present disclosure. In a specific embodiment, the data query method is applied to the data query apparatus 400 shown in fig. 7 and the server 100 (fig. 8) configured with the data query apparatus 400. The specific flow of the embodiment will be described below by taking a server as an example, and it is understood that the server applied in the embodiment may be a conventional server, a cloud server, and the like, and is not limited herein. As will be described in detail with respect to the flow shown in fig. 1, the data query method may specifically include the following steps:

step S110: and acquiring a logic expression corresponding to the label query condition according to the label query condition, wherein the logic expression comprises single-layer or multi-layer logic, and the label query condition comprises a plurality of label conditions.

In the embodiment of the application, the server analyzes the tag query condition to obtain the logic expression corresponding to the tag query condition. The label query condition is a condition for restricting label data, and the label query condition comprises a plurality of label conditions. Of course, the label query condition also includes a relationship among a plurality of label conditions, such as a parallel relationship. The tag condition is a single condition that defines tag data. For example, a service party wants to advertise to users who have application 1 and application 2 installed at the same time but have no application 3 installed, and the set label query condition is the users who have application 1 and application 2 installed at the same time but have no application 3 installed; for another example, a game company wants to increase the retention rate of a recent active game player, and to put a game award to the recent active game player, the set label query condition is a user who has a game duration exceeding 24 hours or a login number exceeding 10 times in the last week. Of course, the specific tag query condition may not be limiting.

In some embodiments, the tag query condition may be sent to a server by the service party, and the server receives the query condition accordingly. It can be understood that, when the service party needs to query the tag data, the service party may send the tag query condition to the server through the electronic device of the service party, so that the server may query the tag data, and obtain the queried tag data from the server.

In some embodiments, the tag query condition may also be stored in the server in advance, and when the server needs to query the tag data, the server may read the tag query condition to query the tag data. For example, the server may periodically return the tag data to the service party according to a requirement of the service party for the tag data, so that the server may store the tag query condition, and then periodically query the latest tag data according to the tag query condition, and then return the tag data to the service party. For another example, the tag query condition may be set locally by the server, and the server may perform corresponding pushing according to the tag data after querying to obtain the tag data.

In some embodiments, the server parses the tag query condition to parse out a plurality of tag conditions and a plurality of logical relationships between the tag conditions. And then generating a logic expression according to the plurality of label conditions and the logic relation among the plurality of label conditions. Wherein, the logical relationship can be and, or, etc. The logic expression is a formula consisting of an operator corresponding to the logic relationship and the label condition. For example, if the tag query condition is a user installed with application a or B and with application C, the logical expression may be (application a or application B) and application C. Of course, the way in which the server generates the logical expression and the form of the logical expression may not be limiting.

In some embodiments, the logic expression may include a single layer of logic or multiple layers of logic. The single-layer logic refers to logic that can obtain a result through only one logical operation, for example, a and B; the multi-layer logic refers to the logic that needs to obtain the result through multiple logic operations, for example, (a or B) and C. The multi-level logic may include explicit multi-level logic with bracket layering and implicit layering logic without brackets. For example, the multi-level logic is shown as (((A and B) and C) and D), and the implicit hierarchical logic is A and B or C and D.

Step S120: and generating a logic tree according to the logic expression.

In this embodiment, after the server generates the logic expression, the server may generate the logic tree according to the logic expression. The logic tree is used for representing the logic relation of the label conditions in the logic expression, and the logic relation among the label conditions is expressed in the form of text.

In some embodiments, when the server generates the logic tree according to the logic expression, if the logic expression includes a single-layer logic, the generated logic tree may be obtained by sequentially connecting the respective tag conditions as tree nodes according to a logic feature between the respective tag conditions in the logic expression. The logical features may be logical conjunction words, logical relation symbols, logical operators, and the like, which are not limited herein.

When the server generates the logic tree according to the logic expression, if the logic expression includes multiple layers of logic, a logic sub-tree can be generated according to each layer of logic in the multiple layers of logic, and then all the logic sub-trees are combined to obtain the logic tree corresponding to the logic expression. The logical features may also be logical conjunction words, logical relation symbols, logical operators, and the like, which are not limited herein. The server generates a logic sub-tree of each layer of logic, which may refer to a manner of generating a logic tree when the logic expression includes a single layer of logic.

When the server merges all the logic subtrees to obtain the logic tree corresponding to the logic expression, the logic subtrees corresponding to the logics of each layer can be taken as tree nodes in the logic subtree corresponding to the logic of the next layer in sequence according to the sequence of the logics in the logic expression, and the logic trees corresponding to the logic expression can be obtained.

Each logic subtree comprises at least two tree nodes, each tree node can be a label condition or a logic subtree of a certain layer of logic, and thus, according to the sequence, the logic subtrees are sequentially used as tree nodes in the logic subtree corresponding to the next layer of logic and added into the logic subtree, and then the logic subtree after the logic subtree is added into the next logic subtree until the logic subtree of the last layer of logic is added. For example, when the logical expression is (((a and B) and C) and D), the server first generates a logical subtree 1 of (a and B), a logical subtree 2 of (E and C), and a logical subtree 3 of (F and D), where a and B are tree nodes of the logical subtree 1, E and C are tree nodes of the logical subtree 2, and F and D are tree nodes of the logical subtree 3, and when synthesizing the logical subtree, because the first-level logic is (a and B), the logical subtree 1 is used as a tree node E in the logical subtree 2, E is replaced by E and added to the logical subtree 2, and then the logical subtree 2 to which the logical subtree 1 is added is used as a tree node F in the logical subtree 3, so that the finally synthesized logical tree can be obtained.

In other embodiments, when the server generates the logic tree according to the logic expression, if the logic expression includes multiple layers of logics, the server may also sequentially generate connected tree nodes according to the sequence of each layer of logics appearing in the logic expression, thereby forming the logic tree. For example, if the logical expression is (((a and B) and C) and D), then the server first generates tree nodes of the first level of logic (a and B), then generates tree nodes of C according to the logic of the next level, connects the tree nodes of (a and B) with the tree nodes of C using and, then generates tree nodes of D according to the logic of the next level, and connects the tree nodes that have been connected up to now with D using and, thereby obtaining the final logical tree.

In some embodiments, the logical tree may be a binary tree, where a binary tree is a tree structure with at most two subtrees per node. Illustratively, the logical expression is (((A and B) and C) and D), and the generated logical tree is shown in FIG. 2. When the logic expression is A and B or C and D, the generated logic tree is shown in FIG. 3. Of course, the above are merely examples and do not represent a limitation on a particular logical tree.

The logic tree is generated in the mode, clear and reasonable expression of multi-layer complex logic combination can be realized, and after the logic tree is successfully analyzed, the synthesis of the query condition can be rapidly and clearly completed, so that the labor cost is saved.

Step S130: and generating a query statement for querying the label data according to the logic tree.

In this embodiment, after the server generates the logical tree, a query statement for querying the table parent data may be generated according to the logical tree. In some embodiments, the server may traverse the logical tree to complete the synthesis of the query statement. Specifically, the server may traverse the logic tree according to a query engine employed by a corresponding database, and further generate a query statement corresponding to the database. The query statement may be a query code, and may be used to query data from a corresponding database.

Step S140: and querying the label data from the database corresponding to the label query condition according to the query statement.

In this embodiment of the present application, after the server generates the query statement, the server may query the tag data from the database corresponding to the tag query condition by using the query statement. The database corresponding to the tag query condition is a database where the tag data corresponding to the tag query condition is located, for example, if the tag query condition has the tag data of the query user account, the database is a database storing the tag data of the user account.

In some embodiments, the server may send the query statement to a database corresponding to the tag query condition to query the database for corresponding tag data. In other embodiments, the database may be local to the server, and the server may directly query the tag data from the database according to the query statement.

The server inquires the obtained label data and can be used for sending the label data to the service party, so that the inquiry requirement of the label data of the service party is met. The server may determine the content to be pushed according to the tag data, and push the content to be pushed to the user. Of course, the specific usage scenario may not be limiting.

According to the data query method provided by the embodiment of the application, the logic expression corresponding to the label query condition is obtained according to the label query condition, the logic expression comprises single-layer or multi-layer logic, the label query condition comprises a plurality of label conditions, then the logic tree is generated according to the logic expression, the query statement for querying the label data is generated according to the logic tree, and finally the label data is queried from the database corresponding to the label query condition according to the query statement. Therefore, the label query condition formed by the label conditions is analyzed into the logic expression, the logic tree generated by the logic expression generates the query statement, and the label data is queried. When the people circle taking machine is used for people circle taking, the flexibility of the people circle taking can be improved, and the people can be positioned more accurately.

Referring to fig. 4, fig. 4 is a schematic flowchart illustrating a data query method according to another embodiment of the present application. The data query method may be applied to the server, and as will be described in detail with respect to the flow shown in fig. 4, the data query method may specifically include the following steps:

step S210: according to the label query condition, logic features among a plurality of label conditions in the label query condition are obtained, and the label query condition comprises the plurality of label conditions.

In the embodiment of the application, when the server generates the logic expression according to the tag query condition, the server can obtain the logic characteristics among a plurality of tag conditions. The logic features can be obtained from the label query conditions in a manner of extracting the features of the label query conditions.

In some embodiments, the server may identify a connection term between a plurality of tagged conditions in the tagged query condition as a logical feature between the plurality of tagged conditions. Specifically, the server may identify keywords in the tag query, and determine a connecting word from the identified keywords. The server can identify a plurality of key words in the label query condition through semantic identification, and determine a plurality of label conditions and connecting words among the label conditions from the key words. For example, the tag query condition is: if application a, application B, or application C is installed and D is installed, application a, application B, application C, application D, or, and "or" and "is the conjunction.

In some embodiments, before the server obtains the logic expression corresponding to the tag query condition according to the tag query condition, the server may further send some information of the tag data to a service end corresponding to the service party, so that the service party determines the tag query condition according to the information of the tag data. Specifically, the server may send a keyword set corresponding to a currently existing tag to the service end, where the keyword set is used for the service end to generate a tag query condition; and receiving a label query condition returned by the service end. The keyword set corresponding to the tag may be a keyword reflecting characteristics of the tag data, so that the user can know what types of tag data are, what content of the tag data is, and the like.

Certainly, the information of the tag data specifically sent by the server to the service end may not be limited, for example, the server may provide a page selected by the tag data to the service end, and the page may include options of each screenable tag condition and a selection of a logical relationship between the options, so that a user of the service end may quickly and conveniently determine the tag query condition through an operation on the page. After receiving the label query condition returned by the service end, the server may generate a logical expression according to the label query condition.

Step S220: and generating a logic expression consisting of the plurality of label conditions according to the logic characteristics, wherein the logic expression comprises single-layer or multi-layer logic.

In the embodiment of the present application, after obtaining the logical features in the tag query condition, the server may generate a logical expression composed of the above multiple tag conditions according to the identified logical features. It will be appreciated that the logical characteristics reflect the logical relationship between the tag conditions, and thus the tag conditions can be combined using the logical relationship to form a logical expression.

In some embodiments, the server may determine a corresponding logical relation according to the logical characteristics, and then generate a logical expression composed of a plurality of tag conditions according to the logical relation. The logical relation symbol may be and, or, etc. And combining the logic conditions by the logic relation characters so as to form a logic expression corresponding to the label inquiry condition.

Step S230: and generating a logic tree according to the logic expression.

In the embodiment of the present application, step S230 may refer to the contents of the foregoing embodiments, and is not described herein again. The logic tree can clearly and reasonably express the multi-layer complex logic combination, is very convenient for subsequent use and has good support for various query languages. After the logic tree is successfully analyzed, the synthesis of the query conditions can be rapidly and clearly completed, the labor cost is saved, specifically, after the logic tree is generated, the decoupling of the front-end expression and the rear-end synthesis query statement is well completed for the subsequent statement synthesis, and the server uses the logic tree to flexibly cooperate with most query engines to synthesize the query statement.

Step S240: a query engine is invoked.

In this embodiment of the present application, the server may invoke a corresponding query engine. The query engine may be a query engine corresponding to a database, and it can be understood that different databases may correspond to different query engines and may identify different query statements, and therefore, the query engine needs to be used to synthesize the query statements corresponding to the databases.

In some embodiments, the server may determine a database in which the tag data corresponding to the tag query condition is located. The server can determine in which database the tag data to be queried is stored according to the tag query condition. As one mode, the server may store corresponding relations between each type of tag data and the database, and the server may determine the type of the tag data to be queried according to the tag query condition, and then may determine the database in which the tag data exists according to the corresponding relations, for example, if the type of the queried tag data is an International Mobile Equipment Identity (IMEI) of the Mobile terminal, the database may be determined to be the tag database storing the IMEI. As another embodiment, the server may also determine the type of the tag data that needs to be queried, then send the type of the tag data to each database, and determine the database in which the tag data exists according to a result returned by each database, for example, if the result returned by the database 1 is that the tag data of the type is currently stored, determine that the database in which the tag data exists is the database 1.

After the server determines the database, the server may call a query engine corresponding to the database. As one mode, the server may store a corresponding relationship between each data and the query engine, and each query engine is provided, so that the server may determine the query engine according to the determined database, and call the determined query engine.

In some embodiments, before the server invokes the query engine, it may further determine whether data corresponding to the tag query condition exist in the same database, and if the data corresponding to the tag query condition exist in the same database, the same query engine may be used to synthesize a query statement; if the data corresponding to the tagged query conditions do not exist in the same database, the same query engine may not be used to synthesize the query statement.

It can be understood that, when data corresponding to the tag query condition exists in the same database, it means that tag data query can be performed in the same database, and therefore, a query engine of the database can be directly used to perform synthesis of a query statement; if the data corresponding to the tag query condition does not exist in the same database, it means that the tag data needs to be queried from a plurality of databases.

Further, if the data corresponding to the tag query condition does not exist in the same database, the database where the data corresponding to each tag condition in the tag query condition is located may be determined, the tag data may be queried from the corresponding database according to each tag condition, and finally, the tag data corresponding to each tag condition may be screened, combined, deduplicated, and the like according to the determined logical characteristics.

Step S250: and traversing the logic tree by utilizing the query engine to obtain a query statement for querying the tag data.

In this embodiment, the server may traverse the logic tree by using the query engine to obtain a query statement for querying the tag data. And all the query engines of the database can realize the traversal of the logic tree. Specifically, the query engine may traverse the logic tree in a recursive manner, and combine all the label conditions together according to the traversal result to synthesize a final query statement.

In some embodiments, the obtained query statement is a query code corresponding to the database, and the query code can be identified by the database. Illustratively, the query statement is shown as the following code:

Select imei

From xxxTable

Where

(abc.bcd.cde.value in(1,2,3)and abc.bcd.edf.weight in(2,3,4))or

(abc.bcd.cde.value in(11,12,13)and abc.bcd.edf.weight in(22,23,24))

step S260: and querying the label data from the database corresponding to the label query condition according to the query statement.

In the embodiment of the present application, step S260 may refer to the contents of the foregoing embodiments, which are not described herein again.

According to the data query method provided by the embodiment of the application, the logic characteristics among the label conditions in the label query conditions are obtained, the logic expression formed by the label conditions is generated according to the logic characteristics, then the logic tree is generated according to the logic expression, the database where the label data corresponding to the label query conditions are located is determined, the query engine corresponding to the database is called, the logic tree is traversed by the query engine, the query statement for querying the label data is obtained, and finally the label data is queried from the database corresponding to the label query conditions according to the query statement. Therefore, the label query condition formed by the label conditions is analyzed into the logic expression, the logic tree generated by the logic expression generates the query statement, and the label data is queried. When the people circle and get, the flexibility of the people circle and get can be improved, and the people can be positioned more accurately.

Referring to fig. 5, fig. 5 is a schematic flow chart illustrating a data query method according to another embodiment of the present application. The data query method may be applied to the server, and as will be described in detail with respect to the flow shown in fig. 5, the data query method may specifically include the following steps:

step S310: according to a label query condition, a logic expression corresponding to the label query condition is obtained, wherein the logic expression comprises single-layer or multi-layer logic, and the label query condition comprises a plurality of label conditions.

Step S320: and generating a logic tree according to the logic expression.

Step S330: and generating a query statement for querying the label data according to the logic tree.

Step S340: and querying the label data from the database corresponding to the label query condition according to the query statement.

In the embodiment of the present application, steps S310 to S340 may refer to the contents of the foregoing embodiments, and are not described herein again.

Step S350: and storing the query statement.

In this embodiment, the server may store the above query statement. Specifically, the server may store the above tag query conditions in correspondence with the obtained query statement. It can be understood that the server stores the query statement, and then the query statement can be directly utilized to query when data is subsequently queried according to the same tag query condition, so that the query speed of tag data is increased.

Step S360: and generating a statement identifier of the query statement.

In an embodiment of the present application, the server may generate a statement identifier of the query statement. The statement identifier is used as an identity identifier of the query statement, and the form of the statement identifier may not be limited, and may be any field content.

Step S370: and sending the corresponding relation between the label query condition and the statement identification to a service end.

In this embodiment, the server may send the correspondence between the tag query condition and the statement identifier to the service end. Specifically, when the service end needs to query the tag data, the server may issue the corresponding relationship, so that the service end generates a query request according to the corresponding statement identifier. The service end can determine corresponding statement identification according to the input label query condition, and generate a query request according to the statement identification.

In some embodiments, when the service end accesses the query page of the tag data, the server issues the corresponding relationship between the tag query condition and the statement identifier. When the service end accesses the query page of the label data, an access request of the page can be generated, and when the server receives the access request, the corresponding relation is sent to the service end.

In some embodiments, the server may also send the corresponding relationship between the tag query condition and the statement identifier to the service end in advance, and the service end may store the corresponding relationship. When a user of the service end needs to perform tag query, the service end may determine a corresponding statement identifier according to an input tag query condition, and generate a query request according to the statement identifier.

Step S380: and when the query request corresponding to the query statement is acquired, reading the query statement.

In this embodiment of the application, when the server receives the query request corresponding to the query statement, it indicates that the service end needs to query the tag data by using the query statement, that is, query the tag data according to the above tag query condition, so that the server can directly read the stored query statement, so as to query the tag data from the database by using the query statement.

Specifically, the server may receive an inquiry request sent by the service end, then determine whether the inquiry request carries the statement identifier, and if the inquiry request carries the statement identifier, indicate that the inquiry request is an inquiry request corresponding to the inquiry statement, at this time, the server may read the inquiry statement; if the query request carries the statement identifier, the query request is represented as a query request corresponding to the query statement, and at this time, the server can read the query statement; if the query request does not carry the statement identifier, it indicates that the query request is not the query request corresponding to the query statement, and at this time, the server queries the tag data according to the tag query condition carried in the query request in the manner from step S310 to step S340. It can be understood that, when the service end determines that there is no statement identifier corresponding to the tag query condition according to the input tag query condition, the service end may generate a query request according to the tag query condition, and at this time, the query request may carry the tag query condition.

Step S390: and inquiring the label data from the database corresponding to the label inquiry condition according to the inquiry condition.

In the embodiment of the application, when the server queries the tag data from the database corresponding to the tag query condition according to the query condition, the server may send the query statement to the database corresponding to the tag query condition, and then receive the tag data returned by the database. In some embodiments, the server sends the query statement to the hive of the database corresponding to the tag query condition through the query interface. The hive is a data warehouse tool based on Hadoop, can map the structured data file into a database table, and provides a simple sql query function. Hive has the advantages that the learning cost is low, simple MapReduce statistics can be quickly realized through SQL-like sentences, special MapReduce application does not need to be developed, and the statistical analysis method is very suitable for statistical analysis of a data warehouse. After the hive of the database receives the query statement sent by the server, the tag data stored in the hive of the database can be queried according to the query statement, the tag data meeting the tag query condition is obtained, and the searched tag data is returned to the server.

According to the data query method provided by the embodiment of the application, the label query condition formed by the plurality of label conditions is analyzed into the logic expression, the logic tree generated by the logic expression is used for generating the query statement, and the label data is queried. When the people circle and get, the flexibility of the people circle and get can be improved, and the people can be positioned more accurately. In addition, the query sentences are stored, sentence identifiers corresponding to the query sentences are generated, the corresponding relation between the sentence identifiers and the label query conditions is sent to the service end, the service end can conveniently generate a query request according to the sentence identifiers, the server can directly utilize the stored query sentences to query the label data according to the query request, and the query speed of the label data is improved.

Referring to fig. 6, fig. 6 is a schematic flowchart illustrating a data query method according to yet another embodiment of the present application. The data query method may be applied to the server, and as will be described in detail with respect to the flow shown in fig. 6, the data query method may specifically include the following steps:

step S400: and acquiring a logic expression corresponding to the label query condition according to the label query condition, wherein the logic expression comprises single-layer or multi-layer logic, and the label query condition comprises a plurality of label conditions.

Step S401: and generating a logic tree according to the logic expression.

Step S402: and generating a query statement for querying the label data according to the logic tree.

Step S403: and querying the label data from the database corresponding to the label query condition according to the query statement.

In the embodiment of the present application, steps S400 to S403 may refer to the contents of the foregoing embodiments, and are not described herein again.

Step S404: and storing the corresponding relation between the logic tree and the label query condition.

In this embodiment, the server may further store the correspondence between the generated logical tree and the above tag query condition. It can be understood that the server stores the corresponding relationship between the logic tree and the above tag query condition, and then the logic tree can be directly used for synthesis with other logic trees when data query is subsequently performed according to a new query condition including the tag query condition, thereby effectively saving data query time and improving data query speed.

Step S405: and acquiring a first query condition.

Step S406: and if the first query condition comprises the label query condition and at least one second query condition, generating a first logic tree according to the at least one second query condition.

In this embodiment of the application, after the server obtains the first query condition, it may be determined whether the first query condition includes the above tag query condition and at least one second tag query condition. If the first query condition comprises the above tag query condition and at least one second tag query condition, the server may synthesize the logic tree of the tag query condition with the logic tree of the second tag query condition to form a new logic tree; if the first query condition does not include the above tag query condition, the server may generate a logical tree according to the first tag query condition, generate a new query statement according to the logical tree, and query tag data from the database according to the query statement.

In some embodiments, if the server determines that the first query condition includes the above tag query condition and at least one second tag query condition, the server may read a logical tree corresponding to the tag query condition, and generate a first logical tree corresponding to the second tag query condition according to the second tag query condition. For details, the manner of generating the first logic tree may refer to the contents of the foregoing embodiments, and is not described herein again.

Step S407: and synthesizing the logic tree corresponding to the label query condition with the first logic tree to obtain a second logic tree.

In this embodiment of the present application, after the server generates the first logic tree, the server may synthesize the logic tree corresponding to the above tag query condition with the first logic tree to obtain the second logic tree. Specifically, the server may identify a logical relationship between the above tag query condition and the second tag query condition in the first query condition, and then synthesize the logical tree corresponding to the tag query condition with the first logical tree by using the logical relationship.

In some embodiments, before synthesizing the logic tree corresponding to the tag query condition with the first logic tree to obtain the second logic tree, the server may further determine whether the database corresponding to the tag query condition is the same as the database corresponding to the second query condition. If the database corresponding to the tag query condition is the same as the database corresponding to the second query condition, it indicates that the data corresponding to the first query condition all exist in the same database, it indicates that the tag data query can be performed in the same database, and then the query engine of the database can be directly used to perform the synthesis of the query statement, so that the server can synthesize the logic tree corresponding to the tag query condition with the first logic tree to obtain the second logic tree.

If the database corresponding to the tag query condition is different from the database corresponding to the second query condition, the data corresponding to the first query condition does not exist in the same database, and the tag data cannot be queried from the same database. In this case, the server may generate a target query statement according to the first logic tree, where the target query statement is used to query the tag data from the database corresponding to the second query condition. After the server generates the target query statement, the server may query the tag data from the database corresponding to the second query condition according to the target query statement. In addition, the server may query the tag data from the data corresponding to the tag query condition according to the query statement corresponding to the tag query condition. After the query of the tag data is completed, the server performs screening, combination, duplicate removal and the like on the tag data according to the logical relationship between the tag query condition and the second query condition, so as to obtain the finally queried tag data.

Step S408: and generating a query statement corresponding to the first query condition according to the second logic tree.

Step S409: and inquiring the label data from a database according to the inquiry statement corresponding to the first inquiry condition.

In the embodiment of the present application, step S408 and step S409 may refer to the contents of the foregoing embodiments, and are not described herein again.

The label query condition formed by the label conditions is analyzed into the logic expression, the logic tree generated by the logic expression generates the query statement, and the label data is queried. When the people circle and get, the flexibility of the people circle and get can be improved, and the people can be positioned more accurately. In addition, the corresponding relation between the logic tree and the label query condition is stored, so that the logic tree can be directly synthesized with other logic trees when data query is subsequently performed according to a new query condition comprising the label query condition, the data query time is effectively saved, and the data query speed is improved.

Referring to fig. 7, a block diagram of a data query apparatus 400 according to an embodiment of the present application is shown. The data query apparatus 400 employs the above-mentioned server, and the data query apparatus 400 includes: an expression generation module 410, a tree generation module 420, a statement generation module 430, and a tag query module 440. The expression generating module 410 is configured to obtain a logic expression corresponding to a tag query condition according to the tag query condition, where the logic expression includes a single-layer or multi-layer logic, and the tag query condition includes multiple tag conditions; the tree generating module 420 is configured to generate a logic tree according to the logic expression; the statement generating module 430 is configured to generate a query statement for querying the tag data according to the logic tree; the tag query module 440 is configured to query tag data from a database corresponding to the tag query condition according to the query statement.

In some implementations, the statement generation module 430 includes: the engine calling unit is used for calling the query engine; and the traversing unit is used for traversing the logic tree by utilizing the query engine to obtain a query statement for querying the label data.

In this embodiment, the engine invoking unit may specifically be configured to: determining a database where the label data corresponding to the label query condition is located; and calling a query engine corresponding to the database.

In this embodiment, the traversal unit may be specifically configured to: and traversing the logic tree by using the query engine in a recursive mode to obtain a query statement for querying the label data.

In some implementations, the expression generation module 410 can include: a feature obtaining unit, configured to obtain a logic feature between multiple tag conditions in the tag query condition; and the generating unit is used for generating a logic expression formed by the plurality of label conditions according to the logic characteristics.

In this embodiment, the generating unit may specifically be configured to: determining a corresponding logical relation symbol according to the logical characteristics; and generating a logic expression consisting of the plurality of label conditions according to the logic relation character.

In this embodiment, the feature obtaining unit may be specifically configured to: and identifying connecting words among a plurality of label conditions in the label query conditions, and taking the connecting words as logic features among the plurality of label conditions.

In some embodiments, the data query apparatus 400 may further include: the device comprises a first sending module and a first receiving module. The first sending module is used for sending a keyword set corresponding to a currently existing label to a service end before the logic expression corresponding to the label query condition is obtained according to the label query condition, wherein the keyword set is used for the service end to generate the label query condition; the first receiving module is used for receiving the label inquiry condition returned by the service end.

In some embodiments, the data query apparatus 400 may further include: a first storage module. And the first storage module is used for storing the query statement after generating the query statement for querying the label data according to the logic tree.

In this embodiment, the data query apparatus 400 may further include: and a statement reading module. And the statement reading module is used for reading the query statement when the query request corresponding to the query statement is obtained. The tag query module 440 may be further configured to, after reading the query statement, query tag data from a database corresponding to the tag query condition according to the query condition.

Further, the data query apparatus 400 may further include: a sentence mark generating module and a second sending module. The statement mark generating module is used for generating a statement mark of the query statement before the query statement is read when the query request corresponding to the query statement is obtained; and the second sending module is used for sending the corresponding relation between the label query condition and the statement identifier to a service end. The statement reading module may be specifically configured to: receiving a query request sent by the service end; and if the query request carries the statement identification, reading the query statement.

In some implementations, the tag query module 440 can include: a sentence transmitting unit and a data receiving unit. The statement sending unit is used for sending the query statement to a database corresponding to the label query condition; and the data receiving unit is used for receiving the label data returned by the database.

In this embodiment, the statement sending unit may specifically be configured to: and sending the query statement to the hive of the database corresponding to the label query condition through a query interface.

In some embodiments, the data query apparatus 400 may further include: and a second storage module. And the second storage module is used for storing the corresponding relation between the logic tree and the label query condition after the logic tree is generated according to the logic expression.

In some embodiments, the data query apparatus 400 may further include: a condition acquisition module and a tree synthesis module. The condition acquisition module is used for acquiring a first query condition; the tree generation module 420 is further configured to generate a first logical tree according to at least one second query condition if the first query condition includes the tag query condition and the at least one second query condition; the tree synthesis module is used for synthesizing the logic tree corresponding to the label query condition with the first logic tree to obtain a second logic tree; the statement generating module 430 is further configured to generate a query statement corresponding to the first query condition according to the second logic tree.

In this embodiment, the data query apparatus 400 may further include: and a database judging module. The database judging module is used for judging whether the database corresponding to the label query condition is the same as the database corresponding to the second query condition or not before synthesizing the logic tree corresponding to the label query condition with the first logic tree to obtain the second logic tree. And if the label query conditions are the same, the tree synthesis module synthesizes the logic tree corresponding to the label query conditions with the first logic tree to obtain a second logic tree.

Further, the statement generating module 430 is further configured to, after determining whether the database corresponding to the tag query condition is the same as the database corresponding to the second query condition, if the database corresponding to the tag query condition is not the same as the database corresponding to the second query condition, generate a target query statement according to the first logic tree, where the target query statement is used to query tag data from the database corresponding to the second query condition.

It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described apparatuses and modules may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided in the present application, the coupling between the modules may be electrical, mechanical or other type of coupling.

In addition, functional modules in the embodiments of the present application may be integrated into one processing module, or each of the modules may exist alone physically, or two or more modules are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.

In summary, according to the scheme provided by the application, a logic expression corresponding to a tag query condition is obtained according to the tag query condition, the logic expression includes a single-layer or multi-layer logic, the tag query condition includes a plurality of tag conditions, then a logic tree is generated according to the logic expression, a query statement for querying tag data is generated according to the logic tree, and finally, the tag data is queried from a database corresponding to the tag query condition according to the query statement. Therefore, the label query condition formed by the label conditions is analyzed into the logic expression, the logic tree generated by the logic expression is used for generating the query statement, and the label data is queried.

Referring to fig. 8, a block diagram of a server according to an embodiment of the present disclosure is shown. The server 100 may be a conventional server, a cloud server, or the like capable of running an application. The server 100 in the present application may include one or more of the following components: a processor 110, a memory 120, a touch screen 130, and one or more applications, wherein the one or more applications may be stored in the memory 120 and configured to be executed by the one or more processors 110, the one or more programs configured to perform the methods as described in the aforementioned method embodiments.

Processor 110 may include one or more processing cores. The processor 110 connects various parts within the overall server 100 using various interfaces and lines, performs various functions of the server 100 and processes data by executing or executing instructions, programs, code sets, or instruction sets stored in the memory 120, and calling data stored in the memory 120. Alternatively, the processor 110 may be implemented in hardware using at least one of Digital Signal Processing (DSP), Field-Programmable Gate Array (FPGA), and Programmable Logic Array (PLA). The processor 110 may integrate one or a combination of a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), a modem, and the like. Wherein, the CPU mainly processes an operating system, a user interface, an application program and the like; the GPU is used for rendering and drawing display content; the modem is used to handle wireless communications. It is understood that the modem may not be integrated into the processor 110, but may be implemented by a communication chip.

The Memory 120 may include a Random Access Memory (RAM) or a Read-Only Memory (Read-Only Memory). The memory 120 may be used to store instructions, programs, code sets, or instruction sets. The memory 120 may include a stored program area and a stored data area, wherein the stored program area may store instructions for implementing an operating system, instructions for implementing at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing various method embodiments described below, and the like. The storage data area may also store data created by the server 100 in use (such as phone books, audio and video data, chat log data), and the like.

Referring to fig. 9, a block diagram of a computer-readable storage medium provided in an embodiment of the present application is shown. The computer-readable medium 800 has stored therein a program code that can be called by a processor to execute the method described in the above-described method embodiments.

The computer-readable storage medium 800 may be an electronic memory such as a flash memory, an EEPROM (electrically erasable programmable read only memory), an EPROM, a hard disk, or a ROM. Alternatively, the computer-readable storage medium 800 includes a non-volatile computer-readable storage medium. The computer readable storage medium 800 has storage space for program code 810 to perform any of the method steps of the method described above. The program code can be read from or written to one or more computer program products. The program code 810 may be compressed, for example, in a suitable form.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.

Claims

A method of data query, the method comprising:

according to a label query condition, obtaining a logic expression corresponding to the label query condition, wherein the logic expression comprises single-layer or multi-layer logic, and the label query condition comprises a plurality of label conditions;

generating a logic tree according to the logic expression;

generating a query statement for querying the label data according to the logic tree;

and querying the label data from the database corresponding to the label query condition according to the query statement.
The method of claim 1, wherein generating a query statement for querying tag data according to the logical tree comprises:

calling a query engine;

and traversing the logic tree by utilizing the query engine to obtain a query statement for querying the tag data.
The method of claim 2, wherein invoking the target query engine comprises:

determining a database where the label data corresponding to the label query condition is located;

and calling a query engine corresponding to the database.
The method of claim 2 or 3, wherein traversing the logical tree with the query engine to obtain a query statement for querying tag data comprises:

and traversing the logic tree by using the query engine in a recursive mode to obtain a query statement for querying the label data.
The method of any of claims 1-4, wherein the logical expression comprises a plurality of layers of logic, and wherein generating a logical tree from the logical expression comprises:

generating a logic sub-tree according to each layer of logic in the multi-layer logic;

and merging all the logic subtrees to obtain a logic tree corresponding to the logic expression.
The method of claim 5, wherein the merging all the logic subtrees to obtain the logic tree corresponding to the logic expression comprises:

and according to the sequence of each layer of logic in the logic expression, sequentially taking the logic subtrees corresponding to each layer of logic as tree nodes in the logic subtrees corresponding to the next layer of logic, and merging the logic subtrees to obtain the logic trees corresponding to the logic expression.
The method according to any one of claims 1 to 6, wherein the obtaining a logic expression corresponding to the tag query condition according to the tag query condition comprises:

acquiring logic characteristics among a plurality of label conditions in the label query conditions;

and generating a logic expression consisting of the plurality of label conditions according to the logic characteristics.
The method of claim 7, wherein generating a logical expression from the plurality of tag conditions according to the logical characteristic comprises:

determining a corresponding logical relation character according to the logical characteristics;

and generating a logic expression consisting of the plurality of label conditions according to the logic relation character.
The method according to claim 7 or 8, wherein the obtaining of the logical characteristics between the plurality of tag conditions in the tag query condition comprises:

and identifying connecting words among a plurality of label conditions in the label query condition, and taking the connecting words as logic characteristics among the plurality of label conditions.
The method according to any one of claims 1 to 9, wherein before the obtaining of the logical expression corresponding to the tag query condition according to the tag query condition, the method further comprises:

sending a keyword set corresponding to a currently existing label to a service end, wherein the keyword set is used for the service end to generate a label query condition;

and receiving a label query condition returned by the service end.
The method of any of claims 1-10, wherein after the generating a query statement for querying tag data from the logical tree, the method further comprises:

storing the query statement;

when a query request corresponding to the query statement is acquired, reading the query statement;

and inquiring the label data from the database corresponding to the label inquiry condition according to the inquiry condition.
The method according to claim 11, wherein before the reading the query statement when the query request corresponding to the query statement is obtained, the method further comprises:

generating a statement identifier of the query statement;

sending the corresponding relation between the label query condition and the statement mark to a service end;

when the query request corresponding to the query statement is obtained, reading the query statement, including:

receiving a query request sent by the service end;

and if the query request carries the statement identification, reading the query statement.
The method according to any one of claims 1 to 12, wherein the querying, according to the query statement, tag data from a database corresponding to the tag query condition includes:

sending the query statement to a database corresponding to the label query condition;

and receiving the label data returned by the database.
The method of any of claims 1-13, wherein after said generating a logical tree from said logical expression, the method further comprises:

and storing the corresponding relation between the logic tree and the label query condition.
The method of claim 14, further comprising:

acquiring a first query condition;

if the first query condition comprises the label query condition and at least one second query condition, generating a first logic tree according to the at least one second query condition;

synthesizing the logic tree corresponding to the label query condition with the first logic tree to obtain a second logic tree;

and generating a query statement corresponding to the first query condition according to the second logic tree.
The method of claim 15, wherein before synthesizing the logical tree corresponding to the tag query with the first logical tree to obtain a second logical tree, the method further comprises:

judging whether the database corresponding to the label query condition is the same as the database corresponding to the second query condition;

and if the label query conditions are the same, synthesizing the logic tree corresponding to the label query conditions with the first logic tree to obtain a second logic tree.
The method according to claim 16, wherein after the determining whether the database corresponding to the tag query condition is the same as the database corresponding to the second query condition, the method further comprises:

and if not, generating a target query statement according to the first logic tree, wherein the target query statement is used for querying the tag data from the database corresponding to the second query condition.
A data query apparatus, characterized in that the apparatus comprises: an expression generating module, a tree generating module, a statement generating module and a label inquiring module, wherein,

the expression generation module is used for acquiring a logic expression corresponding to a label query condition according to the label query condition, wherein the logic expression comprises single-layer or multi-layer logic, and the label query condition comprises a plurality of label conditions;

the tree generating module is used for generating a logic tree according to the logic expression;

the statement generating module is used for generating query statements for querying the label data according to the logic tree;

and the label query module is used for querying the label data from the database corresponding to the label query condition according to the query statement.
A server, comprising:

one or more processors;

a memory;

one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to perform the method of any of claims 1-17.
A computer-readable storage medium, characterized in that a program code is stored in the computer-readable storage medium, which program code can be called by a processor to execute the method according to any of claims 1-17.