当前位置:网站首页>Full text query classification
Full text query classification
2022-07-07 08:14:00 【First line large size】
Official document address :Full text queries
Full text queries enable you to search and analyze text fields , E.g. email body . , Apply the same parser to process the query string ( It is the same as the parser used when indexing the text field ).
The queries in this group are :
- Full text queries that allow fine-grained control over the ordering and proximity of matches .
- Standard queries for performing full-text queries , Including fuzzy matching and phrase or proximity query .
match_bool_prefix Inquire about
- Create a
bool
Inquire about , Match each word withterm
Inquire about , Except for the last word , It matchesprefix
Inquire about .
- And
match
The query is similar to , But for exact phrase matching or word proximity matching .
match_phrase_prefix Inquire about
- And
match_phrase
The query is similar to , But do a wildcard search on the last word .
- Multi field version
match
Inquire about .
- Match multiple fields , It's like they have been indexed into a combined field .
- Support rigorous Lucene Query string syntax , Allows you to specify in a single query string AND|OR|NOT Condition and multi field search . For professional users only .
simple_query_string Inquire about
- It's simpler 、 More robust
query_string
Syntax version , Suitable for direct disclosure to users .
边栏推荐
- What is the function of paralleling a capacitor on the feedback resistance of the operational amplifier circuit
- 【數字IC驗證快速入門】15、SystemVerilog學習之基本語法2(操作符、類型轉換、循環、Task/Function...內含實踐練習)
- 复杂网络建模(一)
- Leetcode medium question my schedule I
- Content of string
- 拓维信息使用 Rainbond 的云原生落地实践
- 央视太暖心了,手把手教你写HR最喜欢的简历
- 解析创新教育体系中的创客教育
- [step on the pit series] H5 cross domain problem of uniapp
- Network learning (II) -- Introduction to socket
猜你喜欢
Leetcode simple question: find the K beauty value of a number
云原生存储解决方案Rook-Ceph与Rainbond结合的实践
uniapp 移动端强制更新功能
Rainbond结合NeuVector实践容器安全管理
一文了解如何源码编译Rainbond基础组件
[step on the pit series] H5 cross domain problem of uniapp
Vulnerability recurrence fastjson deserialization
[quick start of Digital IC Verification] 17. Basic grammar of SystemVerilog learning 4 (randomization)
LeetCode简单题之字符串中最大的 3 位相同数字
LeetCode中等题之我的日程安排表 I
随机推荐
云原生存储解决方案Rook-Ceph与Rainbond结合的实践
The simple problem of leetcode is to judge whether the number count of a number is equal to the value of the number
拓维信息使用 Rainbond 的云原生落地实践
Record a stroke skin bone error of the skirt
机器人教育在动手实践中的真理
Hisense TV starts the developer mode
Minimum absolute difference of binary search tree (use medium order traversal as an ordered array)
Implementation of replacement function of shell script
OpenVSCode云端IDE加入Rainbond一体化开发体系
Recursive method to verify whether a tree is a binary search tree (BST)
漏洞复现-Fastjson 反序列化
Jmeter 的使用
Complex network modeling (II)
漏洞复现-easy_tornado
Offer harvester: add and sum two long string numbers (classic interview algorithm question)
发挥创客教育空间的广泛实用性
Merging binary trees by recursion
Summary of redis functions
Qinglong panel - today's headlines
2022 Inner Mongolia latest advanced fire facility operator simulation examination question bank and answers