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

ECONOMIC ANALYSIS OF COST AND RETURN, AND PROFITABILITY OF SUGARCANE PRODUCTION IN CUDDALORE DISTRICT, TAMIL NADU

Sugarcane is a long duration crop and it is the source of white sugar and goor. But sugarcane area is decreasing day by day during the period of 2009-10,2010-11 and 2011-12 total sugarcane area were 1.18 lack ha, 1.16...

A FUSION BASED COOPERATIVE SPECTRUM SENSING DETECTION TECHNIQUES

Recent advances in communication technologies and the proliferation of wireless computing and communication devices make the radio spectrum overcrowded. However, experiments from the Federal Communication Commission (F...

User training is a major challenge in the implementation of GRP systems- A study of National Animal Disease Reporting System (NADRS) at Bangalore District

In the recent years there has been enhancement in exercising the ERP/GRP applications in big concerns particularly in government organizations. As such the state governments are also adopting e-governance wherever po...

Role of Internet in Education of Commerce Students

Background Introduction of globally adopted modern technologies in the field of education provides an opportunity for modernization teaching methods, E-Learning and the facility to gain knowledge in each language, bet...

Prospects and Challenges of Micro Insurance Investment in South West Ethiopia- Bench Maji zone

In developing countries micro insurance has a great potential of covering large number of people through market based risk transfer solutions and public private partnership. As a result , this will enables to get high...

Download PDF file
  • EP ID EP18436
  • DOI -
  • Views 323
  • Downloads 11

How To Cite

N. Venkatesan and E. Ramaraj (2012). BIT SEARCHING TECHNIQUE. International Journal of Management, IT and Engineering, 2(7), -. https://europub.co.uk./articles/-A-18436