CN109033157B - Complex data retrieval method and system based on user-defined search condition tree - Google Patents

Complex data retrieval method and system based on user-defined search condition tree Download PDF

Info

Publication number
CN109033157B
CN109033157B CN201810613338.2A CN201810613338A CN109033157B CN 109033157 B CN109033157 B CN 109033157B CN 201810613338 A CN201810613338 A CN 201810613338A CN 109033157 B CN109033157 B CN 109033157B
Authority
CN
China
Prior art keywords
condition
search condition
search
tree
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810613338.2A
Other languages
Chinese (zh)
Other versions
CN109033157A (en
Inventor
胡兴旺
孙卫东
朱郯博
戚鲁凤
孙文川
刘宝玉
杨军虎
孔刚
杨沂婷
柳明辉
刘士红
匡雪莲
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shandong Luruan Digital Technology Co Ltd
Original Assignee
Shandong Luneng Software Technology Co Ltd
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 Shandong Luneng Software Technology Co Ltd filed Critical Shandong Luneng Software Technology Co Ltd
Priority to CN201810613338.2A priority Critical patent/CN109033157B/en
Publication of CN109033157A publication Critical patent/CN109033157A/en
Application granted granted Critical
Publication of CN109033157B publication Critical patent/CN109033157B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a complex data retrieval method and a system based on a user-defined search condition tree, wherein the method comprises the following steps: creating a search condition tree according to a user instruction; receiving a selection instruction of a user about a condition, and adding the condition to the search condition tree, wherein the search condition tree satisfies the following conditions: the same node condition relations of the father nodes are the same; wherein the condition is selected from a preset search condition library; a search is performed based on the search criteria tree. The invention can flexibly and quickly define various retrieval condition combinations by introducing the form of the search condition tree, and can meet the search requirements of users on sudden and complex condition combinations.

Description

Complex data retrieval method and system based on user-defined search condition tree
Technical Field
The invention belongs to the technical field of complex data retrieval, and particularly relates to a complex data retrieval method and system based on a custom search condition tree.
Background
With the rapid development of economic globalization, how to ensure that the whole process of enterprise production, operation and management activities keeps highly uniform action and high-efficiency operation is a challenge and a problem to be solved which must be faced by each enterprise in the economic environment with instantaneous change, opportunity and crisis. With the continuous application of enterprise informatization, enterprise data is increasingly huge, and a dynamic and efficient complex data retrieval technology is urgently needed to help enterprises quickly retrieve and inquire data meeting requirements from massive business data.
The existing inspection technology based on SAP platform mainly has the following defects:
research shows that in the process of complex data retrieval in all the current systems, data retrieval is retrieval operation of a union set obtained after all conditions are gathered, and the retrieval conditions are limited and cannot be increased or deleted at will, so that the complex data retrieval system is single in retrieval function, poor in repeatability, poor in adjustability and flexibility, and cannot meet the requirements of the whole system, the whole field free combination and the retrieval conditions and/or any combination of the retrieval conditions. When enterprises evaluate talents, various evaluation standards, namely search condition combinations, are usually provided, and the traditional retrieval method cannot adapt to flexible and variable search standards.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a complex data retrieval method and a complex data retrieval system based on a user-defined search condition tree, wherein the search condition tree is established according to a user instruction, and a specified condition is added to each node of the search condition tree; wherein the search condition tree satisfies: the same node condition relation of the father node is the same. The invention can flexibly and quickly define various retrieval condition combinations by introducing the form of the search condition tree, and can meet the search requirements of users on sudden and complex condition combinations.
In order to achieve the purpose, the invention adopts the following technical scheme:
a complex data retrieval method based on a user-defined search condition tree comprises the following steps:
creating a search condition tree according to a user instruction;
receiving a selection instruction of a user about a condition, and adding the condition to the search condition tree, wherein the search condition tree satisfies the following conditions: the same node condition relations of the father nodes are the same; wherein the condition is selected from a preset search condition library;
a search is performed based on the search criteria tree.
Further, the search condition library comprises a plurality of selectable conditions and condition attributes, wherein the condition attributes comprise the dimension to which the condition belongs and the relevant fields of the condition.
Further, every time a condition is added to the search condition tree, the following determination is performed: searching a parent node according to the position of the node to be added according to the condition, obtaining the condition of the child node added under the parent node, firstly judging whether fields are repeated, if so, sending a reminding message, and if not, executing the next step; and judging whether the logical relations are consistent, if so, successfully adding, and if not, correcting by one key.
Further, the search condition tree also receives a value or a value range of a condition-related field specified by a user.
Further, in the process of constructing the search condition tree, a special search heading table, a special search condition item table and a special search condition item range table are generated and stored.
Further, the performing retrieval based on the search criteria tree includes:
acquiring search condition data corresponding to the search condition tree, wherein the search condition data comprises a special search heading table, a special search condition item table and a special search condition item range table;
reconstructing the search condition data, and adding hierarchy information and grouping information;
and analyzing the data to be retrieved item by item according to the reconstructed searching conditions, and screening the retrieval results meeting the searching conditions.
Further, the reconstructing the search condition data includes:
(1) acquiring a first-layer node and attaching hierarchy information;
(2) tracing a certain node at the bottom layer downwards, traversing all brother nodes of the node, attaching hierarchy information, and printing grouping information;
(3) tracing a node upwards, judging whether the node has a brother node which is not passed through, if so, adding hierarchy information, and executing the step (2); if not, adding the level information, marking a grouping mark, and continuing to execute the step (3) until all nodes are traversed.
Further, the method for analyzing the data to be retrieved item by item comprises the following steps:
for a certain piece of data to be retrieved, firstly, judging according to the conditions of the bottom layer to obtain the logic judgment result of each condition of the bottom layer; summarizing the logic judgment result of the bottom layer according to grouping; the results are then summarized sequentially upwards.
According to a second object of the present invention, there is also provided a server,
sending a preset search condition library to a user terminal;
receiving a search condition tree created by a user from the user terminal and a selection instruction about a condition, judging whether the selection meets the rule of the search condition tree, if so, adding the condition to the search condition tree, wherein the rule of the search condition tree meets the condition relationship of the same nodes as father nodes; wherein the condition is selected from a preset search condition library.
According to a third object of the present invention, there is also provided a user terminal,
creating a search condition tree according to a user instruction;
receiving a selection instruction of a user about a condition, sending a current search condition tree and the selection instruction to a server to execute judgment, and adding a condition meeting a search condition tree rule to the search condition tree;
a search is performed based on the search criteria tree.
The invention has the advantages of
1. The search condition library is comprehensive, complete and configurable, comprises all organization personnel conditions, talent dimension conditions, personnel attribute conditions and the like, and ensures the comprehensiveness of the search conditions and the diversification of the search condition combinations. By introducing the form of the search condition tree, various retrieval condition combinations can be flexibly and quickly customized, and the search requirements of users on sudden and complex condition combinations can be met.
2. The invention can customize different search condition libraries according to the service scenes of different units and customize various search condition combinations according to different evaluation standards, thereby providing search results under different evaluation standards to assist decision making.
3. When the invention is used for searching based on the search condition tree, the data searching is not limited to the searching function of collecting the union of all the conditions, and the logical relation of the search conditions is more flexible. And the retrieval level and the retrieval condition can be added or deleted according to needs. Therefore, the method has the advantages of randomly adjustable search conditions, various search functions and the like.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the application and, together with the description, serve to explain the application and are not intended to limit the application.
FIG. 1 is a flow chart of a complex data retrieval method based on a custom search criteria tree according to the present invention;
FIG. 2 is a diagram illustrating the assignment of values or value ranges to search condition-related fields;
FIG. 3 is a flow chart of search condition reconstruction during a search process;
FIG. 4 is a schematic diagram of search criteria reconstructed after hierarchy and grouping;
FIG. 5 is a block diagram of a complex data retrieval system based on a custom search criteria tree according to the present invention.
Detailed Description
It should be noted that the following detailed description is exemplary and is intended to provide further explanation of the disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present application. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
The embodiments and features of the embodiments in the present application may be combined with each other without conflict.
Example one
The embodiment discloses a complex data retrieval method based on a custom search condition tree, as shown in fig. 1, comprising the following steps:
step 1: constructing a search condition library, wherein the search condition library comprises a plurality of conditions and corresponding condition attributes;
the search condition library is pre-customized and configured to include selectable screening conditions and condition attributes.
The condition attribute includes the dimension to which the condition belongs and the associated field of the condition. Taking the condition "academic form information" as an example, the dimension to which it belongs is "basic quality", and the information fields of the condition include "start date", "end date", "education type", "organization/place", "certificate", "college (department)", and the like.
And according to the dimension type and the node field configured by the user, the program is automatically displayed in a tree structure after being called.
Step 2: creating a search condition tree according to a user instruction, receiving a condition selected by a user based on the search condition library, adding the condition to the search condition tree, wherein the search condition tree satisfies the following conditions: the same node condition relations of the father nodes are the same;
and the user self-defines and constructs a search condition tree according to the search condition database data, and determines the hierarchical structure, the hierarchical relation, the specific content and the name of the search condition tree of the node/condition.
The hierarchy, i.e., the hierarchical relationship of the conditions; the hierarchical relationship is a conditional relationship (logical relationship, including ' and ' or ') corresponding to each hierarchy; the specific content represents a value or a value range of the condition specific information field. Preferably, all the information field contents with the domain values are converted into a multi-selection box, a radio box and the like for display, so that the user can select the information field contents. Specifically, when a value range in specific content is set, a selection of a user for an information field is received, the type of the information field is determined, and a display effect corresponding to the type is displayed (see fig. 2).
When a search condition tree is constructed, search condition information is generated and stored, wherein the search condition information comprises a special search heading table, a special search condition item table and a special search condition item range table.
And judging whether the operation meets a preset rule or not every time a condition is added to the search condition tree: the same node condition relation of the father node is the same. Specifically, the determination method is as follows:
(1) for the condition added to the same layer, firstly judging whether the fields are repeated, if so, sending a reminding message, and if not, executing the next step;
(2) and judging whether the logic relations are consistent or not, if so, successfully adding, and if not, providing a modification and ' AND ' OR ' option for the user, and receiving the selection of the user to perform one-key modification.
Preferably, the search condition library and a user-defined search condition Tree are displayed on a display interface at the same time, wherein the Tree structure of the search condition library is displayed in an SAP simple Tree mode; and displaying the Tree structure of the search condition Tree in a SAP Alv _ Tree mode. By using the clicking technology, the conditions can be directly dragged to the specified position of the search condition tree from the search condition library, and the aims of constructing the search condition tree and flexibly adjusting the search condition tree according to the condition library can also be achieved through a toolbar and a right key mode.
And after the search condition tree is constructed, binding the search condition tree to the user account. Preferably, search condition tree information is also saved. The search condition tree information comprises search condition names, structural hierarchies, hierarchical relations and hierarchical contents, and the search condition tree can be recovered as required according to the search condition tree information for historical record query or secondary editing based on the condition tree.
And meanwhile, the interface provides a formula display function. Formula exhibition pops up formula boxes in the main screen through DIALOGBOX technology, and the formula boxes can be displayed in size through dragging, and the formula boxes can be freely dragged to any area of the screen.
And step 3: based on the search condition tree, a retrieval is performed.
The system can dynamically screen a list of conforming personnel according to the content of the constructed search condition tree to generate a standing book report.
The method comprises the following specific steps.
Step 3.1: executing search, and triggering a background program to execute search;
step 3.2: acquiring search condition data;
and acquiring pre-stored search condition information, including a special search heading table, a special search condition item table and a special search condition item range table, and accurately positioning the content and the logical relationship of the search condition.
Step 3.3: reconstructing and attaching stack information to search condition information data
According to the acquired search condition information, traversing and reconstructing the search nodes/conditions, adding hierarchy information to each node/condition, and realizing the node grouping effect:
(1) acquiring a first-layer node and attaching hierarchy information;
(2) tracing the nodes to the bottom layer, traversing all brother nodes, attaching hierarchy information, and printing grouping information;
(3) tracing a node upwards, judging whether a brother node which has not been passed exists or not,
if so, adding the hierarchical information, and executing (2);
if not, additional level information is added, a grouping mark is marked, and the step (3) is continued until all nodes/conditions are traversed.
The concrete implementation process is as follows (as in figure 3)
Initializing a current node, wherein the hierarchy of the current node is 1, and the ID is null;
adding current level information to a current node;
if the node end identifier is not equal to "Y",
and judging whether a child node without the traversal mark 'E' exists or not, if so, replacing the current node with the child node without the traversal mark 'E' of the current node, and marking the current node with the traversal mark 'E', wherein the current level is equal to the current level + 1.
If the node end identifier is equal to "Y", or there is no child node without the traversal flag "E",
determining whether there is a sibling node that does not traverse the identifier "E",
if the current level is the current level, the current level is marked with a traversal mark E;
if not, judging whether a father node exists or not, if so, replacing the current node with the father node of the current node, wherein the current node is the current level-1, and marking the current node with a node end mark 'Y'; if the father node does not exist, marking a flow completion mark 'X'.
Step 3.4: filtering according to reconstructed search condition set information aiming at a certain person
And acquiring a personnel list, randomly distributing a personnel, and judging whether the personnel meets the search condition according to the reconstructed search condition.
If the personnel meets the condition, storing the personnel into a qualified personnel set list, and then continuously judging the next personnel until all the personnel are traversed;
if the personnel does not meet the conditions, continuing judging the next personnel until all the personnel are traversed;
the specific method for judging whether the personnel meet the search condition is as follows:
(1) according to the step 3.3, all the conditions/nodes are added with hierarchy information, and the groups are divided in the same hierarchy;
(2) judging T/F (such as node/condition 41 and node/condition 42) of the bottom layer condition according to the content of the search condition;
(3) and according to judgment symbols such as and/or and the like, logically summarizing and judging T/F for the bottom layer grouping, and summarizing the results upwards in sequence. For example: if both conditions/nodes 41, 42 are "T" AND the logical relationship is "AND", then the result of grouping A is also "T", AND summarizing the result up, node/condition 32 is also "T".
Step 3.5: acquiring personnel basic information and point information to generate a standing book
(1) Acquiring an operation talent point program of a person according to the person list to acquire talent points;
(2) acquiring basic information such as departments, units and the like according with time nodes according to the personnel list;
(3) and generating a personnel standing book report.
Step 3.6: and displaying the query result, transmitting the ledger report data to a JAVA page, and displaying the query result.
Example two
It is an object of the present embodiment to provide a complex data retrieval system.
As shown in fig. 4, the system is divided into a JAVA layer and a logic layer implementation.
And in the JAVA layer, a user flexibly constructs a self-defined search condition tree according to the customized search condition library through foreground operation and independently queries results.
The method specifically comprises the following steps:
(1) configuring a search condition library: configuring standard dimensions and fields;
(2) user self-defining and constructing a search condition tree:
determining a name hierarchy for the node/condition;
determining a hierarchical relationship of nodes/conditions;
determining the specific content of the node/condition;
confirming and saving the name of the search condition tree;
(3) a user inputs a query application and executes the query;
(4) and displaying the query result of the user.
The logic layer realizes the function of the JAVA layer through 3 parts of components such as a data layer, a background operation layer, a function calling layer and the like:
(1) and (3) a data layer: real-time full-service real-time data such as personnel, organization, salary, performance, talents, training and the like, and non-real-time data such as personnel attributes, talent evaluation standard results, talent scores and the like are provided for complex data retrieval.
The real-time data includes: the evaluation criterion is head-up, the special item search condition item range, and the special item search is head-up.
The non-real-time data includes: a special item search result table, a personnel attribute table and an evaluation standard result table.
(2) Background operation layer: and providing a background operation function of complex search. The method comprises a search calculation program, a personnel attribute writing program and an evaluation standard calculation program, and SAP background operation is generated according to complex retrieval conditions based on a data layer.
(3) Function calling layer: different logic processing functions of complex search are provided, including functions of obtaining an evaluation standard list, obtaining a special item search condition, saving the special item search condition, obtaining a special item search list, executing the special item search, obtaining a special item search result and the like.
The embodiment provides a complex data retrieval system based on a custom search condition tree, which comprises:
the system comprises a research and development client, a server and a database server, wherein the research and development client configures a search condition library and sends the search condition library to the server;
the user terminal receives and displays the search condition library sent by the server;
receiving a user instruction to create a search condition tree;
receiving a selection instruction of a user about a condition, wherein the condition is selected from a preset search condition library,
sending the current search condition tree and a selection instruction to a server to execute judgment, and adding a condition meeting a search condition tree rule to the search condition tree;
a search is performed based on the search criteria tree.
The server sends a preset search condition library to the user terminal;
receiving a search condition tree sent by a user terminal and a selection instruction about a condition, judging whether the selection meets the rule of the search condition tree, if so, sending an instruction allowing addition to the user terminal, wherein the rule of the search condition tree meets the condition relationship of the same nodes of the father nodes and is the same.
The steps related to the second embodiment correspond to the first embodiment of the method, and the detailed description thereof can be found in the relevant description of the first embodiment. The term "computer-readable storage medium" should be taken to include a single medium or multiple media containing one or more sets of instructions; it should also be understood to include any medium that is capable of storing, encoding or carrying a set of instructions for execution by a processor and that cause the processor to perform any of the methods of the present invention.
The invention has the advantages of
1. The search condition library is comprehensive, complete and configurable, comprises all organization personnel conditions, talent dimension conditions, personnel attribute conditions and the like, and ensures the comprehensiveness of the search conditions and the diversification of the search condition combinations. By introducing the form of the search condition tree, various retrieval condition combinations can be flexibly and quickly customized, and the search requirements of users on sudden and complex condition combinations can be met.
2. The invention can customize different search condition libraries according to the service scenes of different units and customize various search condition combinations according to different evaluation standards, thereby providing search results under different evaluation standards to assist decision making.
3. When the invention is used for searching based on the search condition tree, the data searching is not limited to the searching function of collecting the union of all the conditions, and the logical relation of the search conditions is more flexible. And the retrieval level and the retrieval condition can be added or deleted according to needs. Therefore, the method has the advantages of randomly adjustable search conditions, various search functions and the like.
Those skilled in the art will appreciate that the modules or steps of the present invention described above can be implemented using general purpose computer means, or alternatively, they can be implemented using program code that is executable by computing means, such that they are stored in memory means for execution by the computing means, or they are separately fabricated into individual integrated circuit modules, or multiple modules or steps of them are fabricated into a single integrated circuit module. The present invention is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Although the embodiments of the present invention have been described with reference to the accompanying drawings, it is not intended to limit the scope of the present invention, and it should be understood by those skilled in the art that various modifications and variations can be made without inventive efforts by those skilled in the art based on the technical solution of the present invention.

Claims (6)

1. A complex data retrieval method based on a user-defined search condition tree is characterized by comprising the following steps:
creating a search condition tree according to a user instruction;
receiving a selection instruction of a user about a condition, adding the condition to the search condition tree, and executing the following judgment: searching a parent node according to the position of the node to be added according to the condition, obtaining the condition of the child node added under the parent node, firstly judging whether fields are repeated, if so, sending a reminding message, and if not, executing the next step; judging whether the logical relations are consistent, if so, adding successfully, and if not, providing a modification and ' AND ' OR ' or ' OR ' option for the user, and modifying by one key; wherein the condition is selected from a preset search condition library; the search condition library comprises a plurality of selectable conditions and condition attributes, wherein the condition attributes comprise the dimension to which the condition belongs and the relevant fields of the condition;
performing a search based on the search criteria tree: acquiring search condition data corresponding to the search condition tree, wherein the search condition data comprises a special search heading table, a special search condition item table and a special search condition item range table; reconstructing the search condition data, and adding hierarchy information and grouping information; analyzing the data to be retrieved item by item according to the reconstructed searching conditions, and screening the retrieval results meeting the searching conditions;
the method for analyzing the data to be retrieved one by one according to the reconstructed search conditions comprises the following steps: for a certain piece of data to be retrieved, firstly, judging according to the conditions of the bottom layer to obtain the logic judgment result of each condition of the bottom layer; summarizing the logic judgment result of the bottom layer according to grouping; the results are then summarized sequentially upwards.
2. The complex data retrieval method based on the self-defined search condition tree as claimed in claim 1, wherein the search condition tree further receives a value or a value range of a condition-related field specified by a user.
3. The method as claimed in claim 2, wherein in the process of constructing the search condition tree, a special search top table, a special search condition item table, and a special search condition item range table are generated and stored.
4. The method for complex data retrieval based on the custom search condition tree as claimed in claim 1, wherein the reconstructing the search condition data comprises:
(1) acquiring a first-layer node and attaching hierarchy information;
(2) tracing a certain node at the bottom layer downwards, traversing all brother nodes of the node, attaching hierarchy information, and printing grouping information;
(3) tracing a node upwards, judging whether the node has a brother node which is not passed through, if so, adding hierarchy information, and executing the step (2); if not, adding the level information, marking a grouping mark, and continuing to execute the step (3) until all nodes are traversed.
5. A server, characterized in that,
sending a preset search condition library to a user terminal;
receiving a search condition tree created by a user from the user terminal and a selection instruction about a condition, adding the condition to the search condition tree, and performing the following determination: searching a parent node according to the position of the node to be added according to the condition, obtaining the condition of the child node added under the parent node, firstly judging whether fields are repeated, if so, sending a reminding message, and if not, executing the next step; judging whether the logical relations are consistent, if so, adding successfully, and if not, providing a modification and ' AND ' OR ' or ' OR ' option for the user, and modifying by one key; wherein the condition is selected from a preset search condition library; the search condition library comprises a plurality of selectable conditions and condition attributes, wherein the condition attributes comprise the dimension to which the condition belongs and the relevant fields of the condition;
performing a search based on the search criteria tree: acquiring search condition data corresponding to the search condition tree, wherein the search condition data comprises a special search heading table, a special search condition item table and a special search condition item range table; reconstructing the search condition data, and adding hierarchy information and grouping information; analyzing the data to be retrieved item by item according to the reconstructed searching conditions, and screening the retrieval results meeting the searching conditions;
the method for analyzing the data to be retrieved one by one according to the reconstructed search conditions comprises the following steps: for a certain piece of data to be retrieved, firstly, judging according to the conditions of the bottom layer to obtain the logic judgment result of each condition of the bottom layer; summarizing the logic judgment result of the bottom layer according to grouping; the results are then summarized sequentially upwards.
6. A user terminal, characterized in that,
creating a search condition tree according to a user instruction;
receiving a selection instruction of a user about a condition, and sending a current search condition tree and the selection instruction to a server to execute judgment: searching a parent node according to the position of the node to be added according to the condition, obtaining the condition of the child node added under the parent node, firstly judging whether fields are repeated, if so, sending a reminding message, and if not, executing the next step; judging whether the logical relations are consistent, if so, adding successfully, and if not, providing a modification and ' AND ' OR ' or ' OR ' option for the user, and modifying by one key; wherein the condition is selected from a preset search condition library; the search condition library comprises a plurality of selectable conditions and condition attributes, wherein the condition attributes comprise the dimension to which the condition belongs and the relevant fields of the condition;
performing a search based on the search criteria tree: acquiring search condition data corresponding to the search condition tree, wherein the search condition data comprises a special search heading table, a special search condition item table and a special search condition item range table; reconstructing the search condition data, and adding hierarchy information and grouping information; analyzing the data to be retrieved item by item according to the reconstructed searching conditions, and screening the retrieval results meeting the searching conditions;
the method for analyzing the data to be retrieved one by one according to the reconstructed search conditions comprises the following steps: for a certain piece of data to be retrieved, firstly, judging according to the conditions of the bottom layer to obtain the logic judgment result of each condition of the bottom layer; summarizing the logic judgment result of the bottom layer according to grouping; the results are then summarized sequentially upwards.
CN201810613338.2A 2018-06-14 2018-06-14 Complex data retrieval method and system based on user-defined search condition tree Active CN109033157B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810613338.2A CN109033157B (en) 2018-06-14 2018-06-14 Complex data retrieval method and system based on user-defined search condition tree

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810613338.2A CN109033157B (en) 2018-06-14 2018-06-14 Complex data retrieval method and system based on user-defined search condition tree

Publications (2)

Publication Number Publication Date
CN109033157A CN109033157A (en) 2018-12-18
CN109033157B true CN109033157B (en) 2021-07-27

Family

ID=64609725

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810613338.2A Active CN109033157B (en) 2018-06-14 2018-06-14 Complex data retrieval method and system based on user-defined search condition tree

Country Status (1)

Country Link
CN (1) CN109033157B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110297626B (en) * 2019-05-23 2023-04-18 唐山钢铁集团有限责任公司 Tree display method based on SAP system
CN110750192A (en) * 2019-09-23 2020-02-04 紫光云(南京)数字技术有限公司 Filtering model method based on visual editing system
CN111415135B (en) * 2020-03-18 2023-07-25 浩云科技股份有限公司 Method for configuring flow executives

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104598647A (en) * 2015-02-16 2015-05-06 李剑 Method for searching and matching articles by way of tree graph
CN105740333A (en) * 2016-01-23 2016-07-06 北京掌阔移动传媒科技有限公司 Visual advertisement management platform, and implementation method thereof
CN106527912A (en) * 2016-10-28 2017-03-22 山东大学 Voronoi tree graph-based information retrieval visualization system and method
CN106919606A (en) * 2015-12-28 2017-07-04 航天信息股份有限公司 A kind of method and system that SQL query condition is realized based on tree construction

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7421442B2 (en) * 2002-07-02 2008-09-02 American Express Travel Related Services Company, Inc. System and method for data capture and reporting

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104598647A (en) * 2015-02-16 2015-05-06 李剑 Method for searching and matching articles by way of tree graph
CN106919606A (en) * 2015-12-28 2017-07-04 航天信息股份有限公司 A kind of method and system that SQL query condition is realized based on tree construction
CN105740333A (en) * 2016-01-23 2016-07-06 北京掌阔移动传媒科技有限公司 Visual advertisement management platform, and implementation method thereof
CN106527912A (en) * 2016-10-28 2017-03-22 山东大学 Voronoi tree graph-based information retrieval visualization system and method

Also Published As

Publication number Publication date
CN109033157A (en) 2018-12-18

Similar Documents

Publication Publication Date Title
US11641372B1 (en) Generating investigation timeline displays including user-selected screenshots
US11741089B1 (en) Interactive location queries for raw machine data
US11269476B2 (en) Concurrent display of search results from differing time-based search queries executed across event data
US10558651B2 (en) Search point management
US8806355B2 (en) Method and apparatus for visualizing and navigating within an immersive collaboration environment
EP2916276A1 (en) System including a data repository and a data importing component
US8930303B2 (en) Discovering pivot type relationships between database objects
US9720656B2 (en) Method and apparatus for enabling agile development of services in cloud computing and traditional environments
US10296505B2 (en) Framework for joining datasets
CN109033157B (en) Complex data retrieval method and system based on user-defined search condition tree
US20070113185A1 (en) Intelligent network diagram layout
US10747786B2 (en) Spontaneous networking
US20030204537A1 (en) Content management system and methodology for implementing a complex object using nested/recursive structures
WO2019110654A1 (en) Systems and methods for querying databases using interactive search paths
EP2157535A1 (en) Fast search views over business objects
CN106599241A (en) Big data visual management method for GIS software
US10235100B2 (en) Optimizing column based database table compression
CN112199373A (en) Form development method and system
CN116992092A (en) Method and device for establishing flow model, storage medium and terminal equipment
US20230177046A1 (en) Fast table search for visualization of complex hierarchy data
US9146958B2 (en) System and method for report to report generation
US20170277738A1 (en) Temporal representation of structured information in an object model
CN115658658A (en) Batch processing-based data sharing method and device for enterprise data middleboxes and storage medium
EP3807780A1 (en) Binding query scope to directory attributes
US20130218893A1 (en) Executing in-database data mining processes

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CP01 Change in the name or title of a patent holder
CP01 Change in the name or title of a patent holder

Address after: 185 Jingsi Road, Shizhong District, Jinan City, Shandong Province

Patentee after: Shandong luruan Digital Technology Co.,Ltd.

Address before: 185 Jingsi Road, Shizhong District, Jinan City, Shandong Province

Patentee before: SHANDONG LUNENG SOFTWARE TECHNOLOGY Co.,Ltd.