Handling Complex Queries Using Query Trees
preprintposted on 2021-06-26, 23:25 authored by Srihari Vemuru, Eric John, Shrisha RaoShrisha Rao
Humans can easily parse and find answers to complex queries such as "What was the capital of the country of the discoverer of the element which has atomic number 1?" by breaking them up into small pieces, querying these appropriately, and assembling a final answer. However, contemporary search engines lack such capability and fail to handle even slightly complex queries. Search engines process queries by identifying keywords and searching against them in knowledge bases or indexed web pages. The results are, therefore, dependent on the keywords and how well the search engine handles them. In our work, we propose a three-step approach called parsing, tree generation, and querying (PTGQ) for effective searching of larger and more expressive queries of potentially unbounded complexity. PTGQ parses a complex query and constructs a query tree where each node represents a simple query. It then processes the complex query by recursively querying a back-end search engine, going over the corresponding query tree in postorder. Using PTGQ makes sure that the search engine always handles a simpler query containing very few keywords. Results demonstrate that PTGQ can handle queries of much higher complexity than standalone search engines.
Email Address of Submitting Authorshrao@ieee.org
ORCID of Submitting Author0000-0003-0625-5103
Submitting Author's InstitutionInternational Institute of Information Technology - Bangalore
Submitting Author's Country