Lucene架构下布尔查询的执行计划研究

Lucene是一个优秀的全文检索框架,布尔查询是其实现精准数据检索的重要功能.对于布尔查询执行计划的深入研究,有利于灵活应用布尔查询,优化查询表达式,提高执行效率.本文从Lucene架构下布尔查询的执行计划入手,研究了布尔查询的表示方式、执行时序、逻辑运算规则和子查询归并算法.根据布尔查询的执行计划,提出了深度为2的复杂布尔查询的化简规律和布尔逻辑运算满足交换律的特性,并从理论上证明它们的正确性.最后通过实验模拟仿真,验证这些规律的有效性.

A study of the execution plan of Boolean query based on Lucene

Lucene is an excellent full-text retrieval framework, and Boolean query has an important function to achieve accurate data retrieval. The in-depth study of the execution plan of Boolean query is conducive to the flexible application of Boolean query, the optimization of query expression and improvement of execution efficiency. Starting with the execution plan of Boolean query under Lucene framework, this paper studies the representation, execution sequence diagram, logical operation rules and sub-query merging algorithm of Boolean query. According to the execution plan of Boolean query, the simplification rules of complex Boolean query with the depth of 2 and the characteristics of Boolean logic operation satisfying the exchange law are proposed, and their correctness is proved theoretically. Finally, the validity of these laws is verified by experimental simulation.