The concept and use of Boolean search 10

The so-called Boolean search refers to a query method that expresses the logical relationship between keywords and keywords through standard Boolean logical relations, which allows us to enter multiple keywords, and the relationship between each keyword can be expressed by logical relationship words.

and, called the logical "and", is used to concatenate to indicate that the two words it is connected to must appear in the query result at the same time, for example, if you enter "computer and book", it requires that both computer and book must be included in the query result.

or, called logical "or", it means that either of the two keywords connected can appear in the query result, for example, entering "computer or book", the query result can only have computer, or only book, or both computer and book.

not, called the logical "not", indicates that the second keyword should be excluded from the first keyword concept in the two keywords connected, for example, if you enter "automobile not car", you will require that the query result contain automobile, but not car.

near, which means that the distance between two keywords cannot exceed n words. In the actual use process, you can use various logical relationships comprehensively and flexibly to perform more complex queries.

I don't know either, but I'd like to know.

I'm sorry Douyan, we don't have time to guess the imperial law for this problem, I can't solve this problem and I don't dare to give you easy methods and suggestions, please consult the relevant personnel to give you the correct answer, I wish you a happy life.

Boolean operators are "logical and", logical or ("or"), and logical not ("not").

Boolean logic search query uses Boolean logic operators to connect various search terms, and the Boolean logic search query required by the user is as follows:

1. Mr. Yu Hao published in the Journal of Hunan University of Science and Technology on management

Yu Hao and Management and Hunan Institute of Science and Technology.

2. Zhang Yuelian or Wang Zhiyun wrote ** on microbial fuel cells

Yuelian Zhang or Zhiyun Wang) and microbial fuels and fuel cells.

3. Xiao Ximing's book Wu Potato Library Science (G250) and Library Management (G251) published by Li Lu**:

Xiao Ximing and (Library Science or Library Management) or Xiao Ximing and (Library Science or Library Work).

Note: AND can be replaced with *, or can be replaced by +.

A Boolean logic search is a query language used to retrieve information in a computer system. It consists of Boolean logical operators (and, or, not) and keywords that describe the user's query requirements and limitations. The combination of Boolean logical operators allows you to precisely filter and filter the corresponding document or mock oak dataset to quickly find the information you need.

Boolean logic search query uses Boolean logic operators to connect various search terms, and the Boolean logic search query required by the user is as follows:

1. Mr. Yu Hao published in the Journal of Hunan University of Science and Technology on management

Yu Hao and Management and Hunan Institute of Science and Technology.

2. Zhang Yuelian or Wang Zhiyun wrote ** on microbial fuel cells

Yuelian Zhang or Zhiyun Wang) and microbial fuels and fuel cells.

3. Xiao Ximing's book Wu Potato Library Science (G250) and Library Management (G251) published by Li Lu**:

Xiao Ximing and (Library Science or Library Management) or Xiao Ximing and (Library Science or Library Work).

Note: AND can be replaced with *, or can be replaced by +.

Boolean logic search query uses Boolean logic operators to connect various search terms, and the Boolean logic search query required by the user is as follows:

1. Mr. Yu Hao published in the Journal of Hunan University of Science and Technology on management

Yu Hao and Management and Hunan Institute of Science and Technology.

2. Zhang Yuelian or Wang Zhiyun wrote ** on microbial fuel cells

Yuelian Zhang or Zhiyun Wang) and microbial fuels and fuel cells.

3. Xiao Ximing's book Wu Potato Library Science (G250) and Library Management (G251) published by Li Lu**:

Xiao Ximing and (Library Science or Library Management) or Xiao Ximing and (Library Science or Library Work).

Note: AND can be replaced with *, or can be replaced by +.

Boolean logic search query uses Boolean logic operators to connect various search terms, and the Boolean logic search query required by the user is as follows:

1. Mr. Yu Hao published in the Journal of Hunan University of Science and Technology on management

Yu Hao and Management and Hunan Institute of Science and Technology.

2. Zhang Yuelian or Wang Zhiyun wrote ** on microbial fuel cells

Yuelian Zhang or Zhiyun Wang) and microbial fuels and fuel cells.

3. Xiao Ximing's book Wu Potato Library Science (G250) and Library Management (G251) published by Li Lu**:

Xiao Ximing and (Library Science or Library Management) or Xiao Ximing and (Library Science or Library Work).

Note: AND can be replaced with *, or can be replaced by +.

Boolean logic search is a technique for retrieving information that uses Boolean operators (and, or, and not) to construct a chain-checking formula to find documents that meet certain criteria. It can be used to search multiple shed manuscript with letter types such as text, images, and audio.