CN112364246A - Data searching method and device, computer equipment and storage medium - Google Patents
Data searching method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112364246A CN112364246A CN202011306363.XA CN202011306363A CN112364246A CN 112364246 A CN112364246 A CN 112364246A CN 202011306363 A CN202011306363 A CN 202011306363A CN 112364246 A CN112364246 A CN 112364246A
- Authority
- CN
- China
- Prior art keywords
- search
- parameter
- data
- identifier
- cache unit
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000001914 filtration Methods 0.000 claims description 46
- 239000012634 fragment Substances 0.000 claims description 17
- 230000002159 abnormal effect Effects 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 12
- 230000004927 fusion Effects 0.000 claims description 9
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000012545 processing Methods 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 3
- 238000013467 fragmentation Methods 0.000 description 2
- 238000006062 fragmentation reaction Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000000638 solvent extraction Methods 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012549 training Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9538—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
- G06F16/9566—URL specific, e.g. using aliases, detecting broken or misspelled links
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/957—Browsing optimisation, e.g. caching or content distillation
- G06F16/9574—Browsing optimisation, e.g. caching or content distillation of access to content, e.g. by caching
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/24—Classification techniques
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The application relates to the technical field of data processing, and discloses a data search method, a data search device, computer equipment and a storage medium, wherein the method comprises the following steps: acquiring parameter information input by a user, and caching the parameter information to a first cache unit or a second cache unit according to a parameter format of the parameter information; determining at least one search identifier corresponding to the parameter information in the search page according to the binary tree index; determining a first search parameter in the first cache unit according to the search identifier, and determining a second search parameter in the second cache unit according to the search identifier; obtaining a search condition parameter according to the first search parameter and the second search parameter; and searching according to the search condition parameters to obtain a search result corresponding to the search identifier. The method and the device can determine the search condition parameters of the search page through the preset cache unit and the search identifier in the search page to perform automatic search, reduce the time spent on search and improve the search efficiency.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a data search method and apparatus, a computer device, and a storage medium.
Background
With the rapid development of internet technology, mass data is flooded on a network, and users increasingly use a search technology to obtain data information required by themselves from the mass data on the network. For example, a user may input an interested keyword as a search parameter in a search box of a page to search for data needed by the user. In the prior art, the user needs to input the parameters to be searched by himself to realize the search, which takes much time and causes low search efficiency.
Therefore, how to improve the search efficiency becomes an urgent problem to be solved.
Disclosure of Invention
In view of the above, it is necessary to provide a data search method, apparatus, computer device and storage medium, which can determine the search condition parameters of the search page through a preset cache unit and a search identifier in the search page, and perform automatic search according to the search condition parameters to obtain a search result, so that the search can be implemented without the user inputting the parameters to be searched by himself, thereby reducing the time taken for the search and improving the search efficiency.
A first aspect of the present invention provides a data search method, including:
acquiring parameter information input by a user, and caching the parameter information to a first cache unit or a second cache unit according to a parameter format of the parameter information;
determining at least one search identifier corresponding to the parameter information in a search page according to the binary tree index;
determining a first search parameter in the first cache unit according to the at least one search identifier, and determining a second search parameter in the second cache unit according to the at least one search identifier;
obtaining a search condition parameter according to the first search parameter and the second search parameter;
and searching according to the search condition parameters to obtain a search result corresponding to the at least one search identifier.
According to an optional embodiment of the present invention, the determining, according to the binary tree index, at least one search identifier corresponding to the parameter information in the search page includes:
traversing the binary tree index by adopting a priority queue from a root node of the binary tree index until a traversal termination condition is reached;
inserting the traversed nodes into the priority queue, and sequencing the priority queue based on the distance between the parameter information and the differential characteristics represented by the traversed nodes;
and determining the search identifier corresponding to the first leaf node ordered in the priority queue as the search identifier of the search page.
According to an optional embodiment of the present invention, the determining a first search parameter in the first cache unit according to the at least one search identifier and determining a second search parameter in the second cache unit according to the at least one search identifier comprises:
acquiring a preset first search comparison table, comparing the at least one search identifier with all URL-format parameter data stored in the first cache unit one by one, and determining the URL-format parameter data matched with the at least one search identifier in the first search comparison table as a first search parameter;
and acquiring a preset second search comparison table, comparing the at least one search identifier with all parameter data in the params format stored in the second cache unit one by one, and determining the parameter data in the params format matched with the at least one search identifier in the second search comparison table as a second search parameter.
According to an optional embodiment of the present invention, the determining a first search parameter in the first cache unit according to the at least one search identifier and determining a second search parameter in the second cache unit according to the at least one search identifier further comprises:
when the first search parameter cannot be determined in the first cache unit according to the at least one search identifier, and/or when the second search parameter cannot be determined in the second cache unit according to the at least one search identifier, generating a missing prompt according to a preset prompt rule;
when acquiring search parameters input by a user according to the missing prompt, determining a parameter format corresponding to the search parameters;
when the parameter format is a first format, storing the search parameter to the first cache unit; and when the parameter format is a second format, storing the search parameter to the second cache unit.
According to an optional embodiment of the present invention, the obtaining a search condition parameter according to the first search parameter and the second search parameter includes:
slicing the first search parameter to obtain a preset number of first sliced data packets, and slicing the second search parameter to obtain a preset number of second sliced data packets;
and performing data splicing on the first fragment data packet and the second fragment data packet by using a data splicing server to obtain a search condition parameter.
According to an optional embodiment of the present invention, the fragmenting the first search parameter to obtain a preset number of first fragmented packets, and fragmenting the second search parameter to obtain a preset number of second fragmented packets include:
determining a search item corresponding to the at least one search identifier;
fragmenting the first search parameter according to each search item through a greedy algorithm to obtain a preset number of first fragmented data packets;
and fragmenting the second search parameter according to each search item through a greedy algorithm to obtain a preset number of second fragmented data packets.
According to an optional embodiment of the present invention, the obtaining a search condition parameter according to the first search parameter and the second search parameter includes:
filtering abnormal parameter data in the first search parameter by using a pre-trained data filtering model to obtain a first filtering parameter;
filtering abnormal parameter data in the second search parameter by using the pre-trained data filtering model to obtain a second filtering parameter;
and performing data fusion on the first filtering parameter and the second filtering parameter by adopting a Kalman filtering mode to obtain a search condition parameter.
A second aspect of the present invention provides a data search apparatus, the apparatus comprising:
the parameter acquisition module is used for acquiring parameter information input by a user and caching the parameter information to a first cache unit or a second cache unit according to the parameter format of the parameter information;
the identification determining module is used for determining at least one search identification corresponding to the parameter information in the search page according to the binary tree index;
a parameter determining module, configured to determine a first search parameter in the first cache unit according to the at least one search identifier, and determine a second search parameter in the second cache unit according to the at least one search identifier;
the parameter generating module is used for obtaining a search condition parameter according to the first search parameter and the second search parameter;
and the data searching module is used for searching according to the searching condition parameters to obtain a searching result corresponding to the at least one searching identifier.
A third aspect of the invention provides a computer device comprising a memory and a processor; the memory is used for storing a computer program; the processor is configured to implement the data search method as described above when executing the computer program.
A fourth aspect of the present invention provides a computer-readable storage medium storing a computer program which, when executed by a processor, implements the data search method as described above.
The embodiment of the application discloses a data searching method, a data searching device, computer equipment and a storage medium, wherein parameter information input by a user is obtained, and the parameter information is cached to a first cache unit or a second cache unit according to a parameter format of the parameter information; determining at least one search identifier corresponding to the parameter information in a search page according to the binary tree index; determining a first search parameter in the first cache unit according to the at least one search identifier, and determining a second search parameter in the second cache unit according to the at least one search identifier; obtaining a search condition parameter according to the first search parameter and the second search parameter; and searching according to the search condition parameters to obtain a search result corresponding to the at least one search identifier. The method and the device can determine the search condition parameters of the search page through the preset cache unit and the search identifier in the search page, and automatically search according to the search condition parameters to obtain the search result, so that the search can be realized without inputting the parameters to be searched by the user, the time spent on searching is reduced, and the search efficiency is improved.
Drawings
Fig. 1 is a schematic flow chart of a data search method according to an embodiment of the present invention;
FIG. 2 is a sub-flow diagram illustrating the determination of at least one search identifier corresponding to the parameter information in a search page according to a binary tree index shown in FIG. 1;
FIG. 3 is a sub-flow diagram illustrating the determining of a first search parameter in the first cache unit according to the at least one search identifier and the determining of a second search parameter in the second cache unit according to the at least one search identifier in FIG. 1;
FIG. 4 is a schematic view of a sub-process for obtaining the search condition parameter according to the first search parameter and the second search parameter in FIG. 1;
FIG. 5 is a schematic view of another sub-process for obtaining the search condition parameter according to the first search parameter and the second search parameter in FIG. 1;
FIG. 6 is a schematic block diagram of a data search apparatus according to an embodiment of the present invention;
fig. 7 is a schematic block diagram of a structure of a computer device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The flow diagrams depicted in the figures are merely illustrative and do not necessarily include all of the elements and operations/steps, nor do they necessarily have to be performed in the order depicted. For example, some operations/steps may be decomposed, combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
The embodiment of the application provides a data search method, a data search device, computer equipment and a computer readable storage medium. The data searching method can be applied to terminal equipment or a server, the terminal equipment can be electronic equipment such as a mobile phone, a tablet computer, a notebook computer, a desktop computer, a personal digital assistant and wearable equipment, and the server can be a single server or a server cluster consisting of a plurality of servers. The following explanation will be given taking an example in which the data search method is applied to a server.
Some embodiments of the present application will be described in detail below with reference to the accompanying drawings. The embodiments described below and the features of the embodiments can be combined with each other without conflict.
Referring to fig. 1, fig. 1 is a schematic flow chart of a data searching method according to an embodiment of the present application.
As shown in fig. 1, the data searching method specifically includes steps S11 to S15, and the order of the steps in the flowchart may be changed or some of the steps may be omitted according to different requirements.
S11, acquiring the parameter information input by the user, and caching the parameter information to the first cache unit or the second cache unit according to the parameter format of the parameter information.
In some embodiments, after the parameter data is obtained, the parameter data is cached to the first cache unit or the second cache unit according to the type of the parameter data. For example, the first cache unit is configured to cache parameter data in a Uniform Resource Locator (URL) format, and the second cache unit is configured to cache parameter data in a computer function (params) format.
In some embodiments, the parameter data may be obtained from user input, from a routing table generated by the system from a routing menu accessible to the system, and from a browser cache.
For example, parameter information input by a user is acquired, and when the parameter format of the parameter information is the URL format, the parameter information is cached to a first caching unit; for another example, the parameter information input by the user is acquired, and when the parameter format of the parameter information is the params format, the parameter information is cached to the second caching unit.
Exemplarily, the first cache unit includes a first search comparison table, and a search identifier corresponding to each URL-formatted parameter data is recorded in the first search comparison table; the second cache unit comprises a second search comparison table, and the second search comparison table records search identifiers corresponding to the parameter data in the params format.
When a user adds or modifies parameter information according to the self requirement, the parameter information input by the user is obtained, the parameter format corresponding to the parameter information is determined, and the parameter information is stored according to the parameter format. For example, when the parameter format is the URL format, the parameter information is stored in the first cache unit, and when the parameter format is the params format, the parameter information is stored in the second cache unit.
When the parameter format of the parameter information input by the user is the URL format and the first cache unit does not include the parameter information input by the user, the first search comparison table in the first cache unit is modified, for example, the parameter information input by the user and the search identifier corresponding to the parameter information input by the user are added to the first search comparison table. The search identifier can be set by a user in a customized way or automatically generated by the server according to parameter information input by the user.
And S12, determining at least one search identifier corresponding to the parameter information in the search page according to the binary tree index.
In some embodiments, a page picture of the search page is obtained, and features of the page picture are extracted from the page picture. And when the page picture is determined to have the binary tree index, traversing the binary tree index according to the characteristics of the page picture, and determining at least one search identifier in the search page.
In the invention, the search page comprises a plurality of search identifiers, a binary tree index is generated for the search identifiers meeting the preset identifier condition, and the search identifiers can be inquired based on the binary tree index when being inquired subsequently. For example, when the search identifiers with the search frequency greater than or equal to the search frequency threshold are screened from the search page, a binary tree index is generated for the screened search identifiers. For the search identifiers with the search frequency smaller than the search frequency threshold, the binary tree index is not generated until the search frequency reaches the search frequency threshold. The binary tree index is established for the search identifiers included in the search page, so that the subsequent search of the search identifiers is facilitated, the search identifiers of all the search identifiers do not need to be compared, the speed of determining the search identifiers is greatly improved, and the search efficiency of data search is improved.
In some embodiments, as shown in fig. 2, the determining, according to the binary tree index, at least one search identifier corresponding to the parameter information in the search page specifically includes steps S121 to S123.
S121, traversing the binary tree index by adopting a priority queue from a root node of the binary tree index until a traversal termination condition is reached;
s122, inserting the traversed nodes into the priority queue, and sequencing the priority queue based on the distance between the parameter information and the differential characteristics represented by the traversed nodes;
s123, determining the search identifier corresponding to the first leaf node ordered in the priority queue as the search identifier of the search page.
Illustratively, when it is determined that the page picture has the binary tree index, a priority queue is used to traverse the binary tree index from a root node of the binary tree index until a traversal termination condition is reached, the traversed node is inserted into the priority queue, the priority queue is sorted based on a distance between a feature of the page picture and a differential feature represented by the traversed node, and a search identifier corresponding to a leaf node sorted at the first in the priority queue is determined as a search identifier of the search page.
The priority queue has a behavior characteristic of the highest first in (first out), that is, in the priority queue, elements are given priority, and when the elements are accessed, the elements with the highest priority are dequeued first. For example, a priority queue is generated by the search identifier, and the search identifier is given priority according to the search condition of the user. The traversal termination condition may be set according to a user's requirement, for example, when traversing to the search identifier with the sixth priority in the priority queue, that is, when traversing to the search identifier with the sixth priority in the priority queue, it is determined that the traversal termination condition is reached.
And querying based on the distance between the features of the page picture and the differential features represented by the traversed nodes, so that the search identification of the search page can be effectively determined, and the efficiency of data retrieval is improved. Meanwhile, all binary tree indexes can be prevented from being traversed by setting a traversal termination condition, the time for determining the search identifier of the search page is reduced, and the data retrieval efficiency is improved.
S13, determining a first search parameter in the first cache unit according to the at least one search identifier, and determining a second search parameter in the second cache unit according to the at least one search identifier.
Exemplarily, all the parameter data in the URL format stored in the first cache unit are compared one by one according to the at least one search identifier, and the parameter data in the URL format matching the at least one search identifier is determined as the first search parameter; and comparing all the parameter data in the params format stored in the second cache unit one by one according to the at least one search identifier, and determining the parameter data in the params format matched with the at least one search identifier as a second search parameter.
In some embodiments, as shown in fig. 3, the determining a first search parameter in the first cache unit according to the at least one search identifier and determining a second search parameter in the second cache unit according to the at least one search identifier specifically includes steps S131 and S132.
S131, obtaining a preset first search comparison table, comparing the at least one search identifier with all URL-formatted parameter data stored in the first cache unit one by one, and determining the URL-formatted parameter data matched with the at least one search identifier in the first search comparison table as a first search parameter.
For example, the first cache unit includes a first search comparison table, in which search identifiers corresponding to parameter data in each URL format are recorded, and the first search comparison table is queried to determine the parameter data in the URL format corresponding to the at least one search identifier, that is, to determine a first search parameter corresponding to the search identifier.
S132, obtaining a preset second search comparison table, comparing the at least one search identifier with all parameter data in params format stored in the second cache unit one by one, and determining the parameter data in params format matched with the at least one search identifier in the second search comparison table as a second search parameter.
Illustratively, the second cache unit includes a second search comparison table, where the second search comparison table records search identifiers corresponding to parameter data in a params format, and queries the second search comparison table to determine the parameter data in the params format corresponding to the at least one search identifier, that is, to determine a second search parameter corresponding to the search identifier.
In some embodiments, the determining a first search parameter in the first cache unit according to the at least one search identifier and determining a second search parameter in the second cache unit according to the at least one search identifier further comprises:
when the first search parameter cannot be determined in the first cache unit according to the at least one search identifier, and/or when the second search parameter cannot be determined in the second cache unit according to the at least one search identifier, generating a missing prompt according to a preset prompt rule;
when acquiring search parameters input by a user according to the missing prompt, determining a parameter format corresponding to the search parameters; when the parameter format is a first format, storing the search parameter to the first cache unit; and when the parameter format is a second format, storing the search parameter to the second cache unit.
When the first search parameter cannot be determined in the first cache unit according to the at least one search identifier, that is, when parameter data in a URL format matching the at least one search identifier does not exist in the first cache unit, and/or when the second search parameter cannot be determined in the second cache unit according to the at least one search identifier, that is, when parameter data in a params format matching the at least one search identifier does not exist in the second cache unit, the server generates a miss prompt according to a preset prompt rule, and prompts the user to input a corresponding search parameter. For example, when the parameter data in the URL format matching the at least one search identifier does not exist in the first cache unit, a prompt rule is generated and displayed on a terminal interface of a user, so that the user inputs the parameter data in the URL format matching the at least one search identifier.
In some embodiments, when the search parameter input by the user according to the missing prompt is acquired, the search parameter is stored according to the parameter format corresponding to the search parameter, and the first cache unit and/or the second cache unit is updated in time according to the search parameter input by the user, so that the rate of subsequently confirming the first search parameter and/or the second search parameter is increased, and the search rate of data search is increased.
And S14, obtaining a search condition parameter according to the first search parameter and the second search parameter.
Illustratively, the first search parameter and the second search parameter are used to obtain a search condition parameter according to a preset processing rule, where the preset processing rule may include data processing rules such as data splicing and data fusion.
In some embodiments, as shown in fig. 4, the obtaining a search condition parameter according to the first search parameter and the second search parameter includes:
s141a, slicing the first search parameter to obtain a preset number of first sliced data packets, and slicing the second search parameter to obtain a preset number of second sliced data packets;
s142, data splicing is carried out on the first fragment data packet and the second fragment data packet by using a data splicing server, and a search condition parameter is obtained.
After the first search parameter and the second search parameter corresponding to the search page are obtained, data fragmentation is performed on the first search parameter to obtain a preset number of first fragmented data packets, and data fragmentation is performed on the second search parameter to obtain a preset number of second fragmented data packets. In some embodiments, the predetermined number of first fragmented packets plus the predetermined number of second fragmented packets may be equal to the number of data splicing servers. The data splicing server is a server for splicing the search data in the fragmented data packet. That is, the number of the fragmented data packets is consistent with the number of the data splicing servers. Each data splicing server can acquire one fragment data packet for data splicing. Data splicing is an operation of integrating several data stored in different cells (tables) into one cell (table) in a vertical direction. And after each data splicing server acquires the fragment data packet, performing data splicing on the search data of the acquired fragment data packet to obtain a data splicing result.
And sending the first fragment data packet and the second fragment data packet to corresponding data splicing servers. For example, the preset number of first fragmented packets is 2, the preset number of second fragmented packets is 3, and the number of data splicing servers is 5. And sending the obtained 2 first fragment data packets and 3 second fragment data packets to corresponding data splicing servers, so that each data splicing server obtains one fragment data packet. Each data splicing server only needs to be responsible for corresponding data splicing tasks, and the problems that server congestion is caused and data splicing and storage processes are affected due to large server burden when the data volume of the searched data is huge are solved.
In some embodiments, the fragmenting the first search parameter to obtain a preset number of first fragmented packets, and fragmenting the second search parameter to obtain a preset number of second fragmented packets includes:
determining a search item corresponding to the at least one search identifier;
fragmenting the first search parameter according to each search item through a greedy algorithm to obtain a preset number of first fragmented data packets;
and fragmenting the second search parameter according to each search item through a greedy algorithm to obtain a preset number of second fragmented data packets.
In some embodiments, the number of search terms triggered on a search page is determined based on at least one search identifier on the search page. Then, by means of a greedy algorithm, based on the number of search items triggered by a search page, the first search parameter and the second search parameter are respectively fragmented to obtain a preset number of first fragmented data packets and a preset number of second fragmented data packets: and distributing the parameter data of the same search item into the same fragment data packet, and summarizing the fragment data packets to obtain the fragment data packets with the preset number. For example, parameter data of first search parameters of the same search item are distributed into the same fragmented data packet, and the fragmented data packets are summarized to obtain a preset number of first fragmented data packets; and distributing the parameter data of the second search parameters of the same search item into the same fragmented data packet, and summarizing the fragmented data packets to obtain a preset number of second fragmented data packets.
The basic idea of the greedy algorithm is to proceed step by step from a certain initial solution of the problem, and according to a certain optimization measure, each step is required to ensure that a local optimal solution can be obtained. Only one data is considered in each step, and the conditions meeting the local optimization are selected. When the next data and partial optimal solution are no longer feasible solutions to join together, the data is not added to the partial solution until all the data is enumerated, or the addition algorithm can no longer be stopped. And partitioning the first search parameter and the second search parameter respectively by utilizing greedy algorithm iterative computation, and ensuring that parameter data corresponding to the same search item is distributed into the same partitioned data packet, so that the data partitioning is more accurate, and the accuracy of data search is improved.
In some embodiments, as shown in fig. 5, the obtaining a search condition parameter according to the first search parameter and the second search parameter includes:
s141b, filtering abnormal parameter data in the first search parameters by using a pre-trained data filtering model to obtain first filtering parameters;
s142b, filtering abnormal parameter data in the second search parameters by using the pre-trained data filtering model to obtain second filtering parameters;
s143b, performing data fusion on the first filtering parameter and the second filtering parameter in a Kalman filtering mode to obtain a search condition parameter.
Wherein, the abnormal parameter data can be understood as: the data to be subjected to data fusion is parameter data having a large difference from the information represented by other data. Kalman filtering (Kalman filtering) is an algorithm that uses a linear system state equation to optimally estimate the state of a system by inputting and outputting observation data through the system. Since the observation data includes system noise and interference data, the optimal estimation can also be regarded as a filtering process. For example, before the parameter data are fused in different application scenarios by using a kalman filtering manner, parameters related to the kalman filtering algorithm may be set according to the type, format, interval, dimension, and other information of the parameter data to be fused, so as to adapt to the requirements of the application scenarios.
Exemplarily, a first search parameter can be obtained as first sample data, the first sample data includes a first classification label, the first sample data and the first classification label of the first sample data are input into a data filtering model, the data filtering model is trained, and the obtained data filtering model can learn the characteristics of abnormal parameter data from the overall angle of data, so that when the data filtering model is used for filtering the first search parameter, the abnormal parameter data in the first search parameter can be better filtered; the method comprises the steps of obtaining a first search parameter as first sample data, inputting the first sample data and a first classification label of the first sample data into a data filtering model, training the data filtering model, and enabling the obtained data filtering model to learn the characteristics of abnormal parameter data from the overall angle of data.
In some embodiments, the data filtering model may also be used as a model for classifying data, that is, a model for dividing data into normal parameter data and abnormal parameter data. Based on the above, when the data filtering model is applied to filter abnormal parameter data in the data to be fused, the data filtering model can divide the first search parameter and the second search parameter into two types, namely normal parameter data and abnormal parameter data, and the parameter data belonging to the abnormal parameter data in the first search parameter and the second search parameter can be filtered after the classification result is obtained.
And before the first search parameter and the second search parameter are subjected to data fusion in a Kalman filtering mode, filtering abnormal parameter data in the first search parameter and the second search parameter, so that a high-accuracy data fusion result can be obtained. Meanwhile, when Kalman filtering is adopted, real signals and noise are not required to belong to stable signals, and the requirement on the environment of data fusion is low, so that the accuracy of the data fusion is further improved.
And S15, searching according to the search condition parameters to obtain a search result corresponding to the at least one search identifier.
Illustratively, after the server obtains the search condition parameters corresponding to the search identifier and automatically searches, the server obtains the search result corresponding to the search identifier according to the search condition parameters. In some embodiments, after the search result corresponding to the search identifier is obtained, the search result is displayed on a terminal display of the user.
According to the data searching method provided by the embodiment, the parameter information input by the user is obtained, and the parameter information is cached to the first cache unit or the second cache unit according to the parameter format of the parameter information; determining at least one search identifier corresponding to the parameter information in a search page according to the binary tree index; determining a first search parameter in the first cache unit according to the at least one search identifier, and determining a second search parameter in the second cache unit according to the at least one search identifier; obtaining a search condition parameter according to the first search parameter and the second search parameter; and searching according to the search condition parameters to obtain a search result corresponding to the at least one search identifier. The method and the device can determine the search condition parameters of the search page through the preset cache unit and the search identifier in the search page, and automatically search according to the search condition parameters to obtain the search result, so that the search can be realized without inputting the parameters to be searched by the user, the time spent on searching is reduced, and the search efficiency is improved.
Referring to fig. 6, fig. 6 is a schematic block diagram of a data search apparatus according to an embodiment of the present application, where the data search apparatus is configured to perform the foregoing data search method. Wherein, the data search device can be configured in a server or a terminal.
The server may be an independent server or a server cluster. The terminal can be an electronic device such as a mobile phone, a tablet computer, a notebook computer, a desktop computer, a personal digital assistant and a wearable device.
As shown in fig. 6, the data search device 60 includes: a parameter acquisition module 601, an identification determination module 602, a parameter determination module 603, a parameter generation module 604, and a data search module 605.
A parameter obtaining module 601, configured to obtain parameter information input by a user, and cache the parameter information in a first cache unit or a second cache unit according to a parameter format of the parameter information;
an identifier determining module 602, configured to determine, according to the binary tree index, at least one search identifier corresponding to the parameter information in the search page;
a parameter determining module 603, configured to determine a first search parameter in the first cache unit according to the at least one search identifier, and determine a second search parameter in the second cache unit according to the at least one search identifier;
a parameter generating module 604, configured to obtain a search condition parameter according to the first search parameter and the second search parameter;
and the data searching module 605 searches according to the search condition parameters to obtain a search result corresponding to the at least one search identifier.
It should be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the apparatus and each module and unit described above may refer to the corresponding processes in the foregoing data search method embodiment, and are not described herein again.
The data search apparatus provided in the above embodiment may be implemented in the form of a computer program, which can be run on a computer device as shown in fig. 7.
Referring to fig. 7, fig. 7 is a schematic block diagram illustrating a structure of a computer device according to an embodiment of the present disclosure. The computer device may be a server or a terminal device.
As shown in fig. 7, the computer device 70 includes a processor 701 and a memory 702 connected by a system bus, wherein the memory 702 may include a nonvolatile storage medium and a volatile storage medium.
The memory 702 may store an operating system and computer programs. The computer program comprises program instructions which, when executed, cause the processor 701 to perform any of the data search methods described herein.
The processor 701 is used to provide computing and control capabilities to support the operation of the overall computer device.
In a possible embodiment, the computer device further comprises a network interface for performing network communication, such as sending assigned tasks, etc. Those skilled in the art will appreciate that the architecture shown in fig. 7 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
It should be appreciated that processor 701 is a Central Processing Unit (CPU), and may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, etc. Wherein a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
Wherein, in one embodiment, the processor executes a computer program stored in the memory to implement the steps of:
acquiring parameter information input by a user, and caching the parameter information to a first cache unit or a second cache unit according to a parameter format of the parameter information;
determining at least one search identifier corresponding to the parameter information in a search page according to the binary tree index;
determining a first search parameter in the first cache unit according to the at least one search identifier, and determining a second search parameter in the second cache unit according to the at least one search identifier;
obtaining a search condition parameter according to the first search parameter and the second search parameter;
and searching according to the search condition parameters to obtain a search result corresponding to the at least one search identifier.
Specifically, the specific implementation method of the program instruction by the processor may refer to the description of the relevant steps in the foregoing data search method embodiment, which is not described herein again.
An embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, where the computer program includes program instructions, and the program instructions, when executed by a processor, implement the following steps:
acquiring parameter information input by a user, and caching the parameter information to a first cache unit or a second cache unit according to a parameter format of the parameter information;
determining at least one search identifier corresponding to the parameter information in a search page according to the binary tree index;
determining a first search parameter in the first cache unit according to the at least one search identifier, and determining a second search parameter in the second cache unit according to the at least one search identifier;
obtaining a search condition parameter according to the first search parameter and the second search parameter;
and searching according to the search condition parameters to obtain a search result corresponding to the at least one search identifier.
Specifically, the specific implementation method for the program instructions executed by the processor may refer to the description of the relevant steps in the foregoing data search method embodiment, which is not repeated herein.
The computer-readable storage medium may be an internal storage unit of the computer device described in the foregoing embodiment, for example, a hard disk or a memory of the computer device. The computer readable storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the computer device.
The data search device, the computer device, and the computer-readable storage medium provided in the foregoing embodiments cache the parameter information to the first cache unit or the second cache unit according to the parameter format of the parameter information by acquiring the parameter information input by the user; determining at least one search identifier corresponding to the parameter information in a search page according to the binary tree index; determining a first search parameter in the first cache unit according to the at least one search identifier, and determining a second search parameter in the second cache unit according to the at least one search identifier; obtaining a search condition parameter according to the first search parameter and the second search parameter; and searching according to the search condition parameters to obtain a search result corresponding to the at least one search identifier. The method and the device can determine the search condition parameters of the search page through the preset cache unit and the search identifier in the search page, and automatically search according to the search condition parameters to obtain the search result, so that the search can be realized without inputting the parameters to be searched by the user, the time spent on searching is reduced, and the search efficiency is improved.
It should also be understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items. It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments. While the invention has been described with reference to specific embodiments, the scope of the invention is not limited thereto, and those skilled in the art can easily conceive various equivalent modifications or substitutions within the technical scope of the invention. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A data search method, characterized in that the data search method comprises:
acquiring parameter information input by a user, and caching the parameter information to a first cache unit or a second cache unit according to a parameter format of the parameter information;
determining at least one search identifier corresponding to the parameter information in a search page according to the binary tree index;
determining a first search parameter in the first cache unit according to the at least one search identifier, and determining a second search parameter in the second cache unit according to the at least one search identifier;
obtaining a search condition parameter according to the first search parameter and the second search parameter;
and searching according to the search condition parameters to obtain a search result corresponding to the at least one search identifier.
2. The data searching method of claim 1, wherein the determining at least one search identifier corresponding to the parameter information in a search page according to a binary tree index comprises:
traversing the binary tree index by adopting a priority queue from a root node of the binary tree index until a traversal termination condition is reached;
inserting the traversed nodes into the priority queue, and sequencing the priority queue based on the distance between the parameter information and the differential characteristics represented by the traversed nodes;
and determining the search identifier corresponding to the first leaf node ordered in the priority queue as the search identifier of the search page.
3. The data searching method of claim 1, wherein the determining a first search parameter in the first cache unit according to the at least one search identifier and a second search parameter in the second cache unit according to the at least one search identifier comprises:
acquiring a preset first search comparison table, comparing the at least one search identifier with all URL-format parameter data stored in the first cache unit one by one, and determining the URL-format parameter data matched with the at least one search identifier in the first search comparison table as a first search parameter;
and acquiring a preset second search comparison table, comparing the at least one search identifier with all parameter data in the params format stored in the second cache unit one by one, and determining the parameter data in the params format matched with the at least one search identifier in the second search comparison table as a second search parameter.
4. The data searching method of claim 3, wherein the determining a first search parameter in the first cache unit according to the at least one search identifier and a second search parameter in the second cache unit according to the at least one search identifier further comprises:
when the first search parameter cannot be determined in the first cache unit according to the at least one search identifier, and/or when the second search parameter cannot be determined in the second cache unit according to the at least one search identifier, generating a missing prompt according to a preset prompt rule;
when acquiring search parameters input by a user according to the missing prompt, determining a parameter format corresponding to the search parameters;
when the parameter format is a first format, storing the search parameter to the first cache unit; and when the parameter format is a second format, storing the search parameter to the second cache unit.
5. The data searching method according to any one of claims 1 to 4, wherein the obtaining of the search condition parameter according to the first search parameter and the second search parameter comprises:
slicing the first search parameter to obtain a preset number of first sliced data packets, and slicing the second search parameter to obtain a preset number of second sliced data packets;
and performing data splicing on the first fragment data packet and the second fragment data packet by using a data splicing server to obtain a search condition parameter.
6. The data searching method of claim 5, wherein the fragmenting the first search parameter to obtain a preset number of first fragmented packets, and fragmenting the second search parameter to obtain a preset number of second fragmented packets comprises:
determining a search item corresponding to the at least one search identifier;
fragmenting the first search parameter according to each search item through a greedy algorithm to obtain a preset number of first fragmented data packets;
and fragmenting the second search parameter according to each search item through a greedy algorithm to obtain a preset number of second fragmented data packets.
7. The data searching method according to any one of claims 1 to 4, wherein the obtaining of the search condition parameter according to the first search parameter and the second search parameter comprises:
filtering abnormal parameter data in the first search parameter by using a pre-trained data filtering model to obtain a first filtering parameter;
filtering abnormal parameter data in the second search parameter by using the pre-trained data filtering model to obtain a second filtering parameter;
and performing data fusion on the first filtering parameter and the second filtering parameter by adopting a Kalman filtering mode to obtain a search condition parameter.
8. A data search apparatus, comprising:
the parameter acquisition module is used for acquiring parameter information input by a user and caching the parameter information to a first cache unit or a second cache unit according to the parameter format of the parameter information;
the identification determining module is used for determining at least one search identification corresponding to the parameter information in the search page according to the binary tree index;
a parameter determining module, configured to determine a first search parameter in the first cache unit according to the at least one search identifier, and determine a second search parameter in the second cache unit according to the at least one search identifier;
the parameter generating module is used for obtaining a search condition parameter according to the first search parameter and the second search parameter;
and the data searching module is used for searching according to the searching condition parameters to obtain a searching result corresponding to the at least one searching identifier.
9. A computer device, wherein the computer device comprises a memory and a processor;
the memory is used for storing a computer program;
the processor, when executing the computer program, implementing the data search method of any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a processor, implements a data search method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011306363.XA CN112364246B (en) | 2020-11-19 | 2020-11-19 | Data searching method, device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011306363.XA CN112364246B (en) | 2020-11-19 | 2020-11-19 | Data searching method, device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112364246A true CN112364246A (en) | 2021-02-12 |
| CN112364246B CN112364246B (en) | 2024-02-06 |
Family
ID=74532661
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011306363.XA Active CN112364246B (en) | 2020-11-19 | 2020-11-19 | Data searching method, device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112364246B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6801906B1 (en) * | 2000-01-11 | 2004-10-05 | International Business Machines Corporation | Method and apparatus for finding information on the internet |
| US20050086212A1 (en) * | 2003-09-23 | 2005-04-21 | International Business Machines Corporation | Method, apparatus and computer program for key word searching |
| CN106372136A (en) * | 2010-12-30 | 2017-02-01 | 脸谱公司 | Distributed cache system and method and storage medium |
| CN106682192A (en) * | 2016-12-29 | 2017-05-17 | 北京奇虎科技有限公司 | Method and device for training answer intention classification model based on search keywords |
| WO2019127299A1 (en) * | 2017-12-25 | 2019-07-04 | 深圳云天励飞技术有限公司 | Data query method, and electronic device and storage medium |
| CN110765275A (en) * | 2019-10-14 | 2020-02-07 | 平安医疗健康管理股份有限公司 | Search method, search device, computer equipment and storage medium |
-
2020
- 2020-11-19 CN CN202011306363.XA patent/CN112364246B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6801906B1 (en) * | 2000-01-11 | 2004-10-05 | International Business Machines Corporation | Method and apparatus for finding information on the internet |
| US20050086212A1 (en) * | 2003-09-23 | 2005-04-21 | International Business Machines Corporation | Method, apparatus and computer program for key word searching |
| CN106372136A (en) * | 2010-12-30 | 2017-02-01 | 脸谱公司 | Distributed cache system and method and storage medium |
| CN106682192A (en) * | 2016-12-29 | 2017-05-17 | 北京奇虎科技有限公司 | Method and device for training answer intention classification model based on search keywords |
| WO2019127299A1 (en) * | 2017-12-25 | 2019-07-04 | 深圳云天励飞技术有限公司 | Data query method, and electronic device and storage medium |
| CN110765275A (en) * | 2019-10-14 | 2020-02-07 | 平安医疗健康管理股份有限公司 | Search method, search device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112364246B (en) | 2024-02-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110162695B (en) | Information pushing method and equipment | |
| US9734261B2 (en) | Context aware query selection | |
| JP5575902B2 (en) | Information retrieval based on query semantic patterns | |
| US10452702B2 (en) | Data clustering | |
| KR101557294B1 (en) | Search results ranking using editing distance and document information | |
| US10216848B2 (en) | Method and system for recommending cloud websites based on terminal access statistics | |
| CN109190014B (en) | Regular expression generation method and device and electronic equipment | |
| US11775767B1 (en) | Systems and methods for automated iterative population of responses using artificial intelligence | |
| GB2498762A (en) | Computing user traffic at the website based on user actions | |
| CN108900547B (en) | Source returning control method and device | |
| US10250550B2 (en) | Social message monitoring method and apparatus | |
| CN109815112B (en) | Data debugging method and device based on functional test and terminal equipment | |
| CN111314063A (en) | Big data information management method, system and device based on Internet of things | |
| CN105574030A (en) | Information search method and device | |
| CN112070550A (en) | Keyword determination method, device and equipment based on search platform and storage medium | |
| CN108804550B (en) | Query term expansion method and device and electronic equipment | |
| US11361195B2 (en) | Incremental update of a neighbor graph via an orthogonal transform based indexing | |
| CN110020078B (en) | Method and related device for generating relevance mapping dictionary and verifying relevance | |
| CN116155597A (en) | Access request processing method and device and computer equipment | |
| CN112364246A (en) | Data searching method and device, computer equipment and storage medium | |
| CN113656575B (en) | Training data generation method and device, electronic equipment and readable medium | |
| CN115687810A (en) | Webpage searching method and device and related equipment | |
| CN114238767A (en) | Service recommendation method and device, computer equipment and storage medium | |
| CN114840487A (en) | Metadata management method and device for distributed file system | |
| CN110580317B (en) | Social information analysis method and device, terminal equipment and storage medium |
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 |