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

slugReducing PAPR using PTS Technique having standard array in OFDM

Orthogonal frequency division multiplexing is an attractive technique for modern wireless communication and has recently been focused in high-data-rate wireless communication research. However, high peak-to-average pow...

Challenges of Exports in Small Medium Enterprise’s and Customer Relationship Management (CRM) regarding B2B E-Commerce in small and medium enterprises (sme’s) in Hyderabad

In this paper we analysed the challenges faced by the SME’S in exporting and to determine whether the CRM tools are beneficial to the companies and also the perception of the employees about the CRM applicationusing da...

Mapping the Agricultural Geography: A District Wise Pattern in the South-Eastern Part of the Punjab Province in Colonial India

The South-Eastern part of the Punjab was somewhat backward during 1858-1947. This subregion was also located away from the perennial rivers Punjab and the river Jamuna‘s course was along the eastern boundary of the stat...

Supply Chain Analytics

Curiosity in supply chain management has increased since the 1980s when firms looked the benefits of collaborative relationships within and beyond their own organization. Firms are observing that they can no longer c...

slugRobust & Accurate Face Recognition using Histograms

A large number of face recognition algorithms have been developed from decades. Face recognition systems have been grabbing high attention from commercial market point of view as well as pattern recognition field. It a...

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

How To Cite

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