4.6 Article

Aggregated Boolean Query Processing for Document Retrieval in Edge Computing

Journal

ELECTRONICS
Volume 11, Issue 12, Pages -

Publisher

MDPI
DOI: 10.3390/electronics11121908

Keywords

aggregated query processing; Boolean query; edge computing; document retrieval

Funding

  1. National Natural Science Foundation of China [62002245, 61802268]
  2. Liaoning Provincial Department of Education Science Foundation [JYT2020027]

Ask authors/readers for more resources

This paper proposes a technique for processing aggregated Boolean queries using edge computing, which demonstrates high efficiency and performance for document retrieval in search engines. Experimental results show that this technique outperforms traditional centralized methods.
Search engines use significant hardware and energy resources to process billions of user queries per day, where Boolean query processing for document retrieval is an essential ingredient. Considering the huge number of users and large scale of the network, traditional query processing mechanisms may not be applicable since they mostly depend on a centralized retrieval method. To remedy this issue, this paper proposes a processing technique for aggregated Boolean queries in the context of edge computing, where each sub-region of the network corresponds to an edge network regulated by an edge server, and the Boolean queries are evaluated in a distributed fashion on the edge servers. This decentralized query processing technique has demonstrated its efficiency and applicability for the document retrieval problem. Experimental results on two real-world datasets show that this technique achieves high query performance and outperforms the traditional centralized methods by 2-3 times.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available