CN112364246B - Data searching method, device, computer equipment and storage medium - Google Patents
Data searching method, device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112364246B CN112364246B CN202011306363.XA CN202011306363A CN112364246B CN 112364246 B CN112364246 B CN 112364246B CN 202011306363 A CN202011306363 A CN 202011306363A CN 112364246 B CN112364246 B CN 112364246B
- Authority
- CN
- China
- Prior art keywords
- search
- parameter
- data
- identifier
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000001914 filtration Methods 0.000 claims description 48
- 230000002159 abnormal effect Effects 0.000 claims description 16
- 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
- 238000010586 diagram Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 3
- 238000005457 optimization 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
- 230000003139 buffering effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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 searching method, a data searching 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 caching unit or a second caching 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 a first cache unit according to the search identifier, and determining a second search parameter in a 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 mark. According to the invention, the search condition parameters of the search page can be determined through the preset cache unit and the search mark in the search page to perform automatic search, so that the time spent in search is reduced, and the search efficiency is improved.
Description
Technical Field
The present disclosure relates to the field of data processing technologies, and in particular, to a data searching method, a data searching device, a computer device, and a storage medium.
Background
With the rapid development of internet technology, massive data is filled in the network, and users increasingly use search technology to acquire needed data information from the massive data on the network. For example, the user can input the interested keywords in the search box of the page as search parameters to search, so as to obtain the data required by the user. In the prior art, a user is required to input parameters to be searched by himself to realize the search, and more time is required, so that the search efficiency is low.
Therefore, how to improve the search efficiency is a problem to be solved.
Disclosure of Invention
In view of the foregoing, it is necessary to provide a data searching method, apparatus, computer device and storage medium, which can determine a search condition parameter of a search page through a preset cache unit and a search identifier in the search page, and perform automatic search according to the search condition parameter to obtain a search result, so that the user does not need to input the parameter to be searched by himself to realize the search, thereby reducing the time spent in the search and improving the search efficiency.
The 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 caching unit or a second caching 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 a 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 invention, the determining at least one search identifier corresponding to the parameter information in the search page according to the binary tree index comprises:
traversing the binary tree index by adopting a priority queue from the root node of the binary tree index until a traversing 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 features represented by the traversed nodes;
And determining the search identification corresponding to the leaf node ordered at the first in the priority queue as the search identification of the search page.
According to an optional embodiment of the invention, the determining a first search parameter in the first cache unit according to the at least one search identifier, and the 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 invention, the determining a first search parameter in the first cache unit according to the at least one search identifier, and the determining a second search parameter in the second cache unit according to the at least one search identifier further comprises:
Generating a missing prompt according to a preset prompt rule when a first search parameter cannot be determined in the first cache unit according to the at least one search identifier and/or when a second search parameter cannot be determined in the second cache unit according to the at least one search identifier;
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 into the first cache unit; and when the parameter format is a second format, storing the search parameter into the second cache unit.
According to an optional embodiment of the invention, the obtaining the search condition parameter according to the first search parameter and the second search parameter comprises:
fragmenting the first search parameter to obtain a preset number of first fragmented data packets, and fragmenting the second search parameter to obtain a preset number of second fragmented data packets;
and performing data splicing on the first fragmented data packet and the second fragmented data packet by using a data splicing server to obtain search condition parameters.
According to an optional embodiment of the present invention, the slicing the first search parameter to obtain a preset number of first sliced data packets, and the slicing the second search parameter to obtain a preset number of second sliced data packets includes:
determining a search term corresponding to the at least one search identifier;
fragmenting the first search parameters according to each search item through a greedy algorithm to obtain a preset number of first fragmented data packets;
and fragmenting the second search parameters 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 invention, the obtaining the search condition parameter according to the first search parameter and the second search parameter comprises:
filtering abnormal parameter data in the first search parameters by using a pre-trained data filtering model to obtain first filtering parameters;
filtering abnormal parameter data in the second search parameters by using the pre-trained data filtering model to obtain second filtering parameters;
and carrying out data fusion on the first filtering parameter and the second filtering parameter by adopting a Kalman filtering mode to obtain a searching 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 the first caching unit or the second caching unit according to a 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;
the parameter determining module is used for 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;
the parameter generation module is used for obtaining search condition parameters according to the first search parameters and the second search parameters;
and the data searching module searches 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 searching method 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 a 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 acquired, 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 a 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 the invention, the search condition parameters of the search page can be determined through the preset cache unit and the search mark in the search page, and the automatic search is carried out according to the search condition parameters, so that the search result is obtained, the user does not need to input the parameters to be searched by himself, the search can be realized, the time spent in the search is reduced, and the search efficiency is improved.
Drawings
Fig. 1 is a schematic flow chart of a data searching method according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart of a sub-process for determining at least one search identifier corresponding to the parameter information in a search page according to the binary tree index shown in FIG. 1;
FIG. 3 is a schematic flow chart of a sub-process of 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 in FIG. 1;
FIG. 4 is a schematic flow chart of a sub-process of obtaining the search condition parameters according to the first search parameter and the second search parameter shown in FIG. 1;
FIG. 5 is a schematic view of another sub-process of obtaining search condition parameters according to the first search parameter and the second search parameter shown in FIG. 1;
FIG. 6 is a schematic block diagram of a data searching apparatus provided by an embodiment of the present invention;
fig. 7 is a schematic block diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
The flow diagrams depicted in the figures are merely illustrative and not necessarily all of the elements and operations/steps are included or performed in the order described. For example, some operations/steps may be further divided, combined, or partially combined, so that the order of actual execution may be changed according to actual situations.
The embodiment of the application provides a data searching method, a data searching device, computer equipment and a computer readable storage medium. The data searching method can be applied to terminal equipment or servers, wherein the terminal equipment can be mobile phones, tablet computers, notebook computers, desktop computers, personal digital assistants, wearable equipment and other electronic equipment, and the servers can be single servers or server clusters formed by a plurality of servers. The following explanation will be made taking the application of the data search method to a server as an example.
Some embodiments of the present application are described in detail below with reference to the accompanying drawings. The following embodiments and features of the embodiments may be combined with each other without conflict.
Referring to fig. 1, fig. 1 is a schematic flowchart 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 according to different requirements, and some may be omitted.
S11, acquiring parameter information input by a user, and caching the parameter information to a first caching unit or a second caching unit according to a parameter format of the parameter information.
The first buffer unit and the second buffer unit are used for buffering parameter data in different formats, and in some embodiments, after the parameter data are acquired, the parameter data are buffered to the first buffer unit or the second buffer unit according to the type of the parameter data. For example, the first buffer unit is configured to buffer parameter data in a uniform resource locator (uniform resource locator, URL) format, and the second buffer unit is configured to buffer 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 according to an accessible routing menu, and from a browser cache.
For example, acquiring parameter information input by a user, and caching the parameter information to a first caching unit when the parameter format of the parameter information is a URL format; for another example, parameter information input by a user is acquired, and when the parameter format of the parameter information is a params format, the parameter information is cached in the second caching unit.
The first cache unit includes a first search comparison table, where search identifiers corresponding to parameter data in each URL format are recorded in the first search comparison table; the second buffer unit comprises a second search comparison table, and search identifiers corresponding to parameter data in each params format are recorded in the second search comparison table.
When a user increases or modifies parameter information according to the own requirement, the parameter information input by the user is acquired, a 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 URL format, the parameter information is stored in the first buffer unit, and when the parameter format is params format, the parameter information is stored in the second buffer unit.
When the parameter format of the parameter information input by the user is in the URL format and the first buffer unit does not include the parameter information input by the user, modifying a first search comparison table in the first buffer unit, for example, adding the parameter information input by the user and a search identifier corresponding to the parameter information input by the user in the first search comparison table. The search identifier may be user-defined or automatically generated by the server based on user-entered parameter information.
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. When the page picture is determined to have a binary tree index, traversing the binary tree index according to the characteristics of the page picture, and determining at least one search identification in the search page.
In the invention, the search page comprises a plurality of search identifications, a binary tree index is generated for the search identifications which meet preset identification conditions, and the search identifications can be queried based on the binary tree index when the search identifications are queried subsequently. And when the search marks with the search frequency greater than or equal to the search frequency threshold value are screened from the search page, generating a binary tree index for the screened search marks. For search identifiers having a search frequency less than the search frequency threshold, a binary tree index is not generated until the search frequency reaches the search frequency threshold. The binary tree index is established for the search identifications included in the search page, so that the search of the subsequent search identifications is facilitated, the search identifications of each bar are not required to be compared, the speed of determining the search identifications is greatly improved, and the search efficiency of data search is improved.
In some embodiments, as shown in fig. 2, the determining at least one search identifier corresponding to the parameter information in the search page according to the binary tree index 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 traversing 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 features represented by the traversed nodes;
s123, determining the search identification corresponding to the first leaf node in the priority queue as the search identification of the search page.
When it is determined that the page picture has a binary tree index, traversing the binary tree index by using a priority queue from a root node of the binary tree index until a traversing termination condition is reached, inserting the traversed node into the priority queue, sorting the priority queue based on a distance between a feature of the page picture and a differential feature represented by the traversed node, and determining a search identifier corresponding to a leaf node sorted in the priority queue as a search identifier of the search page.
Wherein the priority queue has the behavior of a first in (big out) that the element is given priority in the priority queue, the element with the highest priority being dequeued first when accessing the element. For example, a priority queue is generated for the search identifier, and priority is given to the search identifier according to the search condition of the user. The traverse termination condition can be set according to the requirement of the user, for example, the traverse is performed to the search mark with the sixth priority in the priority queue, namely, the traverse termination condition is determined to be reached when the traverse is performed to the search mark with the sixth priority in the priority queue.
And inquiring based on the distance between the characteristics of the page picture and the differential characteristics represented by the traversed nodes, so that the search identification of the search page can be effectively determined, and the data retrieval efficiency is improved. Meanwhile, by setting the traversing termination condition, traversing of all binary tree indexes can be avoided, and the time for determining the searching identification of the searching page is reduced, so that the data searching 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.
Illustratively, comparing all the parameter data in URL format stored in the first buffer unit one by one according to the at least one search identifier, and determining the parameter data in URL format matched with the at least one search identifier as a 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, 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.
The first buffer unit includes a first search comparison table, in which search identifiers corresponding to the 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, determine a first search parameter corresponding to the search identifier.
S132, 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.
The second buffer unit includes a second search comparison table, in which search identifiers corresponding to parameter data in each params format are recorded, and the second search comparison table is queried to determine parameter data in the params format corresponding to the at least one search identifier, that is, 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:
Generating a missing prompt according to a preset prompt rule when a first search parameter cannot be determined in the first cache unit according to the at least one search identifier and/or when a second search parameter cannot be determined in the second cache unit according to the at least one search identifier;
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 into the first cache unit; and when the parameter format is a second format, storing the search parameter into the second cache unit.
When a first search parameter cannot be determined in the first cache unit according to the at least one search identifier, namely when parameter data in a URL format matched with the at least one search identifier does not exist in the first cache unit, and/or when a second search parameter cannot be determined in the second cache unit according to the at least one search identifier, namely when parameter data in a params format matched with the at least one search identifier does not exist in the second cache unit, the server generates a missing prompt according to a preset prompt rule to prompt a user to input the corresponding search parameter. For example, when the first buffer unit does not have the parameter data in the URL format matched with the at least one search identifier, a prompting rule is generated, and the prompting rule is displayed on a terminal interface of the user, so that the user inputs the parameter data in the URL format matched with the at least one search identifier.
In some embodiments, when the search parameter input by the user according to the missing prompt is obtained, the search parameter is stored according to a parameter format corresponding to the search parameter, and the first cache unit and/or the second cache unit are 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.
S14, obtaining search condition parameters according to the first search parameters and the second search parameters.
The first search parameter and the second search parameter are illustratively obtained according to a preset processing rule, wherein 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 the 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;
And S142a, performing data splicing on the first fragmented data packet and the second fragmented data packet by using a data splicing server to obtain search condition parameters.
After the first search parameter and the second search parameter corresponding to the search page are obtained, performing data slicing on the first search parameter to obtain a preset number of first sliced data packets, and performing data slicing on the second search parameter to obtain a preset number of second sliced data packets. In some embodiments, the preset number of first fragmented packets plus the preset number of second fragmented packets may be equal to the number of data splice servers. The data splicing server is a server for splicing search data in the fragmented data packet. I.e. the number of fragmented data packets corresponds to the number of data splice servers. Each data splicing server can acquire a sliced data packet to splice the data. Data concatenation is an operation of integrating several data stored in different units (tables) into one unit (table) in the vertical direction. After each data splicing server acquires the fragmented data packet, data splicing is carried out on the search data of the acquired fragmented data packet, and a data splicing result is obtained.
And sending the first fragmented data packet and the second fragmented data packet to the corresponding data splicing server. For example, the preset number of the first sliced data packets is 2, the preset number of the second sliced data packets is 3, and the number of the data splicing servers is 5. And sending the obtained 2 first fragmented data packets and 3 second fragmented data packets to corresponding data splicing servers, so that each data splicing server obtains one fragmented data packet. Each data splicing server only needs to be responsible for corresponding data splicing tasks, so that the problems that when the data volume of search data is huge, the server is large in load, the server is congested, and the splicing and storage processes of the data are affected are avoided.
In some embodiments, the 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 includes:
determining a search term corresponding to the at least one search identifier;
fragmenting the first search parameters according to each search item through a greedy algorithm to obtain a preset number of first fragmented data packets;
And fragmenting the second search parameters according to each search item through a greedy algorithm to obtain a preset number of second fragmented data packets.
In some implementations, the number of search terms triggered on a search page is determined based on at least one search identification on the search page. And then, respectively fragmenting the first search parameter and the second search parameter based on the number of search items triggered by a search page through a greedy algorithm to obtain a first fragmenting data packet and a second fragmenting data packet with preset numbers: and distributing the parameter data in the same search item into the same sliced data packet, and integrating the sliced data packets to obtain a preset number of sliced data packets. For example, parameter data of a first search parameter in the same search item is distributed into the same slicing data packet, and the slicing data packets are assembled to obtain a preset number of first slicing data packets; and distributing the parameter data of the second search parameter in the same search item into the same sliced data packet, and integrating the sliced data packets to obtain a preset number of second sliced data packets.
The basic idea of greedy algorithm is to go on step by step from a certain initial solution of the problem, and according to a certain optimization measure, each step needs to ensure that a local optimal solution can be obtained. Only one data is considered in each step, and the condition meeting the local optimization is selected. When the next data and the partial optimal solution are no longer viable solutions, the data is not added to the partial solution until all data is enumerated or the addition algorithm can no longer be stopped. And (3) carrying out iterative computation on the first search parameter and the second search parameter by using a greedy algorithm, so that parameter data corresponding to the same search item is distributed into the same sliced data packet, the slicing of the data is more accurate, and the accuracy of data searching is improved.
In some embodiments, as shown in fig. 5, the obtaining the 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;
and S143b, carrying out data fusion on the first filtering parameter and the second filtering parameter by adopting a Kalman filtering mode to obtain a search condition parameter.
Wherein, the abnormal parameter data can be understood as: among the data which need to be subjected to data fusion, parameter data which have large differences from the information represented by other data are provided. Kalman filtering (Kalman filtering) is an algorithm that uses a linear system state equation to optimally estimate the state of the system by inputting and outputting observed data through the system. Since the observed data includes both system noise and interference data, the optimal estimate can also be considered a filtering process. For example, before the parameter data are fused in different application scenes by adopting a kalman filtering mode, parameters involved in a kalman filtering algorithm can be set by combining information such as types, formats, adoption intervals, dimensions and the like of the parameter data to be fused so as to adapt to the requirements of the application scenes.
The first search parameter may be obtained as first sample data, where 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 characteristics of abnormal parameter data from an overall angle of the data, so that when the data filtering model is used for filtering the first search parameter, abnormal parameter data in the first search parameter can be better filtered; the second search parameter can be obtained as second sample data, the second sample data comprises a second classification label, the second sample data and the second classification label of the second 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 the abnormal parameter data from the whole angle of the data, so that when the data filtering model is used for filtering the second search parameter, the abnormal parameter data in the second search parameter can be filtered well.
In some embodiments, the data filtering model may also be used as a model for classifying data, that is, 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 of normal parameter data and abnormal parameter data, and after the classification result is obtained, the parameter data belonging to the abnormal parameter data in the first search parameter and the second search parameter can be filtered.
And filtering abnormal parameter data in the first search parameter and the second search parameter before carrying out data fusion on the first search parameter and the second search parameter by adopting a Kalman filtering mode, so that a high-accuracy data fusion result can be obtained. Meanwhile, when Kalman filtering is adopted, the real signals and noise are not required to belong to stable signals, and the environmental requirement on data fusion is low, so that the accuracy of 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 mark.
The server automatically searches the search condition parameters corresponding to the search identifications, and then obtains search results corresponding to the search identifications according to the search condition parameters. In some embodiments, after obtaining the search result corresponding to the search identifier, 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 caching unit or the second caching 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 a 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 the invention, the search condition parameters of the search page can be determined through the preset cache unit and the search mark in the search page, and the automatic search is carried out according to the search condition parameters, so that the search result is obtained, the user does not need to input the parameters to be searched by himself, the search can be realized, the time spent in the search is reduced, and the search efficiency is improved.
Referring to fig. 6, fig. 6 is a schematic block diagram of a data searching apparatus according to an embodiment of the present application, where the data searching apparatus is configured to perform the foregoing data searching method. The data searching device may be configured in a server or a terminal.
The servers may be independent servers or may be server clusters. The terminal can be electronic equipment such as a mobile phone, a tablet computer, a notebook computer, a desktop computer, a personal digital assistant, wearable equipment and the like.
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.
The parameter obtaining module 601 is configured to obtain parameter information input by a user, and cache the parameter information to the first cache unit or the second cache unit according to a parameter format of the parameter information;
the identifier determining module 602 is configured to determine at least one search identifier corresponding to the parameter information in a search page according to a binary tree index;
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 performs searching according to the searching condition parameters to obtain a searching result corresponding to the at least one searching identifier.
It should be noted that, for convenience and brevity of description, specific working processes of the above-described apparatus and each module and unit may refer to corresponding processes in the foregoing data searching method embodiment, which are not described herein again.
The data searching apparatus provided by the above-described embodiments 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 of a computer device according to an embodiment of the present application. 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.
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 searching methods described herein.
The processor 701 is used to provide computing and control capabilities, supporting 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. It will be appreciated by those skilled in the art that the structure shown in fig. 7 is merely a block diagram of some of the structures associated with the present application and is not limiting of the computer device to which the present application may be applied, and that a particular computer device may include more or fewer components than shown, or may combine certain components, or have a different arrangement of components.
It should be appreciated that the processor 701 is a central processing unit (Central Processing Unit, CPU) which may also be other general purpose processors, digital signal processors (Digital SignalProcessor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field-programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. Wherein the 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 a memory to effect the steps of:
acquiring parameter information input by a user, and caching the parameter information to a first caching unit or a second caching 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 a 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 processor to the program instruction may refer to the description of the relevant steps in the foregoing data searching method embodiment, which is not repeated herein.
The embodiment of the application also provides a computer readable storage medium, wherein the computer readable storage medium stores a computer program, the computer program comprises program instructions, and the program instructions realize the following steps when being executed by a processor:
Acquiring parameter information input by a user, and caching the parameter information to a first caching unit or a second caching 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 a 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.
In particular, the specific implementation method of the program instruction executed by the processor may refer to the description of the relevant steps in the foregoing data searching method embodiment, which is not repeated herein.
The computer readable storage medium may be an internal storage unit of the computer device according to 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), or the like, which are provided on the computer device.
The data searching device, the computer device and the computer readable storage medium provided in the foregoing embodiments are configured to obtain parameter information input by a user, and cache 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 a 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 the invention, the search condition parameters of the search page can be determined through the preset cache unit and the search mark in the search page, and the automatic search is carried out according to the search condition parameters, so that the search result is obtained, the user does not need to input the parameters to be searched by himself, the search can be realized, the time spent in the search 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 any and all possible combinations of one or more of the associated listed items, and includes such combinations. 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 one … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The foregoing embodiment numbers of the present application are merely for describing, and do not represent advantages or disadvantages of the embodiments. While the invention has been described with reference to certain preferred embodiments, it will be understood by those skilled in the art that various changes and substitutions of equivalents may be made and equivalents will be apparent to those skilled in the art without departing from the scope of the invention. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (9)
1. A data search method, the data search method comprising:
acquiring parameter information input by a user, and caching the parameter information to a first caching unit or a second caching 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 a 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;
searching according to the search condition parameters to obtain a search result corresponding to the at least one search mark;
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 includes: 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.
2. The data searching method according to claim 1, wherein the determining at least one search identifier corresponding to the parameter information in the search page according to the binary tree index comprises:
traversing the binary tree index by adopting a priority queue from the root node of the binary tree index until a traversing 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 features represented by the traversed nodes;
and determining the search identification corresponding to the leaf node ordered at the first in the priority queue as the search identification 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 determining a second search parameter in the second cache unit according to the at least one search identifier further comprises:
generating a missing prompt according to a preset prompt rule when a first search parameter cannot be determined in the first cache unit according to the at least one search identifier and/or when a second search parameter cannot be determined in the second cache unit according to the at least one search identifier;
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 into the first cache unit; and when the parameter format is a second format, storing the search parameter into the second cache unit.
4. A data search method according to any one of claims 1 to 3, wherein said obtaining search condition parameters from said first search parameter and said second search parameter comprises:
fragmenting the first search parameter to obtain a preset number of first fragmented data packets, and fragmenting the second search parameter to obtain a preset number of second fragmented data packets;
and performing data splicing on the first fragmented data packet and the second fragmented data packet by using a data splicing server to obtain search condition parameters.
5. The method of claim 4, wherein the slicing the first search parameter to obtain a predetermined number of first sliced data packets, and the slicing the second search parameter to obtain a predetermined number of second sliced data packets comprises:
Determining a search term corresponding to the at least one search identifier;
fragmenting the first search parameters according to each search item through a greedy algorithm to obtain a preset number of first fragmented data packets;
and fragmenting the second search parameters according to each search item through a greedy algorithm to obtain a preset number of second fragmented data packets.
6. A data search method according to any one of claims 1 to 3, wherein said obtaining search condition parameters from said first search parameter and said second search parameter comprises:
filtering abnormal parameter data in the first search parameters by using a pre-trained data filtering model to obtain first filtering parameters;
filtering abnormal parameter data in the second search parameters by using the pre-trained data filtering model to obtain second filtering parameters;
and carrying out data fusion on the first filtering parameter and the second filtering parameter by adopting a Kalman filtering mode to obtain a searching condition parameter.
7. A data search device, comprising:
the parameter acquisition module is used for acquiring parameter information input by a user and caching the parameter information to the first caching unit or the second caching unit according to a 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;
the parameter determining module is used for 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;
the parameter generation module is used for obtaining search condition parameters according to the first search parameters and the second search parameters;
the data searching module searches according to the searching condition parameters to obtain a searching result corresponding to the at least one searching identifier;
wherein 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 includes: 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.
8. A computer device, the computer device comprising a memory and a processor;
the memory is used for storing a computer program;
the processor, when executing the computer program, is configured to implement the data searching method according to any one of claims 1 to 6.
9. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a processor, implements the data search method according to any one of claims 1 to 6.
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 CN112364246A (en) | 2021-02-12 |
| CN112364246B true 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 (5)
| 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 |
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2406399A (en) * | 2003-09-23 | 2005-03-30 | Ibm | Seaching within a computer network by entering a search term and optional URI into a web browser |
-
2020
- 2020-11-19 CN CN202011306363.XA patent/CN112364246B/en active Active
Patent Citations (5)
| 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 |
| 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 |
|---|---|
| CN112364246A (en) | 2021-02-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9634902B1 (en) | Bloom filter index for device discovery | |
| CN110162695B (en) | Information pushing method and equipment | |
| US10073876B2 (en) | Bloom filter index for device discovery | |
| WO2013106595A2 (en) | Processing store visiting data | |
| US20170039206A1 (en) | Auto grouping browser tabs | |
| WO2013110357A1 (en) | Social network analysis | |
| CN111314063A (en) | Big data information management method, system and device based on Internet of things | |
| US10250550B2 (en) | Social message monitoring method and apparatus | |
| CN105574030A (en) | Information search method and device | |
| CN111367870A (en) | Method, device and system for sharing picture book | |
| CN110147223B (en) | Method, device and equipment for generating component library | |
| US20180285693A1 (en) | Incremental update of a neighbor graph via an orthogonal transform based indexing | |
| CN113761565B (en) | Data desensitization method and device | |
| CN112364246B (en) | Data searching method, device, computer equipment and storage medium | |
| US7599946B2 (en) | Systems and methods for discovering frequently accessed subtrees | |
| CN111078773A (en) | Data processing method and device | |
| CN110737691B (en) | Method and apparatus for processing access behavior data | |
| CN115062206B (en) | Webpage element searching method and electronic equipment | |
| CN114238767A (en) | Service recommendation method and device, computer equipment and storage medium | |
| JP6333306B2 (en) | SEARCH DATA MANAGEMENT DEVICE, SEARCH DATA MANAGEMENT METHOD, AND SEARCH DATA MANAGEMENT PROGRAM | |
| CN112380476A (en) | Information display method and device and electronic equipment | |
| CN112016321A (en) | Method, electronic device and storage medium for mail processing | |
| WO2017095421A1 (en) | Automatic selection of neighbor lists to be incrementally updated | |
| CN112395510A (en) | Method and device for determining target user based on activity | |
| CN111460088A (en) | Similar text retrieval method, device and system |
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 |