Show simple item record Abusukhon, A. Talib, M. 2012-11-21T09:48:21Z 2012-11-21T09:48:21Z 2011
dc.identifier.citation Abusukhon, A. & Talib, M. (2011) Analyzing the load balance of term-based partitioning, International Journal of Advanced Computer Science and Applications, Vol. 2, No.1, pp. 18-25 en_US
dc.identifier.issn 2156-5570 (Online)
dc.identifier.issn 2158-107X (Print)
dc.description.abstract In parallel (IR) systems, where a large-scale collection is indexed and searched, the query response time is limited by the time of the slowest node in the system. Thus distributing the load equally across the nodes is very important issue. Mainly there are two methods for collection indexing, namely document-based and term-based indexing. In term-based partitioning, the terms of the global index of a large-scale data collection are distributed or partitioned equally among nodes, and then a given query is divided into sub-queries and each sub-query is then directed to the relevant node. This provides high query throughput and concurrency but poor parallelism and load balance. In this paper, we introduce new methods for terms partitioning and then we compare the results from our methods with the results from the previous work with respect to load balance and query response time. en_US
dc.language.iso en en_US
dc.publisher The Science and Information Organization Inc., en_US
dc.subject Term-partitioning schemes en_US
dc.subject Term-frequency partitioning en_US
dc.subject Term-length partitioning en_US
dc.subject Node utilization en_US
dc.subject Load balance en_US
dc.title Analyzing the load balance of term-based partitioning en_US
dc.type Published Article en_US en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record


Advanced Search


My Account