Automobile information interactive query method, device and equipment
By building and verifying the search condition diagram on the client of the information interaction query platform, and generating a conditional search queue on the back-end server for database search, the problems of search flexibility and inefficiency in the existing technology are solved, and more efficient and flexible automotive information retrieval is achieved.
Patent Information
- Application Number
- CN202111641960.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-12-29
- Publication Date
- 2025-04-15
- Estimated Expiration
- 2041-12-29
AI Technical Summary
In the prior art, since merchants have their own data display forms, as merchants increase, the matching efficiency and logical conditions of keyword search or sequential condition search are limited, resulting in a decrease in retrieval flexibility and query efficiency.
By constructing a search condition graph on the client of the information interactive query platform, the target condition component in the condition component library is used to construct and verify the search condition graph. If the verification is passed, the search condition graph will be sent to the back-end server, a conditional search queue is generated and the information database is searched, the corresponding information results are generated and returned to the client.
It improves the search efficiency and flexibility of users in retrieving automotive information. By visualizing the search condition components and logical relationships, users' accurate search capabilities for information are enhanced.
Smart Images

Figure CN114265985B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of information query, and in particular to a method, device and equipment for interactive query of automobile information. Background Art
[0002] With the continuous popularization of the Internet, the continuous development of Internet technology, and the continuous improvement of Internet infrastructure, surfing the Internet has become an indispensable entertainment activity for people before and after meals, and it is becoming more and more convenient for people to obtain knowledge and information from the Internet.
[0003] For automobile portal websites, the functions are realized around automobile-related information data. As an intermediate platform between merchants and consumers, it provides data delivery and information display for merchants, and provides data retrieval and data information for consumers. How to provide a good interactive experience and accurate information search is the top priority of portal website function optimization.
[0004] To this end, the existing technology usually obtains the information of merchants and saves it uniformly. The operation and maintenance personnel manually design and display the portal website based on the bidding rights of the merchants, and provide a conditional search box to retrieve information by keyword search. After obtaining the information results, the user selects the required information from them for subsequent operations. However, since merchants usually have their own data display forms, the above scheme is prone to further reduce the search flexibility and query efficiency as the number of merchants increases, and keyword search or sequential condition search is limited by matching efficiency or logical conditions. Summary of the invention
[0005] The present invention provides a method, device and equipment for interactive query of automobile information, which solves the technical problem in the prior art that merchants usually have their own data display forms, and as the number of merchants increases, keyword search or sequential condition search is limited by matching efficiency or logical conditions, it is easy to cause the search flexibility and query efficiency to be further reduced.
[0006] A first aspect of the present invention provides an automobile information interactive query method, which is applied to an information interactive query platform, wherein the information interactive query platform includes a client and a back-end server, and the method includes:
[0007] In response to the operation instruction collected by the client, multiple target condition components are selected from the condition component library to construct a retrieval condition graph;
[0008] When the client receives the submit instruction, the retrieval condition graph is verified by the client;
[0009] If the verification is determined to be passed, the client sends the search condition graph to the backend server, and the backend server generates at least one conditional search queue according to the search condition graph;
[0010] The back-end server searches a preset information database according to each of the conditional search queues to generate information results corresponding to each of the conditional search queues;
[0011] The backend server uses all the information results to generate a result list and returns it to the client for rendering and display.
[0012] Optionally, the method further comprises:
[0013] Receive basic information data uploaded by multiple automobile information terminals respectively, and create access registration tables corresponding to each automobile information terminal respectively;
[0014] Classifying the basic information data according to preset information types to obtain a variety of intermediate information data and constructing corresponding intermediate information tables respectively;
[0015] Filtering the intermediate information data in each of the intermediate information tables according to the preset field names to generate a field information table;
[0016] Respectively establish associations among the access registration table, the intermediate information table, and the field information table to obtain a plurality of target information association tables;
[0017] An information database is constructed using all of the field information tables and the target information association table.
[0018] Optionally, the access registration table includes an access application ID; and the step of respectively establishing associations among the access registration table, the intermediate information table, and the field information table to obtain multiple target information association tables includes:
[0019] Create multiple initial information association tables;
[0020] Calculate the hash value corresponding to the access application ID;
[0021] Selecting an intermediate information association table from the plurality of initial information association tables according to the hash value;
[0022] Obtain the intermediate information ID corresponding to the intermediate information table, and obtain the field information ID corresponding to the field information table;
[0023] The intermediate information ID, the field information ID and the access application ID are loaded into the intermediate information association table respectively to obtain a target information association table.
[0024] Optionally, when the client receives the submit instruction, the step of verifying the search condition graph by the client includes:
[0025] When the client receives the submit instruction, the client traverses the search condition graph to determine whether there is an unconnected target condition component in the search condition graph;
[0026] If not, query whether there is any unadded attribute value in each of the target condition components;
[0027] If not, it is determined that the search condition graph verification has passed;
[0028] If there are unconnected target condition components in the search condition graph, or if there are unadded attribute values in any of the target condition components, it is determined that the search condition graph verification has failed, and an editing prompt is generated.
[0029] Optionally, if the verification is determined to be passed, the step of sending the search condition graph to the backend server through the client, and generating at least one conditional search queue according to the search condition graph through the backend server includes:
[0030] If the verification is determined to be successful, the search condition graph is sent to the back-end server via the client;
[0031] Extracting connection information between two target condition components from the search condition graph through the back-end server; the target condition components include component node IDs;
[0032] Creating conditional nodes corresponding to the component node IDs and connecting them according to the connection information to obtain a conditional search tree;
[0033] The conditional search tree is traversed to generate at least one conditional search queue.
[0034] Optionally, the method further comprises:
[0035] Traversing each of the conditional search queues to determine whether there is a same node type in the same conditional search queue;
[0036] If yes, the conditional search queue is deleted, and a search link repetition prompt is returned to the client;
[0037] If not, the conditional retrieval queue is retained.
[0038] Optionally, the conditional search queue includes a plurality of queue nodes, each of which has a queue node ID; the step of searching a preset information database according to each of the conditional search queues through the back-end server to generate information results corresponding to each of the conditional search queues includes:
[0039] The back-end server uses each queue node ID as a primary key to search each field information table in a preset information database to determine whether there is a first key value corresponding to the queue node ID;
[0040] If it exists, obtaining the first key value from the field information table;
[0041] If it does not exist, searching the target information association table according to the field information ID corresponding to the field information table, determining the corresponding intermediate information table and obtaining the second key value from the intermediate information table according to the queue node ID;
[0042] After all of the first key values and / or the second key values are obtained, the intersection of all of the first key values and / or the second key values is determined to obtain the information results corresponding to the conditional search queue.
[0043] Optionally, the information database includes a cache library; before executing the step of searching each of the field information tables in the preset information database by the back-end server using the queue node ID corresponding to each queue node as the primary key to determine whether there is a first key value corresponding to the queue node ID, it also includes:
[0044] Searching the cache storehouse by the back-end server according to each of the conditional search queues, and determining whether there is a cache queue in the cache storehouse that is the same as the conditional search queue;
[0045] If it exists, obtaining the cache result corresponding to the cache queue from the cache library as the information result corresponding to the conditional search queue;
[0046] If not present, the conditional retrieval queue is split into multiple queue nodes.
[0047] A second aspect of the present invention provides an automobile information interactive query device, which is applied to an information interactive query platform. The information interactive query platform includes a client and a back-end server. The device includes:
[0048] A retrieval condition graph construction module, configured to respond to the operation instruction collected by the client and select multiple target condition components from the condition component library to construct a retrieval condition graph;
[0049] A retrieval condition graph verification module, used to verify the retrieval condition graph through the client when the client receives a submit instruction;
[0050] A conditional search queue generation module, used for sending the search condition graph to the back-end server through the client if the verification is passed, and generating at least one conditional search queue according to the search condition graph through the back-end server;
[0051] An information result retrieval module, used to search the preset information database according to each of the conditional retrieval queues through the back-end server, and generate information results corresponding to each of the conditional retrieval queues;
[0052] A result display module is used to generate a result list using all the information results through the back-end server and return it to the client for rendering and display.
[0053] The third aspect of the present invention provides an electronic device, including a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the steps of the automobile information interactive query method as described in any one of the first aspect of the present invention.
[0054] It can be seen from the above technical solutions that the present invention has the following advantages:
[0055] The present invention responds to the operation instructions input by the user through the client of the information interactive query platform, selects multiple target condition components from the condition component library built into the client and constructs the corresponding retrieval condition graph; when the retrieval condition graph is constructed, if the submission instruction input by the user is received, the retrieval condition graph can be further verified through the client to determine whether there are unclear attribute values or connection relationship errors, etc. If the verification passes, the retrieval condition graph is sent to the back-end server, and at least one condition retrieval queue is generated by the candidate server according to the target condition components and their connection relationships in the retrieval condition graph, and then the information database is decelerated according to the condition retrieval queue to generate corresponding information results, and finally all information results are returned to the client in the form of a result list, and the client and the result list are used to render and display the visualized information results. Therefore, through the visual operation of the retrieval condition components and logical relationships, the retrieval efficiency and retrieval flexibility of users in retrieving automobile information are improved. BRIEF DESCRIPTION OF THE DRAWINGS
[0056] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.
[0057] Figure 1 A flowchart of a method for interactively querying automobile information provided by the first embodiment of the present invention;
[0058] Figure 2 A flowchart of a method for interactively querying automobile information provided by Embodiment 2 of the present invention;
[0059] Figure 3 A schematic diagram of a process of constructing a search condition graph provided by an embodiment of the present invention;
[0060] Figure 4 A schematic diagram of an information database construction process provided by an embodiment of the present invention;
[0061] Figure 5 A queue schematic diagram of a conditional search queue provided by an embodiment of the present invention;
[0062] Figure 6 This is a structural block diagram of a vehicle information interactive query device provided in Embodiment 3 of the present invention. DETAILED DESCRIPTION
[0063] The embodiments of the present invention provide a method, device and equipment for interactive query of automobile information, which are used to solve the technical problem in the prior art that merchants usually have their own data display forms, and as the number of merchants increases, keyword search or sequential condition search is limited by matching efficiency or logical conditions, it is easy to cause the search flexibility and query efficiency to be further reduced.
[0064] In order to make the purpose, features and advantages of the present invention more obvious and easy to understand, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the embodiments described below are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0065] See also Figure 1 , Figure 1 A flowchart of the steps of an automobile information interactive query method provided in Embodiment 1 of the present invention.
[0066] The present invention provides an automobile information interactive query method, which is applied to an information interactive query platform. The information interactive query platform includes a client and a back-end server. The method includes:
[0067] Step 101, in response to the operation instruction collected by the client, multiple target condition components are selected from the condition component library to construct a search condition graph;
[0068] Operation instructions refer to trigger instructions such as click, select, drag, connect and place entered by the user on the client, which are used to select multiple target conditional components from the conditional component library and edit the properties of each component and build connection relationships.
[0069] In an embodiment of the present invention, the user constructs a retrieval condition graph by inputting operation instructions on the client, such as dragging multiple target condition components in the condition component library of the client interface, and editing the attribute values and connection relationships corresponding to each target condition component in the interface.
[0070] Step 102, when the client receives the submit instruction, the client verifies the search condition graph;
[0071] When the user has finished editing the search condition graph, he or she may further input a submission instruction into the client. After the client receives the input submission instruction, the search condition graph is verified locally on the client to determine whether there are any unclear attribute values and / or unclear connection relationships in the search condition graph, and whether the verification passes.
[0072] Step 103: if the verification is determined to be successful, the client sends the search condition graph to the backend server, and the backend server generates at least one condition search queue according to the search condition graph;
[0073] In an example of the present invention, if the search condition graph does not have unclear attribute values or unclear connection relationships, the verification is determined to be passed. At this time, the search condition graph can be sent to the back-end server through the client, and the back-end server determines at least one condition search queue corresponding to the search condition graph according to the specific attribute values of the target search components in the search condition graph and the connection relationships between them.
[0074] It should be noted that the client in the embodiment of the present invention refers to consumers, personal user terminals, and display terminals set on the back-end server, such as mobile phones, computers, tablets, etc. The conditional search queue includes conditional nodes generated according to each target condition component, and there is a logical connection relationship between the conditional nodes.
[0075] Step 104, searching the preset information database according to each conditional search queue through the backend server, and generating information results corresponding to each conditional search queue;
[0076] The information database refers to a database that stores information data uploaded by multiple automobile information manufacturers. It can be specifically divided into a cache library and a non-cache library. The cache library is stored locally on the back-end server and is used to cache conditional retrieval queues and their information results with high search frequency. The non-cache library is used to store all information data uploaded by various automobile information manufacturers in the form of fields, such as articles, posters, videos or activities associated with each automobile series.
[0077] After the back-end server generates at least one conditional search queue according to the conditional search graph, each conditional search queue is parsed, and information results that meet each conditional search queue are retrieved from the information database.
[0078] Step 105, the backend server uses all the information results to generate a result list and returns it to the client for rendering and display.
[0079] After all information results are retrieved from the backend server, in order to facilitate visual viewing by users, all information results can be uniformly constructed into a result list and returned to the client. The client can render and display the result list to obtain a visual interface containing all information results.
[0080] In the embodiment of the present invention, the client of the information interactive query platform responds to the operation instruction input by the user, selects multiple target condition components from the condition component library built in the client, and constructs the corresponding retrieval condition graph; when the retrieval condition graph is constructed, if the submission instruction input by the user is received, the retrieval condition graph can be further verified by the client to determine whether there are unclear attribute values or connection errors, etc. If the verification is passed, the retrieval condition graph is sent to the back-end server, and at least one condition retrieval queue is generated by the candidate server according to the target condition components and their connection relationships in the retrieval condition graph, and then the information database is decelerated according to the condition retrieval queue to generate corresponding information results, and finally all information results are returned to the client in the form of a result list, and the client and the result list are used to render and display the visualized information results. Thus, through the visual operation of the retrieval condition components and logical relationships, the retrieval efficiency and retrieval flexibility of users in searching for automobile information are improved.
[0081] See also Figure 2 , Figure 2 This is a flowchart of the steps of a method for interactive query of automobile information provided in Embodiment 2 of the present invention.
[0082] The present invention provides an automobile information interactive query method, which is applied to an information interactive query platform. The information interactive query platform includes a client and a back-end server. The method includes:
[0083] Step 201, in response to the operation instruction collected by the client, multiple target condition components are selected from the condition component library to construct a search condition graph;
[0084] In an embodiment of the present invention, a user may input an operation instruction in a client to select multiple target condition components from a condition component library in a client interface, and obtain a search condition graph by editing the attribute values of each target condition component and constructing a connection relationship.
[0085] like Figure 3 As shown, a schematic diagram of the construction process of a retrieval condition graph according to an embodiment of the present invention is shown.
[0086] In one example of the present invention, the condition component library can display multiple target condition components with higher usage frequencies in the top bar, while other target condition components with lower usage frequencies can be queried through query buttons, and the retrieval condition graph can also be reset through a reset button.
[0087] Each search condition component has four attribute values: 1. Component node ID, used to determine the position of the search condition component in the condition search graph. 2. Node type, used to determine which search condition it is. 3. Condition value, used to respond to user input to set the condition threshold. 4. Comparison logic: The default is equal to. Some conditions can have range queries, such as price, date, etc., in which case you can choose comparison logic such as greater than or less than. When the mouse hovers over a condition component, its optional values will be displayed.
[0088] Optionally, each conditional component in the conditional component library may also use different colors to distinguish the node types corresponding to each conditional component.
[0089] Step 202, when the client receives the submission instruction, the client verifies the search condition graph;
[0090] Optionally, step 202 may include the following sub-steps:
[0091] When the client receives the submit instruction, the client traverses the search condition graph to determine whether there is an unconnected target condition component in the search condition graph;
[0092] If not, check whether there are any unadded attribute values in each target condition component;
[0093] If not, it is determined that the search condition graph verification has passed;
[0094] If there are unconnected target condition components in the search condition graph, or if there are unadded attribute values in any target condition component, the search condition graph is determined to have failed verification, and an editing prompt is generated.
[0095] In an embodiment of the present invention, after the retrieval condition graph is constructed, if a submission instruction input by the user is further received, the retrieval condition graph can be traversed through the client to determine whether each target condition component therein is not connected. If not, it can be further queried whether each target condition component has an unadded attribute value. If not, it is determined that the retrieval condition graph has passed the verification.
[0096] If there are unconnected target condition components in the search condition graph, or there are unadded attribute values in any target condition component, the search condition graph is determined to have failed verification, and an editing prompt is generated to wait for further editing by the user.
[0097] In one example of the present invention, before the back-end server performs the initial retrieval of the retrieval condition graph, it can also construct a corresponding information database based on the basic information data uploaded by the automobile information terminal.
[0098] Optionally, the method may further include the following steps S11-S15:
[0099] S11, receiving basic information data uploaded by multiple automobile information terminals respectively, and creating access registration tables corresponding to each automobile information terminal respectively;
[0100] S12, classifying the basic information data according to the preset information type, obtaining a variety of intermediate information data and constructing corresponding intermediate information tables respectively;
[0101] S13, filtering the intermediate information data in each intermediate information table according to the preset field name to generate a field information table;
[0102] See also Figure 4 , Figure 4 A schematic diagram of an information database construction process of this embodiment is shown.
[0103] In this embodiment, the backend server can receive basic information data uploaded by multiple automobile information terminals such as automobile manufacturers and dealers, and the content may include but is not limited to vehicle series data, vehicle model data, and related articles, posters, videos, and activities, etc. At the same time, it responds to the access of each automobile information terminal, allocates the corresponding access application ID, access application key and access name of each automobile information terminal, and creates corresponding access registration tables.
[0104] In addition, the input basic information data can be classified according to the cluster information type to obtain a variety of intermediate information data and create corresponding intermediate information tables. For example, if automobile manufacturer A includes B series, C series and D series, corresponding intermediate information tables can be generated for each series. Then, the intermediate information data is filtered according to multiple field names set by the present invention, such as access name, alias, English name, etc., to obtain intermediate information data that meets the requirements and generate a field information table.
[0105] S14, respectively establish associations among the access registration table, the intermediate information table, and the field information table to obtain multiple target information association tables;
[0106] Further, the access registration table includes the access application ID, and S14 may include the following sub-steps:
[0107] Create multiple initial information association tables;
[0108] Calculate the hash value corresponding to the access application ID;
[0109] Selecting an intermediate information association table from multiple initial information association tables according to a hash value;
[0110] Get the intermediate information ID corresponding to the intermediate information table, and get the field information ID corresponding to the field information table;
[0111] The intermediate information ID, field information ID and access application ID are loaded into the intermediate information association table respectively to obtain the target information association table.
[0112] In an embodiment of the present invention, multiple initial information association tables can be created on the backend server, and the hash values corresponding to the access application IDs corresponding to the various automobile information terminals can be calculated respectively. An intermediate information association table can be selected from the multiple initial information association tables according to the hash values, and the intermediate information ID corresponding to the intermediate information table and the field information ID corresponding to the field information table can be obtained. The intermediate information ID, the field information ID and the access application ID can be loaded into the intermediate information association table respectively to obtain the target information association table. Please refer to Figure 4 .
[0113] S15. Use all field information tables and target information association tables to build an information database.
[0114] In the embodiment of the present invention, the information database is constructed by using the all-field information table and the target information association table.
[0115] It should be noted that during the client's information query process, the field information table is usually used for query. If the required field does not exist in the field information table, the corresponding intermediate information table can be further queried through the target information association table, thereby obtaining the corresponding information from the intermediate information table.
[0116] Step 203, if the verification is determined to be successful, the search condition graph is sent to the backend server via the client;
[0117] In the embodiment of the present invention, if the verification is determined to be passed, the search condition graph may be sent to the backend server via the client.
[0118] Specifically, the retrieval condition graph sent by the client to the backend server may include but is not limited to the following data: First, the information (connection information) of each target condition node includes node id, condition type, condition threshold, and condition logic. It is obtained by traversing all components of the retrieval condition style in the condition retrieval graph input box. Second, the connection status of the target condition node (condition node), which includes two parts: the former node id and the latter node id (by default, the target condition node at a high position flows to the target condition node at a low position).
[0119] Step 204, extracting connection information between target condition components from the search condition graph through the backend server; the target condition components include component node IDs;
[0120] In an example of the present invention, after the backend server obtains the retrieval condition graph, it can extract the connection information between two target condition components and the component node ID corresponding to each target condition component.
[0121] Step 205, creating conditional nodes corresponding to the IDs of the component nodes and connecting them according to the connection information to obtain a conditional search tree;
[0122] In an example of the present invention, corresponding condition nodes may be created according to the IDs of the component nodes, and connected according to the connection information, thereby obtaining a conditional search tree.
[0123] In the specific implementation, first find the root node id from the conditional node data (the node that is not in the post-position in the conditional node data of the conditional search graph), find the corresponding node in the connection information according to the node id, and build the root node of the conditional search tree. Then traverse the conditional nodes to find the child nodes of the root node. Due to the characteristics of the multi-branch tree, a parent node may have multiple child nodes. Therefore, it is necessary to record the node for subsequent backtracking. The backtracking algorithm first finds a path from the root node to the leaf, and then backtracks to see if the parent node of the node has other leaf nodes. If so, add them to the tree and continue to move down. If not, backtrack to the grandparent node of the previous layer.
[0124] Step 206, traverse the conditional search tree to generate at least one conditional search queue;
[0125] In the embodiment of the present invention, at least one conditional search queue may be generated by traversing each conditional node in the conditional search tree.
[0126] See also Figure 5 , Figure 5 A queue schematic diagram of a conditional search queue according to an embodiment of the present invention is shown.
[0127] In an embodiment of the present invention, a depth-first traversal + copy algorithm can be used to start recording from the root node. If the node has multiple child nodes, the existing links are copied and child nodes are added to the ends of the existing links respectively. The final number of conditional retrieval queues should be consistent with the number of leaf nodes in the conditional retrieval tree, thereby obtaining multiple conditional retrieval queues.
[0128] Optionally, before executing step 207, the method may further include the following steps S21-S23:
[0129] S21, traverse each conditional search queue to determine whether there is a same node type in the same conditional search queue;
[0130] S22: If yes, delete the conditional search queue and return a reminder of the search link duplication to the client;
[0131] S23. If not, retain the conditional retrieval queue.
[0132] In the specific implementation, the same node type may exist in the same condition retrieval queue due to user editing errors. For example, if a duplicate type of element appears in a link, it means that the user has input errors. Because the relationship between the parent and child nodes in the clue condition tree represents a logical AND relationship, if the parent node condition is that the car series is BMW, and the child node condition is that the car series is Audi, then the two must have no intersection, and the joint result of the two is empty. There is an empty set in the link, and it will be directly short-circuited because it is a logical AND.
[0133] To this end, each conditional search queue can be traversed to determine whether the same node type exists in the same conditional search queue. If so, the conditional search queue is deleted to return the search link to repeat the prompt to the client. If not, the conditional search queue is retained and waits for subsequent retrieval of information results.
[0134] Step 207, searching the preset information database according to each conditional search queue through the backend server, and generating information results corresponding to each conditional search queue;
[0135] Optionally, the conditional search queue includes multiple queue nodes, each of which has a queue node ID. Step 207 may include the following sub-steps S31-S34:
[0136] S31, using each queue node ID as a primary key to search each field information table in a preset information database through a backend server to determine whether there is a first key value corresponding to the queue node ID;
[0137] S32. If it exists, obtain the first key value from the field information table;
[0138] S33, if it does not exist, search the target information association table according to the field information ID corresponding to the field information table, determine the corresponding intermediate information table and obtain the second key value from the intermediate information table according to the queue node ID;
[0139] S34. After all the first key values and / or the second key values are obtained, the intersection of all the first key values and / or the second key values is determined to obtain the information result corresponding to the conditional search queue.
[0140] In the implementation of the present invention, each conditional search queue includes multiple queue nodes, each queue node is provided with a queue node ID, and each field information table in the information database is searched by the back-end server using each queue node ID as the primary key to determine whether the first key value corresponding to the queue node ID exists. If so, the first key value can be obtained from the field information table and output as the information result. If not, the target information association table is selected from multiple information association tables according to the field information ID corresponding to the field information table, the corresponding intermediate information table is determined, and the second key value is determined from the intermediate information table. After all the first key values and / or second key values are obtained, the intersection of all the first key values and / or second key values is determined to obtain the information result corresponding to the conditional search queue.
[0141] Furthermore, the information database includes a cache library; before executing S31, step 207 may also include the following sub-steps S41-S43:
[0142] S41, searching the cache according to each conditional search queue through the backend server, and determining whether there is a cache queue in the cache that is the same as the conditional search queue;
[0143] S42, if it exists, obtaining the cache result corresponding to the cache queue from the cache library as the information result corresponding to the conditional search queue;
[0144] S43. If it does not exist, split the conditional search queue into multiple queue nodes.
[0145] In another example of the present invention, the information database includes a cache library, and in order to further improve the retrieval efficiency of the information results, the cache library can be searched by the back-end server according to each conditional search queue, and it is determined whether there is an identical cache queue in the cache library. If so, the cache result corresponding to the cache queue can be obtained from the cache library as the information result. If not, the conditional search queue is split into multiple queue nodes, and step S31 is executed to retrieve all the information results.
[0146] Optionally, the cache library may update the cache queue according to a preset update cycle.
[0147] Step 208, the backend server uses all the information results to generate a result list and returns it to the client for rendering and display.
[0148] After all information results are retrieved from the backend server, in order to facilitate visual viewing by users, all information results can be uniformly constructed into a result list and returned to the client. The client can render and display the result list to obtain a visual interface containing all information results.
[0149] In another example of the present invention, the information results may be vehicle series data, activity data, etc. After the user receives the information results on the client, the user may further edit the activity data on the client, such as registering for an activity, etc., and return the information to the back-end server. The manufacturer obtains the activity registration information through the automobile information terminal, thereby informing the manufacturer that the user has registered for the activity and making a record of the information.
[0150] In the embodiment of the present invention, the client of the information interactive query platform responds to the operation instruction input by the user, selects multiple target condition components from the condition component library built in the client, and constructs the corresponding retrieval condition graph; when the retrieval condition graph is constructed, if the submission instruction input by the user is received, the retrieval condition graph can be further verified by the client to determine whether there are unclear attribute values or connection errors, etc. If the verification is passed, the retrieval condition graph is sent to the back-end server, and at least one condition retrieval queue is generated by the candidate server according to the target condition components and their connection relationships in the retrieval condition graph, and then the information database is decelerated according to the condition retrieval queue to generate corresponding information results, and finally all information results are returned to the client in the form of a result list, and the client and the result list are used to render and display the visualized information results. Thus, through the visual operation of the retrieval condition components and logical relationships, the retrieval efficiency and retrieval flexibility of users in searching for automobile information are improved.
[0151] See also Figure 6 , Figure 6 This is a structural block diagram of a vehicle information interactive query device provided in Embodiment 3 of the present invention.
[0152] A second aspect of the present invention provides an automobile information interactive query device, which is applied to an information interactive query platform. The information interactive query platform includes a client and a back-end server. The device includes:
[0153] The retrieval condition graph construction module 601 is used to respond to the operation instruction collected by the client and select multiple target condition components from the condition component library to construct a retrieval condition graph;
[0154] A retrieval condition graph verification module 602 is used to verify the retrieval condition graph through the client when the client receives the submission instruction;
[0155] The conditional search queue generation module 603 is used to send the search condition graph to the backend server through the client if the verification is passed, and generate at least one conditional search queue according to the search condition graph through the backend server;
[0156] The information result search module 604 is used to search the preset information database according to each condition search queue through the back-end server, and generate information results corresponding to each condition search queue;
[0157] The result display module 605 is used to generate a result list using all the information results through the backend server and return it to the client for rendering and display.
[0158] Optionally, the device further comprises:
[0159] An access registration form creation module is used to receive basic information data uploaded by multiple automobile information terminals respectively, and create access registration forms corresponding to each automobile information terminal respectively;
[0160] An intermediate information table generation module is used to classify basic information data according to preset information types, obtain multiple intermediate information data and construct corresponding intermediate information tables respectively;
[0161] A field information table generation module is used to filter the intermediate information data in each intermediate information table according to the preset field name to generate a field information table;
[0162] The association establishment module is used to establish associations between the access registration table, the intermediate information table and the field information table to obtain multiple target information association tables;
[0163] The information database construction module is used to construct the information database using all field information tables and target information association tables.
[0164] Optionally, the access registration table includes an access application ID; the association establishment module is specifically used for:
[0165] Create multiple initial information association tables;
[0166] Calculate the hash value corresponding to the access application ID;
[0167] Selecting an intermediate information association table from multiple initial information association tables according to a hash value;
[0168] Get the intermediate information ID corresponding to the intermediate information table, and get the field information ID corresponding to the field information table;
[0169] The intermediate information ID, field information ID and access application ID are loaded into the intermediate information association table respectively to obtain the target information association table.
[0170] Optionally, the search condition graph verification module 602 is specifically used for:
[0171] When the client receives the submit instruction, the client traverses the search condition graph to determine whether there is an unconnected target condition component in the search condition graph;
[0172] If not, check whether there are any unadded attribute values in each target condition component;
[0173] If not, it is determined that the search condition graph verification has passed;
[0174] If there are unconnected target condition components in the search condition graph, or if there are unadded attribute values in any target condition component, the search condition graph is determined to have failed verification, and an editing prompt is generated.
[0175] Optionally, the conditional search queue generating module 603 is specifically used for:
[0176] If the verification is passed, the search condition graph is sent to the backend server through the client;
[0177] Extracting connection information between target condition components from the search condition graph through the back-end server; the target condition components include component node IDs;
[0178] Create conditional nodes corresponding to each component node ID and connect them according to the connection information to obtain a conditional search tree;
[0179] Traverse the conditional search tree and generate at least one conditional search queue.
[0180] Optionally, the conditional search queue generating module 603 is further configured to:
[0181] Traverse each conditional search queue to determine whether there is the same node type in the same conditional search queue;
[0182] If yes, delete the conditional search queue and return a duplicate search link prompt to the client;
[0183] If not, the conditional retrieval queue is retained.
[0184] Optionally, the conditional search queue includes multiple queue nodes, each of which has a queue node ID; the information result search module 604 is specifically used for:
[0185] The backend server uses each queue node ID as a primary key to search each field information table in the preset information database to determine whether there is a first key value corresponding to the queue node ID;
[0186] If it exists, get the first key value from the field information table;
[0187] If it does not exist, search the target information association table according to the field information ID corresponding to the field information table, determine the corresponding intermediate information table and obtain the second key value from the intermediate information table according to the queue node ID;
[0188] After all the first key values and / or the second key values are obtained, the intersection of all the first key values and / or the second key values is determined to obtain the information result corresponding to the conditional search queue.
[0189] Optionally, the information database includes a cache library; the information result retrieval module 604 is also specifically used for:
[0190] The backend server searches the cache according to each conditional search queue to determine whether there is a cache queue in the cache that is the same as the conditional search queue;
[0191] If it exists, the cache result corresponding to the cache queue is obtained from the cache library as the information result corresponding to the conditional search queue;
[0192] If it does not exist, the conditional retrieval queue will be split into multiple queue nodes.
[0193] An embodiment of the present invention provides an electronic device, including a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the steps of the automobile information interactive query method as described in any embodiment of the present invention.
[0194] Those skilled in the art can clearly understand that, to ensure the convenience and simplicity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.
[0195] In the several embodiments provided by the present invention, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.
[0196] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0197] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0198] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.
[0199] As described above, the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features thereof may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. A method for interactive query of automobile information, characterized in that: Applied to an information interactive query platform, the information interactive query platform includes a client and a back-end server, and the method includes: In response to the operation instruction collected by the client, multiple target condition components are selected from the condition component library to construct a retrieval condition graph; When the client receives the submit instruction, the retrieval condition graph is verified by the client; If the verification is determined to be passed, the client sends the search condition graph to the backend server, and the backend server generates at least one conditional search queue according to the search condition graph; The back-end server searches a preset information database according to each of the conditional search queues to generate information results corresponding to each of the conditional search queues; The back-end server generates a result list using all the information results and returns it to the client for rendering and display; The method further comprises: Receive basic information data uploaded by multiple automobile information terminals respectively, and create access registration tables corresponding to each automobile information terminal respectively; Classifying the basic information data according to preset information types to obtain a variety of intermediate information data and constructing corresponding intermediate information tables respectively; Filtering the intermediate information data in each of the intermediate information tables according to the preset field names to generate a field information table; Respectively establish associations among the access registration table, the intermediate information table, and the field information table to obtain a plurality of target information association tables; Using all the field information tables and the target information association table to construct an information database; The conditional search queue includes a plurality of queue nodes, each of which has a queue node ID; the step of searching a preset information database according to each of the conditional search queues by the back-end server to generate information results corresponding to each of the conditional search queues includes: The back-end server uses each queue node ID as a primary key to search each field information table in a preset information database to determine whether there is a first key value corresponding to the queue node ID; If it exists, obtaining the first key value from the field information table; If it does not exist, searching the target information association table according to the field information ID corresponding to the field information table, determining the corresponding intermediate information table and obtaining the second key value from the intermediate information table according to the queue node ID; After all of the first key values and / or the second key values are obtained, the intersection of all of the first key values and / or the second key values is determined to obtain the information results corresponding to the conditional search queue.
2. The method according to claim 1, characterized in that The access registration table includes an access application ID; the steps of respectively establishing associations among the access registration table, the intermediate information table, and the field information table to obtain multiple target information association tables include: Create multiple initial information association tables; Calculate the hash value corresponding to the access application ID; Selecting an intermediate information association table from the plurality of initial information association tables according to the hash value; Obtain the intermediate information ID corresponding to the intermediate information table, and obtain the field information ID corresponding to the field information table; The intermediate information ID, the field information ID and the access application ID are loaded into the intermediate information association table respectively to obtain a target information association table.
3. The method according to claim 1, characterized in that When the client receives the submit instruction, the step of verifying the search condition graph by the client includes: When the client receives the submit instruction, the client traverses the search condition graph to determine whether there is an unconnected target condition component in the search condition graph; If not, query whether there is any unadded attribute value in each of the target condition components; If not, it is determined that the search condition graph verification has passed; If there are unconnected target condition components in the search condition graph, or if there are unadded attribute values in any of the target condition components, it is determined that the search condition graph verification has failed, and an editing prompt is generated.
4. The method according to claim 1, characterized in that: If the verification is determined to be passed, the step of sending the search condition graph to the backend server through the client, and generating at least one conditional search queue according to the search condition graph through the backend server includes: If the verification is determined to be successful, the search condition graph is sent to the back-end server via the client; Extracting connection information between two target condition components from the search condition graph through the back-end server; the target condition components include component node IDs; Creating conditional nodes corresponding to the component node IDs and connecting them according to the connection information to obtain a conditional search tree; The conditional search tree is traversed to generate at least one conditional search queue.
5. The method according to claim 4, characterized in that The method further comprises: Traversing each of the conditional search queues to determine whether there is a same node type in the same conditional search queue; If yes, the conditional search queue is deleted, and a search link repetition prompt is returned to the client; If not, the conditional retrieval queue is retained.
6. The method according to claim 2, characterized in that The information database includes a cache library; before executing the step of searching each field information table in the preset information database by using the queue node ID corresponding to each queue node as the primary key through the back-end server to determine whether there is a first key value corresponding to the queue node ID, it also includes: Searching the cache storehouse by the back-end server according to each of the conditional search queues, and determining whether there is a cache queue in the cache storehouse that is the same as the conditional search queue; If it exists, obtaining the cache result corresponding to the cache queue from the cache library as the information result corresponding to the conditional search queue; If not present, the conditional retrieval queue is split into multiple queue nodes.
7. An automobile information interactive query device, characterized in that: Applied to an information interactive query platform, the information interactive query platform includes a client and a back-end server, and the device includes: A retrieval condition graph construction module, configured to respond to the operation instruction collected by the client and select multiple target condition components from the condition component library to construct a retrieval condition graph; A retrieval condition graph verification module, used to verify the retrieval condition graph through the client when the client receives a submit instruction; A conditional search queue generation module, used for sending the search condition graph to the backend server through the client if the verification is passed, and generating at least one conditional search queue according to the search condition graph through the backend server; An information result retrieval module, used to search the preset information database according to each of the conditional retrieval queues through the back-end server, and generate information results corresponding to each of the conditional retrieval queues; A result display module, used to generate a result list using all the information results through the backend server and return it to the client for rendering and display; The device also includes: An access registration form creation module is used to receive basic information data uploaded by multiple automobile information terminals respectively, and create access registration forms corresponding to each automobile information terminal respectively; An intermediate information table generating module, used to classify the basic information data according to preset information types, obtain multiple intermediate information data and construct corresponding intermediate information tables respectively; A field information table generation module, used to filter the intermediate information data in each intermediate information table according to a preset field name to generate a field information table; An association establishment module, used to establish associations between the access registration table, the intermediate information table and the field information table, respectively, to obtain multiple target information association tables; An information database construction module, used to construct an information database using all the field information tables and the target information association table; The conditional search queue includes a plurality of queue nodes, each of which has a queue node ID; the information result search module is specifically used for: The back-end server uses each queue node ID as a primary key to search each field information table in a preset information database to determine whether there is a first key value corresponding to the queue node ID; If it exists, obtaining the first key value from the field information table; If it does not exist, searching the target information association table according to the field information ID corresponding to the field information table, determining the corresponding intermediate information table and obtaining the second key value from the intermediate information table according to the queue node ID; After all of the first key values and / or the second key values are obtained, the intersection of all of the first key values and / or the second key values is determined to obtain the information results corresponding to the conditional search queue.
8. An electronic device, characterized in that: It comprises a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the steps of the automobile information interactive query method as described in any one of claims 1 to 6.
Citation Information
Patent Citations
A method and system for complex data retrieval based on a custom search condition tree
CN109033157A
Data association analysis method and device, computer equipment and storage medium
CN113688288A