BIT SEARCHING TECHNIQUE
Journal Title: International Journal of Management, IT and Engineering - Year 2012, Vol 2, Issue 7
Abstract
Searching algorithms are closely related to the concept of dictionaries. String searching algorithms are too complex in all sorts of applications. To analyze an algorithm is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps (time complexity) or storage locations (space complexity). Time efficiency estimates depend on what defined to be all step. For the analysis to correspond usefully to the actual execution time, the time required to perform a step must be guaranteed to be bounded above by a constant. The main objective of this paper is to reduce the scanning the dataset by introducing new searching technique. So far, arrays, trees, hashing, depth first, breadth first, prefix tree based searching are used in association rule mining algorithms. If the size of the input is large, run time analysis of the algorithm is also increased. In this paper, a novel data structure is introduced so that it reduced dataset scan to one search. This new search technique is bit search. This bit search technique is to find the kth itemsets (where k =1,2,3,……n) in one search scan.
Authors and Affiliations
N. Venkatesan and E. Ramaraj
Keywords
Related Articles
- EP ID EP18436
- DOI -
- Views 296
- Downloads 11
Generation of Intelligent Assessment Sheet with Compound Criteria in Adaptive Learning System
The computer assisted testing has proven to be an efficient and effective way to evaluate students‟ learning status such that proper tutoring strategies can be adopted to improve their learning performance. In a testin...
BIANCHI TYPE-I COSMOLOGICAL MODELS WITH VARYING COSMOLOGICAL TERM-
In this paper, we investigate variation law for cosmological constant in the background of anisotropic Banchi type I space-time. We consider a particular form of cosmological term as = R / R , where R is a aver...
slugA Study on the Job Stress in Association with Personal Attributes of University Employees in Nepal
The study attempts to examine the association of the perceived job stress with some demographic, economic and job attributes of the university employees in Nepal. The analysis of data collected from the sample of 44 em...
slugA Review Of Web Mining Research
Today, with the huge amount of information available online, the World Wide Web is a fertile area for data mining research. Nowadays Web users are facing the problems of information overload and drowning due to the sig...
slugDevelopment Of Error Control Coding Technique In Digital Communication System
During digital data transmission in digital communication system, noise is added and physical defects in the communication medium can cause random errors during data transmission. Error coding is a method of detecting...