Data search method and device
A data search and data technology, applied in the field of data processing, can solve the problems of low efficiency of Boolean operation search, large space and time overhead, etc., to achieve the effect of reducing time and space overhead and improving search efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0026] figure 2 It is a schematic flowchart of a data search method provided in Embodiment 1 of the present invention. The method is suitable for searching, classifying and sorting massive data by various search engines such as industries and commerce. The method is executed by a device, a terminal or a server with a search engine, and can be implemented in the form of software and / or hardware. Such as figure 2 As shown, the data search method includes:
[0027] S210. Convert the search rules from Boolean rules to disjunctive normal form rules.
[0028] For massive data in the Internet, social networks, etc., there are massive search rules corresponding to it. This correspondence between data and search rules enables users to search and filter massive data. The search rules issued in this correspondence can be called Boolean rules.
[0029] A Boolean rule is specifically one or multiple objects connected by logical operation symbols ("logic and", "logic or" and "logic no...
Embodiment 2
[0042] image 3 It is a schematic flow chart of a data search method provided by Embodiment 2 of the present invention. This embodiment further describes the data search method in detail on the basis of the foregoing embodiments. Such as image 3 As shown, the data search method includes:
[0043] S301. Convert the search rules from Boolean rules to disjunctive normal form rules.
[0044] S302. Decompose the disjunctive normal form rules into multiple simple conjunction rules.
[0045] S303. Allocate a corresponding increment identifier for each of the simple conjunction rules in the disjunctive normal form rules.
[0046] Each Boolean rule issued corresponds to a unique identifier, which is the basis for the index when the search rule is searched. Therefore, if Boolean rules are to be finally divided into simple conjunction rules, an incremental identifier can be assigned to each simple conjunction rule for the convenience of finding. And in order to be applicable to all...
Embodiment 3
[0063] On the basis of the above-mentioned embodiments, this embodiment further defines a data search method to make the method easier to implement, and uses simple examples to illustrate.
[0064] For example, among the distributed massive search rules, a certain Boolean rule is A=1&(B=2||C=3), which is transformed into the disjunctive normal form (A=1&B=2)||(A= 1&C=3), after conversion, it can be decomposed into two simple conjunction rules, (A=1&B=2) and (A=1&C=3), respectively assigning the increment flag 1 and the increment flag to the above two rules 2. Then generate rule 1: (A=1&B=2) and rule 2: (A=1&C=3) respectively. Correspondingly, a comparison index as shown in Table 1 can be established.
[0065] Table 1
[0066] A＝1
1,2
B＝2
1
C＝3
2
[0067] As shown in Table 1, both rule 1 and rule 2 include the field A=1, then the increments corresponding to A=1 in the comparison index are identified as 1 and 2; similarly, the increments corr...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More