WO2019076050A1 - 业务报表的查询方法、装置、计算机设备及存储介质 - Google Patents

业务报表的查询方法、装置、计算机设备及存储介质 Download PDF

Info

Publication number
WO2019076050A1
WO2019076050A1 PCT/CN2018/088360 CN2018088360W WO2019076050A1 WO 2019076050 A1 WO2019076050 A1 WO 2019076050A1 CN 2018088360 W CN2018088360 W CN 2018088360W WO 2019076050 A1 WO2019076050 A1 WO 2019076050A1
Authority
WO
WIPO (PCT)
Prior art keywords
query
field
leaf node
source data
data table
Prior art date
Application number
PCT/CN2018/088360
Other languages
English (en)
French (fr)
Inventor
王开强
Original Assignee
平安科技（深圳）有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 平安科技（深圳）有限公司 filed Critical 平安科技（深圳）有限公司
Publication of WO2019076050A1 publication Critical patent/WO2019076050A1/zh

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/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2246—Trees, e.g. B+trees
    • 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/242—Query formulation
    • G06F16/2433—Query languages
    • 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

Definitions

  • the present application relates to a method, device, computer device and storage medium for querying a business report.
  • the report is different from the commonly used excel table. It is a form that can be saved in the rpt format and contains the query condition.
  • the user may enter the query condition freely, and the input format may be invalid. Therefore, in the traditional scheme, the user can only query according to the set query condition, or detect the legality of the query condition when receiving the query condition input by the user, and if not, prompt the user to re-enter the input, so that the user cannot quickly Entering the correct query conditions
  • another disadvantage of the traditional scheme is that after a user inputs the query condition and queries, when the result of the query needs to be displayed to other users, the same query condition needs to be input again, and the user is required to repeatedly input the same query.
  • the query condition on the other hand, also requires the system to perform another query step according to the input query conditions, which increases the workload of both the user and the system.
  • a method, an apparatus, a computer device, and a storage medium for querying a business report are provided.
  • a method for querying business reports including:
  • the table field tree is generated according to a field in the source data table, and the field corresponding to the selected leaf node in the table field tree is a query field;
  • the query is performed in the source data table according to the query condition.
  • a query device for a business report comprising:
  • a leaf node receiving module configured to receive a leaf node selected from a table field tree, where the table field tree is generated according to a field in the source data table, where a field corresponding to the selected leaf node in the table field tree is a query Field
  • a query condition generating module configured to generate a query condition according to the query field corresponding to the leaf node
  • the query module is configured to perform a query according to the query condition in the source data table when receiving the query instruction.
  • a computer device comprising a memory and one or more processors having stored therein computer readable instructions, the computer readable instructions being executable by the processor to cause the one or more processors to execute The following steps:
  • the table field tree is generated according to a field in the source data table, and the field corresponding to the selected leaf node in the table field tree is a query field;
  • the query is performed in the source data table according to the query condition.
  • One or more non-transitory computer readable instruction storage media storing computer readable instructions, when executed by one or more processors, cause one or more processors to perform the steps of:
  • the table field tree is generated according to a field in the source data table, and the field corresponding to the selected leaf node in the table field tree is a query field;
  • the query is performed in the source data table according to the query condition.
  • FIG. 1 is a flow diagram of a method of querying a business report in accordance with one or more embodiments.
  • FIG. 2 is a schematic flow chart of a method for querying a business report according to another or more embodiments.
  • FIG. 3 is a schematic flowchart of a method for querying a service report in still another embodiment or multiple embodiments.
  • FIG. 4 is a flow chart of a method for querying a business report in still another embodiment of the one or more embodiments.
  • FIG. 5 is a schematic diagram of an interface of a usage scenario according to one or more embodiments of the present application.
  • FIG. 6 is a block diagram of a query device for a business report in accordance with one or more embodiments.
  • FIG. 7 is a block diagram of a computer device in accordance with one or more embodiments.
  • FIG. 1 is a flowchart of a method for querying a service report according to one or more embodiments.
  • a method for querying a service report according to an embodiment of the present application is described in detail below with reference to FIG. 1. As shown in FIG. 1, the method includes The following steps S101 to S103.
  • S101 Receive a leaf node selected from a table field tree, where the table field tree is generated according to a field in a source data table, and a field corresponding to the selected leaf node in the table field tree is a query field.
  • the table field tree is generated in advance according to a field in the source data table
  • the source data table represents a raw data table that can be used as a query basis
  • the above field and the query field represent values in the source data table, such as a name, Salary, assessment scores, etc.
  • the data table stores various types of data, for example, can be the student's grades, can be employee ID, salary, and so on.
  • the source data table may be one or more, and the table field tree has a one-to-one correspondence with the source data table.
  • the number of source data tables that can be used as the query is one
  • the number of the table field tree is also one.
  • the number of table field trees is also plural.
  • the method further comprises: displaying a table field tree corresponding to the source data table, so that the user selects a leaf node in the table field tree.
  • the leaf node in the table field tree corresponds to the field in the table field tree.
  • the field corresponding to the leaf node can represent the query field.
  • the user can select the components of the query condition by selecting the leaf node in the table field tree.
  • the field corresponding to the leaf node in the table field tree may be all the fields in the source data table, or only a part of the fields in the source data table may be selected as the leaf node of the source data table, where The field selected as the leaf node represents a field that the user can select as the query condition.
  • the query condition may be directly generated according to a default setting. For example, when the query field corresponding to the leaf node is “salary”, the query condition may be determined according to a default setting. To query the salary of employees in all source data tables.
  • the determination of the query condition may also be determined by the query field in conjunction with the user input qualification condition, for example, when the query field corresponding to the leaf node is “salary”, if the user inputs “>” 10000", the query condition is determined as the salary of the employee whose query is greater than 10,000.
  • the step is only performed in one source data table, and when the query condition involves two or more source data tables, all the source data tables involved in the step are involved. In the query.
  • the query method of the service report further includes:
  • the query condition and the query result may be saved in a default path in a file in the rpt format, or may be saved as another path selected by the user.
  • the user is allowed to select a leaf node that represents the query field from the leaf nodes of the table field tree, so that the system can determine the query field according to the field corresponding to the selected leaf node, and further generate a query condition through the query field, so that the user
  • the query field of the production query condition can be selected by itself;
  • the leaf node in the table field tree is preset It can be used as a field in the source data table of the query field, so it can ensure that the query field selected by the user in the table field tree is legal, reducing the number of incorrect input, thereby improving the efficiency of the business report query.
  • FIG. 2 is a flowchart of a method for querying a service report according to another or multiple embodiments.
  • the method for querying a service report according to one or more embodiments of the present application is described in detail below with reference to FIG. 2, as shown in FIG.
  • the method further includes the following steps S201 and S202 on the basis of the steps S101 to S103 described above.
  • step S201 when there are multiple source data tables, the operation of step S201 may be performed for each source data table, wherein the fields in the obtained source data table are fields that can be used as query conditions, for example,
  • the source data table includes the employee number, the employee ID number, the employee salary, the employee assessment score, and the like. If the employee salary is an unsearchable field, since the obtained field is a leaf node that can be used as a query field, then This field is not acquired in this step S201.
  • the table is named as a root node, and the table field tree is created by using a field in the corresponding source data table as a leaf node.
  • one source data table corresponds to one table field tree, and when there are multiple source data tables, the step S202 is performed for each source data table.
  • step S101 further includes:
  • a leaf node in the selected table field tree is determined according to the input first instruction.
  • the field corresponding to the leaf node is determined as the query field.
  • the first instruction may be a mouse click command input by the user to the leaf node, or may be a mouse double click instruction input to the leaf node by the user, or may be a corresponding leaf.
  • the touch command of the node may be a mouse click command input by the user to the leaf node, or may be a mouse double click instruction input to the leaf node by the user, or may be a corresponding leaf.
  • FIG. 5 is a schematic diagram of an interface of a usage scenario according to an embodiment of the present application.
  • a table field tree may be displayed in a certain area of the interface, when the selected leaf is selected.
  • the field corresponding to the leaf node may be determined as the query field.
  • FIG. 3 is a flowchart of a method for querying a service report according to still another embodiment.
  • a method for querying a service report according to still another embodiment of the present application is described in detail below with reference to FIG. 3, as shown in FIG.
  • the method further includes the following steps S301 to S303 on the basis of the above steps S101 and S103.
  • the step S301 is specifically to obtain a query field corresponding to each leaf node received.
  • the above logical operations include, but are not limited to, "and”, “or”, “not equal to ( ⁇ )", and the like.
  • the logical operation between preset different query fields may be “and”.
  • the system selects a default logical operation when the user inputs different query fields.
  • logical operations are performed, logical operations between different query fields entered by the user are selected.
  • the query condition when the number of received leaf nodes representing the query field is one, the query condition may be generated directly according to the field or according to the qualified condition input by the user and the field, when the received query query is received. If the number of leaf nodes in a field is two or more, it needs to be processed in two cases. One is that different leaf nodes belong to the same table field tree. In this case, only the query and the A source data table corresponding to the table field tree can obtain the query result, and the other is that different leaf nodes belong to two table field trees or more than two table field trees. In this case, all the involved fields need to be queried. The source data table corresponding to the table field tree.
  • FIG. 4 is a flowchart of a method for querying a service report according to still another embodiment of the present invention.
  • a method for querying a service report according to still another embodiment of the present application is described in detail below with reference to FIG. 4, as shown in FIG.
  • the method further includes the following steps S401 and S402 on the basis of the above steps S101 and S103.
  • a field indicating the name of the employee in the source data table and a field indicating the employee's assessment score are acquired.
  • the second instruction described above may be a programming instruction input by a programmer through an input device such as a mouse and keyboard to configure an attribute in a field.
  • the attribute of the field includes, but is not limited to, whether the field can be hidden when being queried, and the type displayed when the field is selected is a data frame, a selection box or a radio button, and whether the field can be queried when being queried.
  • the data frame above indicates that the user can input the value of the field in the form of a text box, such as the name of the employee.
  • the above selection box indicates that the user can select among several options corresponding to the setting, such as the gender of the employee.
  • the radio box indicates that the corresponding field is only allowed to enter a specific value, and the maximum and minimum values are applicable to fields that store numeric types, such as employee performance scores.
  • the above step S102 further includes the following steps 1 to 4.
  • the field represented by the leaf node is parsed.
  • the parsed field corresponding to the leaf node may be displayed in the conditional query. In the area.
  • the input query value of the query field is received, and the query value corresponds to an attribute configured by the query field.
  • the query value of the query field when the query field is the employee's name, the query value of the query field may be “Zhang San”. When the query field is the age of the employee, the query value of the query field may be “45”. ", when the query field is the employee's salary, the query value can be ">10000”.
  • generating the query condition according to the query field and the query value may depend on an attribute configured for the corresponding query field, for example, when the attribute configured for the employee salary field is “invisible”, The corresponding field is not used as one of the query conditions.
  • the query field input by the user and the corresponding query value are “employee name: Zhang San”, “employee age: 45”, and “employee salary: >10000”, If the attribute of the employee's salary field is not visible, only the results of the query "employee's name: Zhang San” and "employee's age: 45" are displayed.
  • FIG. 5 is a schematic diagram of an interface of a usage scenario according to one or more embodiments of the present application.
  • a usage scenario according to the present application is described in detail below with reference to FIG. 5.
  • the area of the table field tree in FIG. 5 displays one or more table fields. a tree, wherein each table field tree corresponds to a source data table, the root node in the table field tree represents a table name corresponding to the source data table, and the leaf node of the table field tree represents a field in the corresponding source data table, such as source data
  • the name of the table is, for example, subsidiary A, subsidiary B, etc., and subsidiary A corresponds to the leaf node of the table field tree, such as the employee's name, age, salary, etc., and the leaf node of the subsidiary B corresponding to the table field tree may also be the employee's Name, age, salary, etc.
  • the query field corresponding to the dragged leaf node is parsed and displayed in the conditional query area.
  • the system can automatically generate according to the default setting.
  • the query condition can also be combined with the value of the query field input by the user to generate a corresponding query condition.
  • the system can query the salary of all employees in the subsidiary A by default, if the user inputs "in the condition query area" >10000", the system confirms the query condition is to query the salary of the employee whose salary is greater than 10,000 in subsidiary A, but only if the attribute of the salary field is not configured to be invisible.
  • the system When the user clicks the query button in FIG. 5, the system performs a query according to the generated query condition and displays the result of the query in the report data area.
  • the generated query condition and the corresponding query result may be saved in the default path or the path specified by the user in the rpt format file.
  • the query condition and the corresponding query result need to be displayed to others, the corresponding rpt file can be directly opened, and the query condition does not need to be input again, and the system does not need to perform the query step again.
  • the labels of the foregoing steps S101 to S402 are not used to limit the sequence of the steps in the embodiment, and the number of each step is only for the convenience of referring to the labels of the steps when describing the steps.
  • the above step S402 may be performed before the step of S101, or after the step of step S101, as long as the order of execution of the respective steps does not affect the logical relationship of the embodiment, which is within the scope of the claimed application.
  • FIG. 6 is a block diagram showing an exemplary structure of a query device for a service report according to one or more embodiments of the present application.
  • FIG. 6 is a detailed description of a query device for a service report according to one or more embodiments of the present application, such as As shown in FIG. 6, the query device 10 of the service report includes:
  • the leaf node receiving module 11 is configured to receive a leaf node selected from a table field tree, where the table field tree is generated according to a field in the source data table, and the field corresponding to the selected leaf node in the table field tree is Query field
  • the query condition generating module 12 is configured to generate a query condition according to the query field corresponding to the leaf node;
  • the query module 13 is configured to perform a query according to the query condition in the source data table when receiving the query instruction.
  • the leaf node in the table field tree corresponds to the field in the table field tree.
  • the field corresponding to the leaf node can represent the query field, and the user can select the table.
  • the leaf nodes in the field tree select the components of the query condition.
  • the query device 10 of the service report further includes:
  • Display module used to display the table field tree corresponding to the source data table. So that the user can select the leaf node in the table field tree.
  • the field corresponding to the leaf node in the table field tree may be all the fields in the source data table, or only a part of the fields in the source data table may be selected as the leaf node of the source data table, where The field selected as the leaf node represents a field that the user can select as the query condition.
  • the query module when the query condition refers to only one source data table, the query module is used to query only in one source data table, and when the query condition involves two or more source data tables, the query module is specifically used for Query in all source data tables involved.
  • the query device 10 of the service report further includes:
  • a field obtaining module configured to obtain a table name of the source data table and a field in the source data table
  • a table field tree creation module is configured to create a table field tree for a leaf node by using a field named as a root node in the corresponding data table.
  • the field obtaining module is configured to obtain, in each source data table, a table name of the source data table and a field in the source data table, where the obtained source data table is
  • the field is a field that can be used as a query condition.
  • the source data table includes the employee ID number, the employee ID number, the employee salary, the employee assessment score, and the like. If the employee salary is an unsearchable field, the obtained field is Can be used as the leaf node of the query field, then the field get module can not get the field.
  • a source data table corresponds to a table field tree.
  • the table field tree creation module is specifically configured to use the table name as a root node for each source data table. Create the table field tree with the fields in the corresponding source data table as leaf nodes.
  • the leaf node receiving module 11 further includes:
  • a leaf node determining unit configured to determine, according to the input first instruction, a leaf node in the selected table field tree
  • the query field determining unit is configured to determine, when the determined leaf node is dragged to the preset area, the field corresponding to the leaf node as the query field.
  • the first instruction may be a mouse click command input by the user to the leaf node, or may be a mouse double click instruction input to the leaf node by the user, or may be a corresponding leaf.
  • the touch command of the node may be a mouse click command input by the user to the leaf node, or may be a mouse double click instruction input to the leaf node by the user, or may be a corresponding leaf.
  • FIG. 5 is a schematic diagram of an interface of a usage scenario according to one or more embodiments of the present application.
  • a table field tree may be displayed in a certain area of the interface, and when the selected leaf node is dragged to the conditional query area, the The query field determining unit may determine the field corresponding to the leaf node as the query field.
  • the query condition generating module 12 further includes:
  • a query field obtaining unit configured to acquire a query field corresponding to the leaf node when the number of the leaf nodes that represent the query field is two or more;
  • a logical operation obtaining unit configured to receive a logical operation between input different query fields or obtain a logical operation between preset different query fields
  • the first query condition generating unit is configured to generate the query condition according to the logical operation between the query field and different query fields.
  • the above logical operations include, but are not limited to, "and”, “or”, “not equal to ( ⁇ )", and the like.
  • the logical operation between the preset different query fields may be “and”.
  • the logical operation obtaining unit selects a default logical operation when the user inputs differently.
  • the logical operation fetch unit selects logical operations between different query fields entered by the user.
  • the first query condition generating unit may directly generate a query according to the field or according to the qualified condition input by the user and the field.
  • the condition that when the number of the leaf nodes indicating the query field received is two or more, the first query condition generating unit needs to be processed in two cases, one is that different leaf nodes belong to the same
  • a table field tree in this case, only one source data table corresponding to the table field tree needs to be queried to obtain a query result, and the other is that different leaf nodes belong to two table field trees or more than two tables.
  • the query device 10 of the service report further includes:
  • a field obtaining module configured to obtain a field in the source data table
  • the field attribute configuration module is configured to configure the acquired attribute of the field according to the input second instruction.
  • the field obtaining module may obtain a field indicating the employee's name in the source data table and a field indicating the employee's assessment score.
  • the second instruction described above may be a programming instruction input by a programmer through an input device such as a mouse keyboard to configure an attribute in a field.
  • the data frame above indicates that the user can input the value of the field in the form of a text box, such as the name of the employee.
  • the above selection box indicates that the user can select among several options corresponding to the setting, such as the gender of the employee.
  • the radio box indicates that the corresponding field is only allowed to enter a specific value, and the maximum and minimum values are applicable to fields that store numeric types, such as employee performance scores.
  • the query condition generating module 12 further includes:
  • a parsing unit configured to parse the query field corresponding to the leaf node
  • a display unit configured to display the parsed query field
  • a query value receiving unit configured to receive the input query value of the query field, where the query value corresponds to an attribute configured by the query field;
  • the second query condition generating unit is configured to generate the query condition according to the query field and the query value.
  • the display unit may display the parsed field corresponding to the leaf node in the condition query area. in.
  • the second query condition generating unit generates, according to the query field and the query value, the query condition may depend on an attribute configured for the corresponding query field, for example, an attribute configured for the employee salary field. When it is "invisible", the corresponding field is not used as one of the query conditions.
  • the display unit only displays the query result of "employee's name: Zhang San” and "employee's age: 45".
  • the query device 10 of the service report further includes:
  • the saving module is configured to save the query condition and the result of the query according to the query condition in the source data table at the same time when receiving the save instruction.
  • the saving module is specifically configured to save the query condition and the query result in a default path in a file in the rpt format, or save the file as another path selected by the user.
  • first and second in the first query condition generating unit and the second query condition generating unit are only to distinguish the two query condition generating units, and are not used to define which query condition generating unit is used. Higher priority or other limited meaning.
  • each module included in the query device of the service report may be implemented in whole or in part by software, hardware or a combination thereof. Further, each module in the query device of the service report may be a program segment for implementing a corresponding function.
  • the query device of the above business report can be implemented in the form of a computer program that can be run on a computer device as shown in FIG.
  • Each module in the query device of the above business report may be implemented in whole or in part by software, hardware, and combinations thereof.
  • Each of the above modules may be embedded in or independent of the processor in the computer device, or may be stored in a memory in the computer device in a software form, so that the processor invokes the operations corresponding to the above modules.
  • a computer device which may be a server, and its internal structure diagram may be as shown in FIG.
  • the computer device includes a processor, memory, network interface, and database connected by a system bus.
  • the processor of the computer device is used to provide computing and control capabilities.
  • the memory of the computer device includes a non-volatile storage medium, an internal memory.
  • the non-volatile storage medium stores an operating system, computer readable instructions, and a database.
  • the internal memory provides an environment for operation of an operating system and computer readable instructions in a non-volatile storage medium.
  • the database of the computer device is used to store query data of the business report.
  • the network interface of the computer device is used to communicate with an external terminal via a network connection.
  • the computer readable instructions are executed by the processor to implement a query method for the business report.
  • FIG. 7 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation of the computer device to which the solution of the present application is applied.
  • the specific computer device may It includes more or fewer components than those shown in the figures, or some components are combined, or have different component arrangements.
  • a computer device comprising a memory and one or more processors having stored therein computer readable instructions, the computer readable instructions being executed by the processor such that the one or more processors perform the step of: receiving a slave field tree
  • the selected leaf node is generated according to a field in the source data table, and the field corresponding to the selected leaf node in the table field tree is a query field.
  • a query condition is generated according to the query field corresponding to the leaf node. When the query instruction is received, the query is performed in the source data table according to the query condition.
  • the implementing further comprises: obtaining a table name of the source data table and a field in the source data table.
  • the table is named as the root node, and the table field tree is created by using the field in the corresponding source data table as a leaf node.
  • the step of implementing the receiving the leaf node selected from the table field tree when the processor executes the computer readable instructions comprises: determining the leaf node in the selected table field tree according to the input first instruction . When it is detected that the determined leaf node is dragged to the preset area, the field corresponding to the leaf node is determined as the query field.
  • the step of generating the query condition according to the query field corresponding to the leaf node when the processor executes the computer readable instruction comprises: when the number of the leaf nodes representing the query field received is two or more Get the query field corresponding to the leaf node. Receive logical operations between different query fields of input or obtain logical operations between preset different query fields. The query condition is generated according to the logical operation between the query field and different query fields.
  • the processor when executing the computer readable instructions, further implements the step of obtaining fields in the source data table.
  • the acquired attribute of the field is configured according to the input second instruction.
  • the step of the processor executing the computer readable instructions to generate the query condition according to the query field corresponding to the leaf node comprises: parsing the query field corresponding to the leaf node. Shows the parsed query field. The input query value of the query field is received, and the query value corresponds to the attribute configured by the query field. The query condition is generated according to the query field and the query value.
  • the processor executes the computer readable instructions
  • the following steps are further implemented: when the save instruction is received, the query condition and the result of the query according to the query condition in the source data table are simultaneously saved.
  • One or more non-transitory computer readable instruction storage media storing computer readable instructions, when executed by one or more processors, cause one or more processors to perform the steps of: receiving a slave table A selected leaf node in the field tree, the table field tree is generated according to a field in the source data table, and the field corresponding to the selected leaf node in the table field tree is a query field.
  • a query condition is generated according to the query field corresponding to the leaf node. When the query instruction is received, the query is performed in the source data table according to the query condition.
  • the method when the computer readable instructions are executed by the processor, the method further comprises: obtaining a table name of the source data table and a field in the source data table.
  • the table is named as the root node, and the table field tree is created by using the field in the corresponding source data table as a leaf node.
  • the step of implementing the receiving of the selected leaf node from the table field tree when the computer readable instructions are executed by the processor comprises: determining the selected leaf in the table field tree based on the input first instruction node. When it is detected that the determined leaf node is dragged to the preset area, the field corresponding to the leaf node is determined as the query field.
  • the step of generating the query condition according to the query field corresponding to the leaf node when the computer readable instructions are executed by the processor comprises: when the received number of leaf nodes representing the query field is two or more The query field corresponding to the leaf node is obtained. Receive logical operations between different query fields of input or obtain logical operations between preset different query fields. The query condition is generated based on the logical operation between the query field and different query fields.
  • the computer readable instructions when executed by the processor, also implement the step of obtaining fields in the source data table.
  • the acquired attribute of the field is configured according to the input second instruction.
  • the step of generating the query condition according to the query field corresponding to the leaf node when the computer readable instructions are executed by the processor comprises: parsing the query field corresponding to the leaf node. Shows the parsed query field. The input query value of the query field is received, and the query value corresponds to the attribute configured by the query field. The query condition is generated according to the query field and the query value.
  • the following steps are further implemented: when the save instruction is received, the query condition and the result of the query according to the query condition in the source data table are simultaneously saved.
  • the user is allowed to select a leaf node that represents the query field from the leaf nodes of the table field tree, so that the system can determine the query field according to the field corresponding to the selected leaf node, and further generate a query condition through the query field, so that the user
  • the query field of the production query condition can be selected by itself; on the other hand, since the query field exists in the form of a leaf node in the table field tree, and the leaf node in the table field tree is preset It can be used as a field in the source data table of the query field, so it can ensure that the query field selected by the user in the table field tree is legal, reducing the number of incorrect input, thereby improving the efficiency of the business report query.
  • Non-volatile memory can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory.
  • Volatile memory can include random access memory (RAM) or external cache memory.
  • RAM is available in a variety of formats, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronization chain.
  • SRAM static RAM
  • DRAM dynamic RAM
  • SDRAM synchronous DRAM
  • DDRSDRAM double data rate SDRAM
  • ESDRAM enhanced SDRAM
  • Synchlink DRAM SLDRAM
  • Memory Bus Radbus
  • RDRAM Direct RAM
  • DRAM Direct Memory Bus Dynamic RAM
  • RDRAM Memory Bus Dynamic RAM

Abstract

一种业务报表的查询方法，包括：接收从表字段树中被选择的叶子节点，该表字段树是根据源数据表中的字段生成的，该表字段树中被选择的叶子节点所对应的字段为查询字段；根据该叶子节点所对应的查询字段生成查询条件；接收到查询指令时，在该源数据表中依据该查询条件进行查询。

Description

业务报表的查询方法、装置、计算机设备及存储介质
相关申请的交叉引用
本申请要求于2017年10月17日提交中国专利局，申请号为2017109621805，申请名称为“业务报表的查询方法、装置、计算机设备及存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及一种业务报表的查询方法、装置、计算机设备及存储介质。
背景技术
报表区别于通常使用的excel表，是一种可以保存为rpt格式的包含有查询条件的表单，目前对于报表的查询，由于考虑到用户自由输入查询条件时可能会由于输入的格式不合法导致出错，所以在传统方案中用户只能根据设定的查询条件进行查询，或者在接收到用户输入的查询条件时检测该查询条件的合法性，若不合法则提示用户重新进行输入，使得用户无法快速的输入正确的查询条件，传统方案另外一个弊端是在一个用户输入了查询条件进行查询之后，当需要向其他用户展示查询的结果时，需要再次输入相同的查询条件，一方面要求用户重复输入相同的查询条件，另一方面还要求系统根据输入的查询条件再执行一次查询步骤，增加了用户和系统双方的工作量。
发明内容
根据本申请公开的各种实施例，提供一种业务报表的查询方法、装置、计算机设备及存储介质。
一种业务报表的查询方法，包括：
接收从表字段树中被选择的叶子节点，该表字段树是根据源数据表中的字段生成的，该表字段树中被选择的叶子节点所对应的字段为查询字段；
根据该叶子节点所对应的查询字段生成查询条件；及
接收到查询指令时，在该源数据表中依据该查询条件进行查询。
一种业务报表的查询装置，包括：
叶子节点接收模块，用于接收从表字段树中被选择的叶子节点，该表字段树是根据源数据表中的字段生成的，该表字段树中被选择的叶子节点所对应的字段为查询字段；
查询条件生成模块，用于根据该叶子节点所对应的查询字段生成查询条件；及
查询模块，用于接收到查询指令时，在该源数据表中依据该查询条件进行查询。
一种计算机设备，包括存储器和一个或多个处理器，所述存储器中储存有计算机可读指令，所述计算机可读指令被所述处理器执行时，使得所述一个或多个处理器执行以下步骤：
接收从表字段树中被选择的叶子节点，该表字段树是根据源数据表中的字段生成的，该表字段树中被选择的叶子节点所对应的字段为查询字段；
根据该叶子节点所对应的查询字段生成查询条件；及
接收到查询指令时，在该源数据表中依据该查询条件进行查询。
一个或多个存储有计算机可读指令的非易失性计算机可读指令存储介质，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器执行以下步骤：
接收从表字段树中被选择的叶子节点，该表字段树是根据源数据表中的字段生成的，该表字段树中被选择的叶子节点所对应的字段为查询字段；
根据该叶子节点所对应的查询字段生成查询条件；及
接收到查询指令时，在该源数据表中依据该查询条件进行查询。
本申请的一个或多个实施例的细节在下面的附图和描述中提出。本申请的其它特征和优点将从说明书、附图以及权利要求书变得明显。
附图说明
为了更清楚地说明本申请实施例中的技术方案，下面将对实施例中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其它的附图。
图1为根据一个或多个实施例中业务报表的查询方法的流程图。
图2为根据另一个或多个实施例中业务报表的查询方法的流程示意图。
图3为又一个或多个实施例中业务报表的查询方法的流程示意图。
图4为再一个或多个实施例中再一实施例的业务报表的查询方法的流程图。
图5为根据本申请的一个或多个实施例的使用场景的界面示意图。
图6为根据一个或多个实施例中业务报表的查询装置的框图。
图7为根据一个或多个实施例中计算机设备的框图。
具体实施方式
为了使本申请的技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅仅用以解释本申请，并不用于限定本申请。
图1为根据一个或多个实施例的业务报表的查询方法的流程图，下面结合图1来详细描述根据本申请的一个实施例的业务报表的查询方法，如图1所示，该方法包括以下步骤S101至S103。
S101、接收从表字段树中被选择的叶子节点，该表字段树是根据源数据表中的字段生成的，该表字段树中被选择的叶子节点所对应的字段为查询字段。
其中，表字段树为预先是根据源数据表中的字段生成的，源数据表表示可以作为查询依据的原始数据表，而上述的字段及查询字段表示该源数据表中的值，例如姓名、工资、考核成绩等等，数据表中存储了各类数据，例如，可以是学生的成绩，可以是员工工号、工资等等。其中源数据表可以是一个也可以是多个，表字段树与源数据表一一对应，当可以作为查询依据的源数据表的个数为一个时，该表字段树的个数也是一个，当源数据表的个数为多个时，表字段树的个数也为多个。
根据本实施例的一个示例，该方法还包括：将与源数据表相对应的表字段树显示，以便于用户选择该表字段树中的叶子节点。
根据本实施例的一个示例，该表字段树中的叶子节点与表字段树中的字段相对应，当其中一个或几个叶子节点被选中时，该叶子节点所对应的字段即可表示查询字段，用户可以通过选择表字段树中的叶子节点选择查询条件的组成部分。
根据本实施例的一个示例，该表字段树中的叶子节点所对应的字段可以是源数据表中的所有字段，也可只挑选源数据表中的一部分字段作为源数据表的叶子节点，其中，挑选出来作为叶子节点的字段表示可供用户选择作为查询条件的字段。
S102、根据该叶子节点所对应的查询字段生成查询条件。
根据本实施例的一个示例，当查询字段确定之后，该查询条件可以根据默认的设定 直接生成，例如，当该叶子节点所对应的查询字段为“工资”，可以根据默认设置将查询条件确定为查询所有源数据表中员工的工资。
根据本实施例的另一个示例，该查询条件的确定还可以通过该查询字段联合用户输入限定条件来确定，例如，当该叶子节点所对应的查询字段为“工资”时，若用户输入“>10000”，则将查询条件确定为查询大于一万的员工的工资。
S103、接收到查询指令时，在该源数据表中依据该查询条件进行查询。
其中，当上述的查询条件只涉及一个源数据表时，该步骤只在一个源数据表中进行查询，当查询条件涉及两个甚至多个源数据表时，该步骤在涉及的所有源数据表中进行查询。
在一些实施例中，该业务报表的查询方法还包括：
接收到保存指令时，将该查询条件及在该源数据表中依据该查询条件查询的结果同时保存。
根据本实施例的一个示例，可以将该查询条件以及查询结果以rpt格式的文件保存在默认的路径下，也可以另存为用户选择的其它路径下。
本实施例通过允许用户从表字段树的叶子节点中选取表示查询字段的叶子节点，使得系统可以根据被选取的叶子节点所对应的字段确定查询字段，进一步通过该查询字段生成查询条件，使得用户在查询条件的选择上一方面可以自行选择生产查询条件的查询字段，另一方面，由于该查询字段以叶子节点的形式存在表字段树中，且该表字段树中的叶子节点为预先设定的可以作为查询字段的源数据表中的字段，因此可以保证用户在该表字段树中选择的查询字段是合法的，减少误输入的次数，从而提高业务报表查询的效率。
图2为根据另一个或多个实施例的业务报表的查询方法的流程图，下面结合图2来详细描述根据本申请的一个或多个实施例的业务报表的查询方法，如图2所示，该方法在包括上述步骤S101至S103的基础上还包括以下步骤S201及S202。
S201、获取该源数据表的表名及该源数据表中的字段。
根据本实施例的一个示例，当源数据表有多个时，可以对每个源数据表都执行步骤S201的操作，其中，获取的源数据表中的字段为可以作为查询条件的字段，例如该源数据表中包括员工工号、员工身份证号、员工工资、员工考核成绩等等这些字段，如果员工工资为不可查的字段，由于获取的字段为可以作为查询字段的叶子节点，则在该步骤S201中不获取该字段。
S202、以该表名为根节点，以对应源数据表中的字段为叶子节点创建该表字段树。
根据本实施例的一个示例，一个源数据表对应一个表字段树，当源数据表有多个时，对每个源数据表都执行该步骤S202。
根据本实施例的一个示例，上述步骤S101还包括：
根据输入的第一指令，确定被选中的该表字段树中的叶子节点。
当检测到确定的该叶子节点被拖动至预设的区域时，将该的叶子节点所对应的字段确定为该查询字段。
根据本实施例的一个示例，上述的第一指令可以是用户输入的对该叶子节点的鼠标单击指令，也可以是用户输入的对该叶子节点的鼠标双击指令，还可以是对对应的叶子节点的触控指令。
图5为根据本申请的一个实施例的使用场景的界面示意图，根据本实施例的一个使用场景如图5所示，可以将表字段树显示在界面的某一个区域内，当被选中的叶子节点被拖动至条件查询区域时，则可将该的叶子节点所对应的字段确定为该查询字段。
图3为根据又一个或多个实施例的业务报表的查询方法的流程图，下面结合图3来详细描述根据本申请的又一实施例的业务报表的查询方法，如图3所示，该方法在包括上述步骤S101及S103的基础上，上述步骤S102还包括以下步骤S301至S303。
S301、当接收的该表示查询字段的叶子节点的个数为两个以上时，获取该叶子节点对应的查询字段。
其中，该步骤S301具体为获取接收的每个叶子节点对应的查询字段。
S302、接收输入的不同查询字段之间的逻辑操作或获取预设的不同查询字段之间的逻辑操作。
根据本实施例的一个示例，上述的逻辑操作包括但不限于“及(and)”、“或(or)”、“不等于(≠)”等等。其中，预设的不同查询字段之间的逻辑操作可以是“及(and)”，当用户不输入不同查询字段之间的逻辑操作时，系统选用默认的逻辑操作，当用户输入不同的查询字段之间的逻辑操作时，选用用户输入的不同查询字段之间的逻辑操作。
S303、根据该查询字段及不同查询字段之间的逻辑操作生成该查询条件。
根据本实施例的一个示例，当上述接收的表示查询字段的叶子节点的个数是一个时，可直接依据该字段或依据用户输入的限定条件及该字段生成查询条件，当上述接收的表示查询字段的叶子节点的个数是两个或两个以上时，则需要分两种情况进行处理，一种是不 同的叶子节点均属于同一表字段树的情况，这种情况下只需要查询与该表字段树对应的一个源数据表即可得到查询结果，另一种是不同的叶子节点属于两个表字段树或两个以上的表字段树的情况，这种情况下则需要查询涉及的所有表字段树对应的源数据表。
图4为根据的再一个或多个实施例的业务报表的查询方法的流程图，下面结合图4来详细描述根据本申请的再一实施例的业务报表的查询方法，如图4所示，该方法在包括上述步骤S101及S103的基础上，还包括以下步骤S401及S402。
S401、获取该源数据表中的字段。
根据本实施例的一个示例，例如获取源数据表中表示员工姓名的字段及表示员工考核成绩的字段。
S402、根据输入的第二指令，对获取的该字段的属性进行配置。
根据本实施例的一个示例，上述的第二指令可以是程序员通过鼠标键盘等输入装置输入的编程指令，以对字段中的属性进行配置。
其中，该字段的属性包括但不限于：该字段在被查询时是否可以隐藏，该字段在被选择时显示的类型为数据框、选择框还是单选框，该字段在被查询时是否可以以模糊查询的方式进行查询，不同源数据表中表示属性的字段之间是否有关联性，以及为该字段配置＝、≥、>、≠、≤、<、最大值、最小值、or、and等查询逻辑。
其中，上述的数据框表示用户可以通过文本框的形式对该字段的值进行输入，例如员工的姓名，上述的选择框表示用户可以在对应设置的几个选项中进行选择，例如员工的性别，单选框则表示对应的字段只允许输入特定的值，最大值和最小值适用于存储数值类型的字段，例如员工的考核成绩。
在一些实施例中，上述步骤S102还包括以下步骤1至步骤4。
1、解析该叶子节点所对应的查询字段。
根据本实施例的一个使用场景例如，当用户选择的三个叶子节点分别表示员工的姓名、年龄及工资时，解析该叶子节点所表示的字段。
2、显示解析的该查询字段。
根据本实施例的一个使用场景参考图5，当叶子节点通过单击、双击、触控的方式或通过拖动至查询条件选择区域时，可以将解析的该叶子节点对应的字段显示在条件查询区域中。
3、接收输入的该查询字段的查询值，所述查询值与所述查询字段配置的属性相对应。
根据本实施例的一个使用场景，当查询字段为员工的姓名时，该查询字段的查询值可以是“张三”，当查询字段为员工的年龄时，该查询字段的查询值可以是“45”，当查询字段为员工的工资时，该查询值可以是“>10000”，
4、根据该查询字段及该查询值生成该查询条件。
根据本实施例的一个示例，根据该查询字段及该查询值生成该查询条件可以依赖为对应的查询字段配置的属性，例如当为员工工资这一字段配置的属性是“不可见”时，则不将对应的字段作为查询条件之一。
根据本实施例的一个使用场景例如，当用户输入的查询字段及对应的查询值分别为“员工的姓名：张三”and“员工的年龄：45”and“员工的工资：>10000”时，若员工的工资这一字段的属性为不可见，则仅显示“员工的姓名：张三”and“员工的年龄：45”的查询结果。
图5为根据本申请的一个或多个实施例的使用场景的界面示意图，下面结合图5来详细描述根据本申请的一个使用场景，图5中表字段树的区域显示一个或者多个表字段树，其中每个表字段树对应一个源数据表，该表字段树中的根节点表示对应源数据表的表名，该表字段树的叶子节点表示对应源数据表中的字段，例如源数据表名例如：子公司A、子公司B等等，子公司A对应表字段树的叶子节点例如员工的姓名、年龄、工资等等，子公司B对应表字段树的叶子节点也可以是员工的姓名、年龄、工资等等。
当表字段树中有叶子节点被拖动至“条件查询区域”时，则将被拖动的叶子节点对应的查询字段解析并显示在条件查询区域，此时，系统可以根据默认的设置自动生成查询条件，也可以结合用户输入的查询字段的值来生成对应的查询条件。例如当用户将子公司A中的表字段树中表示“工资”的叶子节点拖动至条件查询区域时，系统可以默认查询子公司A中所有员工的工资，如果用户在条件查询区域内输入“>10000”，则系统确认的查询条件是查询子公司A中工资大于一万的员工的工资，但前提是未对工资这一字段的属性配置为不可见。
当用户点击图5中的查询按钮时，系统则根据上述生成的查询条件进行查询，并将查询的结果显示在报表数据区域。
当用户点击图5中的保存按钮时，可以将上述生成的查询条件及对应的查询结果以rpt格式的文件同时保存在默认的路径或是用户指定的路径下。使得当需要将该查询条件及对应的查询结果展示给他人看时，直接打开对应的rpt文件即可，不需要再次输入查询条件，也不需要系统再次执行查询步骤。
根据本实施例的一个示例，上述步骤S101～S402的标号并不用于限定本实施例中各个步骤的先后顺序，各个步骤的编号只是为了使得描述各个步骤时可以通用引用该步骤的标号进行便捷的指代，例如上述步骤S402可以在S101的步骤之前，也可以在步骤S101的步骤之后，只要各个步骤执行的顺序不影响本实施例的逻辑关系即表示在本申请请求保护的范围之内。
应该理解的是，虽然图1-4的流程图中的各个步骤按照箭头的指示依次显示，但是这些步骤并不是必然按照箭头指示的顺序依次执行。除非本文中有明确的说明，这些步骤的执行并没有严格的顺序限制，这些步骤可以以其它的顺序执行。而且，图1-4中的至少一部分步骤可以包括多个子步骤或者多个阶段，这些子步骤或者阶段并不必然是在同一时刻执行完成，而是可以在不同的时刻执行，这些子步骤或者阶段的执行顺序也不必然是依次进行，而是可以与其它步骤或者其它步骤的子步骤或者阶段的至少一部分轮流或者交替地执行。
图6为根据本申请的一个或多个实施例的业务报表的查询装置的示范性结构框图，下面结合图6来详细描述根据本申请的一个或多个实施例的业务报表的查询装置，如图6所示，该业务报表的查询装置10包括：
叶子节点接收模块11，用于接收从表字段树中被选择的叶子节点，该表字段树是根据源数据表中的字段生成的，该表字段树中被选择的叶子节点所对应的字段为查询字段；
查询条件生成模块12，用于根据该叶子节点所对应的查询字段生成查询条件；
查询模块13，用于接收到查询指令时，在该源数据表中依据该查询条件进行查询。
其中，该表字段树中的叶子节点与表字段树中的字段相对应，当其中一个或几个叶子节点被选中时，该叶子节点所对应的字段即可表示查询字段，用户可以通过选择表字段树中的叶子节点选择查询条件的组成部分。
在一些实施例中，该业务报表的查询装置10还包括：
显示模块：用于将与源数据表相对应的表字段树显示。以便于用户选择该表字段树中的叶子节点。
根据本实施例的一个示例，该表字段树中的叶子节点所对应的字段可以是源数据表中的所有字段，也可只挑选源数据表中的一部分字段作为源数据表的叶子节点，其中，挑选出来作为叶子节点的字段表示可供用户选择作为查询条件的字段。
其中，当上述的查询条件只涉及一个源数据表时，该查询模块用于只在一个源数据 表中进行查询，当查询条件涉及两个甚至多个源数据表时，该查询模块具体用于在涉及的所有源数据表中进行查询。
在一些实施例中，该业务报表的查询装置10还包括：
字段获取模块，用于获取该源数据表的表名及该源数据表中的字段；
表字段树创建模块，用于以该表名为根节点，以对应源数据表中的字段为叶子节点创建该表字段树。
其中，当源数据表有多个时，字段获取模块用于在每个源数据表中都获取该源数据表的表名及该源数据表中的字段，其中，获取的源数据表中的字段为可以作为查询条件的字段，例如该源数据表中包括员工工号、员工身份证号、员工工资、员工考核成绩等等这些字段，如果员工工资为不可查的字段，由于获取的字段为可以作为查询字段的叶子节点，则该字段获取模块不可获取该字段。
根据本实施例的一个示例，一个源数据表对应一个表字段树，当源数据表有多个时，该表字段树创建模块具体用于对每个源数据表都以该表名为根节点，以对应源数据表中的字段为叶子节点创建该表字段树。
在一些实施例中，上述叶子节点接收模块11还包括：
叶子节点确定单元，用于根据输入的第一指令，确定被选中的该表字段树中的叶子节点；
查询字段确定单元，用于当检测到确定的该叶子节点被拖动至预设的区域时，将该的叶子节点所对应的字段确定为该查询字段。
根据本实施例的一个示例，上述的第一指令可以是用户输入的对该叶子节点的鼠标单击指令，也可以是用户输入的对该叶子节点的鼠标双击指令，还可以是对对应的叶子节点的触控指令。
图5为根据本申请的一个或多个实施例的使用场景的界面示意图，可以将表字段树显示在界面的某一个区域内，当被选中的叶子节点被拖动至条件查询区域时，该查询字段确定单元则可将该的叶子节点所对应的字段确定为该查询字段。
在一些实施例中，上述查询条件生成模块12还包括：
查询字段获取单元，用于当接收的该表示查询字段的叶子节点的个数为两个以上时，获取该叶子节点对应的查询字段；
逻辑操作获取单元，用于接收输入的不同查询字段之间的逻辑操作或获取预设的不 同查询字段之间的逻辑操作；
第一查询条件生成单元，用于根据该查询字段及不同查询字段之间的逻辑操作生成该查询条件。
根据本实施例的一个示例，上述的逻辑操作包括但不限于“及(and)”、“或(or)”、“不等于(≠)”等等。其中，预设的不同查询字段之间的逻辑操作可以是“及(and)”，当用户不输入不同查询字段之间的逻辑操作时，逻辑操作获取单元选用默认的逻辑操作，当用户输入不同的查询字段之间的逻辑操作时，该逻辑操作获取单元选用用户输入的不同查询字段之间的逻辑操作。
根据本实施例的另一示例，当上述接收的表示查询字段的叶子节点的个数是一个时，该第一查询条件生成单元可直接依据该字段或依据用户输入的限定条件及该字段生成查询条件，当上述接收的表示查询字段的叶子节点的个数是两个或两个以上时，该第一查询条件生成单元则需要分两种情况进行处理，一种是不同的叶子节点均属于同一表字段树的情况，这种情况下只需要查询与该表字段树对应的一个源数据表即可得到查询结果，另一种是不同的叶子节点属于两个表字段树或两个以上的表字段树的情况，这种情况下则需要查询涉及的所有表字段树对应的源数据表。
在其中的一个实施例中，该业务报表的查询装置10还包括：
字段获取模块，用于获取该源数据表中的字段；
字段属性配置模块，用于根据输入的第二指令，对获取的该字段的属性进行配置。
根据本实施例的一个示例，该字段获取模块可以获取源数据表中表示员工姓名的字段及表示员工考核成绩的字段。
根据本实施例的另一示例，上述的第二指令可以是程序员通过鼠标键盘等输入装置输入的编程指令，以对字段中的属性进行配置。
其中，该字段属性配置模块具体可以用于配置：该字段在被查询时是否可以隐藏，该字段在被选择时显示的类型为数据框、选择框还是单选框，该字段在被查询时是否可以以模糊查询的方式进行查询，不同源数据表中表示属性的字段之间是否有关联性，以及为该字段配置＝、≥、>、≠、≤、<、最大值、最小值、or、and等查询逻辑。
其中，上述的数据框表示用户可以通过文本框的形式对该字段的值进行输入，例如员工的姓名，上述的选择框表示用户可以在对应设置的几个选项中进行选择，例如员工的性别，单选框则表示对应的字段只允许输入特定的值，最大值和最小值适用于存储数值类 型的字段，例如员工的考核成绩。
在一些实施例中，该查询条件生成模块12还包括：
解析单元，用于解析该叶子节点所对应的查询字段；
显示单元，用于显示解析的该查询字段；
查询值接收单元，用于接收输入的该查询字段的查询值，所述查询值与所述查询字段配置的属性相对应；
第二查询条件生成单元，用于根据该查询字段及该查询值生成该查询条件。
根据本实施例的一个示例，当叶子节点通过单击、双击、触控的方式或通过拖动至查询条件选择区域时，该显示单元可以将解析的该叶子节点对应的字段显示在条件查询区域中。
根据本实施例的另一示例，该第二查询条件生成单元根据该查询字段及该查询值生成该查询条件可以依赖为对应的查询字段配置的属性，例如当为员工工资这一字段配置的属性是“不可见”时，则不将对应的字段作为查询条件之一。
根据本实施例的一个使用场景例如，当用户输入的查询字段及对应的查询值分别为“员工的姓名：张三”and“员工的年龄：45”and“员工的工资：>10000”时，若员工的工资这一字段的属性为不可见，则显示单元仅显示“员工的姓名：张三”and“员工的年龄：45”的查询结果。
在一些实施例中，该业务报表的查询装置10还包括：
保存模块，用于接收到保存指令时，将该查询条件及在该源数据表中依据该查询条件查询的结果同时保存。
根据本实施例的一个示例，该保存模块具体用于将该查询条件以及查询结果以rpt格式的文件保存在默认的路径下，或另存为用户选择的其它路径下。
其中上述第一查询条件生成单元及第二查询条件生成单元中的“第一”和“第二”的意义仅在于将两个查询条件生成单元加以区分，并不用于限定哪个查询条件生成单元的优先级更高或者其它的限定意义。
其中，该业务报表的查询装置中包括的各个模块可全部或部分通过软件、硬件或其组合来实现。进一步地，该业务报表的查询装置中的各个模块可以是用于实现对应功能的程序段。
上述业务报表的查询装置可以实现为一种计算机程序的形式，计算机程序可以在如 图7所示的计算机设备上运行。
关于业务报表的查询装置的具体限定可以参见上文中对于业务报表的查询方法的限定，在此不再赘述。上述业务报表的查询装置中的各个模块可全部或部分通过软件、硬件及其组合来实现。上述各模块可以硬件形式内嵌于或独立于计算机设备中的处理器中，也可以以软件形式存储于计算机设备中的存储器中，以便于处理器调用执行以上各个模块对应的操作。
在一个实施例中，提供了一种计算机设备，该计算机设备可以是服务器，其内部结构图可以如图7所示。该计算机设备包括通过系统总线连接的处理器、存储器、网络接口和数据库。其中，该计算机设备的处理器用于提供计算和控制能力。该计算机设备的存储器包括非易失性存储介质、内存储器。该非易失性存储介质存储有操作系统、计算机可读指令和数据库。该内存储器为非易失性存储介质中的操作系统和计算机可读指令的运行提供环境。该计算机设备的数据库用于存储业务报表的查询数据。该计算机设备的网络接口用于与外部的终端通过网络连接通信。该计算机可读指令被处理器执行时以实现一种业务报表的查询方法。
本领域技术人员可以理解，图7中示出的结构，仅仅是与本申请方案相关的部分结构的框图，并不构成对本申请方案所应用于其上的计算机设备的限定，具体的计算机设备可以包括比图中所示更多或更少的部件，或者组合某些部件，或者具有不同的部件布置。
一种计算机设备，包括存储器和一个或多个处理器，存储器中储存有计算机可读指令，计算机可读指令被处理器执行时，使得一个或多个处理器执行以下步骤：接收从表字段树中被选择的叶子节点，该表字段树是根据源数据表中的字段生成的，该表字段树中被选择的叶子节点所对应的字段为查询字段。根据该叶子节点所对应的查询字段生成查询条件。接收到查询指令时，在该源数据表中依据该查询条件进行查询。
在一些实施例中，处理器执行计算机可读指令时还实现还包括：获取该源数据表的表名及该源数据表中的字段。以该表名为根节点，以对应源数据表中的字段为叶子节点创建该表字段树。
在一些实施例中，处理器执行计算机可读指令时实现该接收从表字段树中被选择的叶子节点的步骤包括：根据输入的第一指令，确定被选中的该表字段树中的叶子节点。当检测到确定的该叶子节点被拖动至预设的区域时，将该的叶子节点所对应的字段确定为该查询字段。
在一些实施例中，处理器执行计算机可读指令时实现该根据该叶子节点所对应的查询字段生成查询条件的步骤包括：当接收的该表示查询字段的叶子节点的个数为两个以上时，获取该叶子节点对应的查询字段。接收输入的不同查询字段之间的逻辑操作或获取预设的不同查询字段之间的逻辑操作。根据该查询字段及不同查询字段之间的逻辑操作生成该查询条件。
在一些实施例中，处理器执行计算机可读指令时还实现以下步骤：获取该源数据表中的字段。根据输入的第二指令，对获取的该字段的属性进行配置。
在一些实施例中，处理器执行计算机可读指令时实现该根据该叶子节点所对应的查询字段生成查询条件的步骤包括：解析该叶子节点所对应的查询字段。显示解析的该查询字段。接收输入的该查询字段的查询值，查询值与查询字段配置的属性相对应。根据该查询字段及该查询值生成该查询条件。
在一些实施例中，处理器执行计算机可读指令时还实现以下步骤：接收到保存指令时，将该查询条件及在该源数据表中依据该查询条件查询的结果同时保存。
一个或多个存储有计算机可读指令的非易失性计算机可读指令存储介质，计算机可读指令被一个或多个处理器执行时，使得一个或多个处理器执行以下步骤：接收从表字段树中被选择的叶子节点，该表字段树是根据源数据表中的字段生成的，该表字段树中被选择的叶子节点所对应的字段为查询字段。根据该叶子节点所对应的查询字段生成查询条件。接收到查询指令时，在该源数据表中依据该查询条件进行查询。
在一些实施例中，计算机可读指令被处理器执行时还实现还包括：获取该源数据表的表名及该源数据表中的字段。以该表名为根节点，以对应源数据表中的字段为叶子节点创建该表字段树。
在一些实施例中，计算机可读指令被处理器执行时实现该接收从表字段树中被选择的叶子节点的步骤包括：根据输入的第一指令，确定被选中的该表字段树中的叶子节点。当检测到确定的该叶子节点被拖动至预设的区域时，将该的叶子节点所对应的字段确定为该查询字段。
在一些实施例中，计算机可读指令被处理器执行时实现该根据该叶子节点所对应的查询字段生成查询条件的步骤包括：当接收的该表示查询字段的叶子节点的个数为两个以上时，获取该叶子节点对应的查询字段。接收输入的不同查询字段之间的逻辑操作或获取预设的不同查询字段之间的逻辑操作。根据该查询字段及不同查询字段之间的逻辑操作生 成该查询条件。
在一些实施例中，计算机可读指令被处理器执行时还实现以下步骤：获取该源数据表中的字段。根据输入的第二指令，对获取的该字段的属性进行配置。
在一些实施例中，计算机可读指令被处理器执行时实现该根据该叶子节点所对应的查询字段生成查询条件的步骤包括：解析该叶子节点所对应的查询字段。显示解析的该查询字段。接收输入的该查询字段的查询值，查询值与查询字段配置的属性相对应。根据该查询字段及该查询值生成该查询条件。
在一些实施例中，计算机可读指令被处理器执行时还实现以下步骤：接收到保存指令时，将该查询条件及在该源数据表中依据该查询条件查询的结果同时保存。本实施例通过允许用户从表字段树的叶子节点中选取表示查询字段的叶子节点，使得系统可以根据被选取的叶子节点所对应的字段确定查询字段，进一步通过该查询字段生成查询条件，使得用户在查询条件的选择上一方面可以自行选择生产查询条件的查询字段，另一方面，由于该查询字段以叶子节点的形式存在表字段树中，且该表字段树中的叶子节点为预先设定的可以作为查询字段的源数据表中的字段，因此可以保证用户在该表字段树中选择的查询字段是合法的，减少误输入的次数，从而提高业务报表查询的效率。
本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程，是可以通过计算机可读指令来指令相关的硬件来完成，所述的计算机可读指令可存储于一非易失性计算机可读取存储介质中，该计算机可读指令在执行时，可包括如上述各方法的实施例的流程。其中，本申请所提供的各实施例中所使用的对存储器、存储、数据库或其它介质的任何引用，均可包括非易失性和/或易失性存储器。非易失性存储器可包括只读存储器(ROM)、可编程ROM(PROM)、电可编程ROM(EPROM)、电可擦除可编程ROM(EEPROM)或闪存。易失性存储器可包括随机存取存储器(RAM)或者外部高速缓冲存储器。作为说明而非局限，RAM以多种形式可得，诸如静态RAM(SRAM)、动态RAM(DRAM)、同步DRAM(SDRAM)、双数据率SDRAM(DDRSDRAM)、增强型SDRAM(ESDRAM)、同步链路(Synchlink)DRAM(SLDRAM)、存储器总线(Rambus)直接RAM(RDRAM)、直接存储器总线动态RAM(DRDRAM)、以及存储器总线动态RAM(RDRAM)等。
以上实施例的各技术特征可以进行任意的组合，为使描述简洁，未对上述实施例中的各个技术特征所有可能的组合都进行描述，然而，只要这些技术特征的组合不存在矛盾， 都应当认为是本说明书记载的范围。
以上所述实施例仅表达了本申请的几种实施方式，其描述较为具体和详细，但并不能因此而理解为对发明专利范围的限制。应当指出的是，对于本领域的普通技术人员来说，在不脱离本申请构思的前提下，还可以做出若干变形和改进，这些都属于本申请的保护范围。因此，本申请专利的保护范围应以所附权利要求为准。

Claims (20)

  1. 一种业务报表的查询方法，方法包括：
    接收从表字段树中被选择的叶子节点，所述表字段树是根据源数据表中的字段生成的，所述表字段树中被选择的叶子节点所对应的字段为查询字段；
    根据所述叶子节点所对应的查询字段生成查询条件；及
    接收到查询指令时，在所述源数据表中依据所述查询条件进行查询。
  2. 根据权利要求1所述的方法，其特征在于，还包括：
    获取所述源数据表的表名及所述源数据表中的字段；及
    以所述表名为根节点，以对应源数据表中的字段为叶子节点创建所述表字段树。
  3. 根据权利要求2所述的方法，其特征在于，所述接收从表字段树中被选择的叶子节点包括：
    根据输入的第一指令，确定被选中的所述表字段树中的叶子节点；及
    当检测到确定的所述叶子节点被拖动至预设的区域时，将所述的叶子节点所对应的字段确定为所述查询字段。
  4. 根据权利要求1至3任一项所述的方法，其特征在于，所述根据所述叶子节点所对应的查询字段生成查询条件包括：
    当接收的所述表示查询字段的叶子节点的个数为两个以上时，获取所述叶子节点对应的查询字段；
    接收输入的不同查询字段之间的逻辑操作或获取预设的不同查询字段之间的逻辑操作；及
    根据所述查询字段及不同查询字段之间的逻辑操作生成所述查询条件。
  5. 根据权利要求1至3任一项所述的方法，其特征在于，还包括：
    获取所述源数据表中的字段；及
    根据输入的第二指令，对获取的所述字段的属性进行配置。
  6. 根据权利要求5所述的方法，其特征在于，所述根据所述叶子节点所对应的查询字段生成查询条件包括：
    解析所述叶子节点所对应的查询字段；
    显示解析的所述查询字段；
    接收输入的所述查询字段的查询值，所述查询值与所述查询字段配置的属性相对应； 及
    根据所述查询字段及所述查询值生成所述查询条件。
  7. 根据权利要求1至3任一项所述的方法，其特征在于，还包括：
    接收到保存指令时，将所述查询条件及在所述源数据表中依据所述查询条件查询的结果同时保存。
  8. 一种业务报表的查询装置，装置包括：
    叶子节点接收模块，用于接收从表字段树中被选择的叶子节点，所述表字段树是根据源数据表中的字段生成的，所述表字段树中被选择的叶子节点所对应的字段为查询字段；
    查询条件生成模块，用于根据所述叶子节点所对应的查询字段生成查询条件；及
    查询模块，用于接收到查询指令时，在所述源数据表中依据所述查询条件进行查询。
  9. 根据权利要求8所述的装置，其特征在于，所述业务报表的查询装置，还包括：
    字段获取模块，用于获取所述源数据表的表名及所述源数据表中的字段；及
    字段获取模块，用于以所述表名为根节点，以对应源数据表中的字段为叶子节点创建所述表字段树。
  10. 一种计算机设备，包括存储器及一个或多个处理器，所述存储器中储存有计算机可读指令，所述计算机可读指令被所述一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    接收从表字段树中被选择的叶子节点，所述表字段树是根据源数据表中的字段生成的，所述表字段树中被选择的叶子节点所对应的字段为查询字段；
    根据所述叶子节点所对应的查询字段生成查询条件；及
    接收到查询指令时，在所述源数据表中依据所述查询条件进行查询。
  11. 根据权利要求10所述的计算机设备，其特征在于，所述处理器执行所述计算机可读指令时还执行以下步骤：
    获取所述源数据表的表名及所述源数据表中的字段；及
    以所述表名为根节点，以对应源数据表中的字段为叶子节点创建所述表字段树。
  12. 根据权利要求11所述的计算机设备，其特征在于，所述处理器执行所述计算机可读指令时实现所述接收从表字段树中被选择的叶子节点包括：
    根据输入的第一指令，确定被选中的所述表字段树中的叶子节点；及
    当检测到确定的所述叶子节点被拖动至预设的区域时，将所述的叶子节点所对应的字段确定为所述查询字段。
  13. 根据权利要求10至12任一项所述的计算机设备，其特征在于，所述处理器执行所述计算机可读指令时实现所述根据所述叶子节点所对应的查询字段生成查询条件包括：
    当接收的所述表示查询字段的叶子节点的个数为两个以上时，获取所述叶子节点对应的查询字段；
    接收输入的不同查询字段之间的逻辑操作或获取预设的不同查询字段之间的逻辑操作；及
    根据所述查询字段及不同查询字段之间的逻辑操作生成所述查询条件。
  14. 根据权利要求10至12任一项所述的计算机设备，其特征在于，所述处理器执行所述计算机可读指令时还执行以下步骤：
    获取所述源数据表中的字段；及
    根据输入的第二指令，对获取的所述字段的属性进行配置。
  15. 根据权利要求14所述的计算机设备，其特征在于，所述处理器执行所述计算机可读指令时实现所述根据所述叶子节点所对应的查询字段生成查询条件包括：
    解析所述叶子节点所对应的查询字段；
    显示解析的所述查询字段；
    接收输入的所述查询字段的查询值，所述查询值与所述查询字段配置的属性相对应；及
    根据所述查询字段及所述查询值生成所述查询条件。
  16. 根据权利要求10至12任一项所述的计算机设备，其特征在于，所述处理器执行所述计算机可读指令时还执行以下步骤：
    接收到保存指令时，将所述查询条件及在所述源数据表中依据所述查询条件查询的结果同时保存。
  17. 一个或多个存储有计算机可读指令的非易失性计算机可读指令存储介质，所述计算机可读指令被一个或多个处理器执行时，使得所述一个或多个处理器执行以下步骤：
    接收从表字段树中被选择的叶子节点，所述表字段树是根据源数据表中的字段生成的，所述表字段树中被选择的叶子节点所对应的字段为查询字段；
    根据所述叶子节点所对应的查询字段生成查询条件；及
    接收到查询指令时，在所述源数据表中依据所述查询条件进行查询。
  18. 根据权利要求17所述的存储介质，其特征在于，所述计算机可读指令被所述处理器执行时还执行以下步骤：
    获取所述源数据表的表名及所述源数据表中的字段；及
    以所述表名为根节点，以对应源数据表中的字段为叶子节点创建所述表字段树。
  19. 根据权利要求18所述的存储介质，其特征在于，所述计算机可读指令被所述处理器执行时实现所述接收从表字段树中被选择的叶子节点包括：
    根据输入的第一指令，确定被选中的所述表字段树中的叶子节点；及
    当检测到确定的所述叶子节点被拖动至预设的区域时，将所述的叶子节点所对应的字段确定为所述查询字段。
  20. 根据权利要求17至19任一项所述的存储介质，其特征在于，所述计算机可读指令被所述处理器执行时实现
    所述根据所述叶子节点所对应的查询字段生成查询条件包括：
    当接收的所述表示查询字段的叶子节点的个数为两个以上时，获取所述叶子节点对应的查询字段；
    接收输入的不同查询字段之间的逻辑操作或获取预设的不同查询字段之间的逻辑操作；及
    根据所述查询字段及不同查询字段之间的逻辑操作生成所述查询条件。
PCT/CN2018/088360 2017-10-17 2018-05-25 业务报表的查询方法、装置、计算机设备及存储介质 WO2019076050A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710962180.5 2017-10-17
CN201710962180.5A CN107908657A (zh) 2017-10-17 2017-10-17 业务报表的查询方法、装置、计算机设备及存储介质

Publications (1)

Publication Number Publication Date
WO2019076050A1 true WO2019076050A1 (zh) 2019-04-25

Family

ID=61840451

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/088360 WO2019076050A1 (zh) 2017-10-17 2018-05-25 业务报表的查询方法、装置、计算机设备及存储介质

Country Status (2)

Country Link
CN (1) CN107908657A (zh)
WO (1) WO2019076050A1 (zh)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107908657A (zh) * 2017-10-17 2018-04-13 平安科技（深圳）有限公司 业务报表的查询方法、装置、计算机设备及存储介质
CN108710708A (zh) * 2018-05-31 2018-10-26 泰康保险集团股份有限公司 报表处理方法、装置、介质及电子设备
CN109213775B (zh) * 2018-09-18 2022-11-01 深圳壹账通智能科技有限公司 搜索方法、装置、计算机设备和存储介质
CN109445768B (zh) * 2018-09-28 2022-02-11 平安科技（深圳）有限公司 数据库脚本生成方法、装置、计算机设备及存储介质
CN109308284B (zh) * 2018-09-28 2023-09-19 中国平安财产保险股份有限公司 报表菜单生成方法、装置、计算机设备及存储介质
CN111159217A (zh) * 2019-12-27 2020-05-15 北京明略软件系统有限公司 数据查询方法、装置、服务器及存储介质
CN111708801A (zh) * 2020-05-29 2020-09-25 北京金山云网络技术有限公司 报表生成方法、装置及电子设备
CN113220714A (zh) * 2021-05-29 2021-08-06 五八到家有限公司 可配置的数据查询平台及方法、电子设备及可读介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103970527A (zh) * 2013-01-28 2014-08-06 国际商业机器公司 为报表生成提供辅助覆盖的方法和系统
CN105740333A (zh) * 2016-01-23 2016-07-06 北京掌阔移动传媒科技有限公司 一种可视化的广告管理平台和实现方法
US20170140039A1 (en) * 2012-09-07 2017-05-18 Splunk Inc. Graphical display of field values extracted from machine data
CN107908657A (zh) * 2017-10-17 2018-04-13 平安科技（深圳）有限公司 业务报表的查询方法、装置、计算机设备及存储介质

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102541529B (zh) * 2010-12-30 2015-12-16 北京亿阳信通科技有限公司 一种查询页面生成装置和方法
CN102542009B (zh) * 2011-12-14 2018-03-13 中兴通讯股份有限公司 数据查询方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170140039A1 (en) * 2012-09-07 2017-05-18 Splunk Inc. Graphical display of field values extracted from machine data
CN103970527A (zh) * 2013-01-28 2014-08-06 国际商业机器公司 为报表生成提供辅助覆盖的方法和系统
CN105740333A (zh) * 2016-01-23 2016-07-06 北京掌阔移动传媒科技有限公司 一种可视化的广告管理平台和实现方法
CN107908657A (zh) * 2017-10-17 2018-04-13 平安科技（深圳）有限公司 业务报表的查询方法、装置、计算机设备及存储介质

Also Published As

Publication number Publication date
CN107908657A (zh) 2018-04-13

Similar Documents

Publication Publication Date Title
WO2019076050A1 (zh) 业务报表的查询方法、装置、计算机设备及存储介质
US11797532B1 (en) Dashboard display using panel templates
US10928970B2 (en) User-interface for developing applications that apply machine learning
US10963135B2 (en) Language-based manipulation of data visualizations
WO2019134340A1 (zh) 薪资计算方法、应用服务器及计算机可读存储介质
KR101643436B1 (ko) 웹 기반 도표 시각화를 위한 확장성
WO2018214859A1 (zh) 人机对话数据分析方法及装置
EP3547145A2 (en) Systems and methods for reducing storage required for code coverage results
US20140331179A1 (en) Automated Presentation of Visualized Data
US11016650B1 (en) Building data metric objects through user interactions with data marks of displayed visual representations of data sources
CN111061766A (zh) 一种业务数据的处理方法、装置、计算机设备及存储介质
US20150317572A1 (en) On-Demand Enrichment of Business Data
US20210304142A1 (en) End-user feedback reporting framework for collaborative software development environments
WO2017091612A1 (en) Application development framework using configurable data types
JP2015146182A (ja) タグ付け解析及び／又は論理カストディアンを使用した、電子文書の取り出し及び報告
JP2015090714A (ja) 電子文書の取り出し及び報告
US20100274851A1 (en) Natural Ordering in a Graphical User Interface
US20170228423A1 (en) Declarative partitioning for data collection queries
US9477645B2 (en) Systems and methods of active text markup
US11204925B2 (en) Enabling data source extensions
US9817891B1 (en) System, method, and computer program for creating metadata-based search queries
WO2023202704A1 (zh) 一种业务信息处理方法、装置及电子设备
US9239669B2 (en) Common user interface view grouping and sharing framework in online applications
US11301538B1 (en) Data management in multi-application web pages
WO2019085354A1 (zh) 基于Excel系统界面的数据库联动方法、电子装置及存储介质

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 02.10.2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18869362

Country of ref document: EP

Kind code of ref document: A1