Efficient Document Partitioning for Load Balancing between Servers Using Term Frequency of Past Queries

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Torab Jahromi S.R.; Zarifzadeh s.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR Year:2019 | Volume:17 | Issue:3 Page(s): 199-208

Download Full-Text

Persian Verion

View:

477

Download:

Cites:

Information Journal Paper

Title

Efficient Document Partitioning for Load Balancing between Servers Using Term Frequency of Past Queries

Author(s)

Torab Jahromi S.R. | Zarifzadeh s. | Issue Writer Certificate

Keywords

Load balancingQ1

document partitioningQ1

history of queriesQ1

search engineQ1

Abstract

The main goal of web search engines is to find the most relevant results with respect to the user query in a shortest possible time. To do so, the crawled documents have to be partitioned between several servers in order to use their aggregate retrieval and processing power. The search engines use different policies for efficient partitioning of documents. In this paper, we propose a new document partitioning method that intends to balance the load between servers to reduce the response time of queries. The idea is to weigh each term based on its daily frequency in log of past queries. We then assign a weight to each document via summing the weight of its substituent terms. The weight of a document approximates the likelihood of its presence in future search results. Finally, the documents are partitioned between servers in a way that the sum of document weights in each server becomes roughly equal. Our evaluation results show that the proposed method is able to balance the load by about 20% better than former algorithms, especially in the peak of search engine traffic.

Cites

No record.

References

No record.

Cite

Related Journal Papers