1,721,126 research outputs found
Enhanced divide-and-conquer algorithm with 2-block policy
No full textThe number of comparisons involved in searching minimum
and maximum elements from a set of data will determine
the performance of an algorithm. A Divide-and-Conquer
algorithm is the most efficient algorithm for searching
minimum and maximum elements of a set of data of any
size. However, the performance of this algorithm can still
be improved by reducing the number of comparisons of
certain sets of data. In this paper a 2-block (2B) policy
under the divide-and-conquer technique is proposed in
order to deal with this problem. On the basis of this policy,
the divide-and-conquer algorithm is enhanced. It is shown
that the performance of the proposed algorithm performs
equally at par when compared with the established
algorithm of data size of power of two and better when
compared with data size of not a power of two
A method of estimating aborted transaction in the database concurrency control system
No full textTransactions may be aborted when they are unable to
obtain a lock on a required data item. Estimating the
proportion of transaction that aborts is one of the key
issues in modelling a system which affect the performance
measures of interest such as average response time and the
throughput capacity of the system. This paper shows a
method of estimating aborted transaction and performs a
comparative study with other method given by Mitrani et
al
ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository
Get PDFMost of the algorithm and data structure facing a computational problem when they are required to deal with a highly sparse and dense dataset. Therefore, in this paper we proposed a complete model for mining least patterns known as Efficient Least Pattern Mining Model (ELP-M2) with LP-Tree data structure and LP-Growth algorithm. The comparative study is made with the well-know LP-Tree data structure and LP-Growth algorithm. Two benchmarked datasets from FIMI repository called Kosarak and T40I10D100K were employed. The experimental results with the first and second datasets show that the LP-Growth algorithm is more efficient and outperformed the FP-Growth algorithm at 14% and 57%, respectively
Efficient access of replicated data in distributed database systems
No full textReplication is a useful technique for distributed database systems where a data
object will be accessed (i.e., read and written) from multiple locations such as
from a local area network environment or geographically distributed world wide.
This technique is used to provide high availability, fault tolerance, and enhanced
performance
Decision Support Model in Determining Factors and Its Dominant Criteria Affecting Cholesterol Level Based on Rough-Regression
No full text
- …
