Abstract
Boolean query is an important method to achieve accurate data retrieval. The deeply study of Boolean query’s implementation strategy is conducive to flexible application of Boolean query, optimization of query expression and improvement of execution efficiency. Starting with the implementation strategy of Boolean query in Lucene framework, this paper studies the representation, execution sequence diagram, logical operation rules and sub-query merging algorithm. According to the implementation strategy, the simplification rules of complex Boolean query with depth of 2 are proposed, and their correctness is proved theoretically. Finally, the validity of these laws is verified by experimental simulation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: DEStech Transactions on Computer Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
