BST Algorithm for Duplicate Elimination in Data Warehouse

Authors

  • Payal Pahwa Bhagwan Parshuram Institute of Technology, I.P.University Delhi 110085, India
  • Rashmi Chhabra GVM Institute of Technology and Management, DCRUST ,Murthal Sonipat, Haryana 131001, India

DOI:

https://doi.org/10.24297/ijmit.v4i1.4636

Keywords:

Data cleansing, data warehouse, data cleansing techniques, binary search tree.

Abstract

Data warehousing is an emerging technology and has proved to be very important for an organization. Today every  business organization needs accurate and large amount of information to make proper decisions. For taking the business  decisions the data should be of good quality. To improve the data quality data cleansing is needed. Data cleansing is fundamental to warehouse data reliability, and to data warehousing success. There are various methods for datacleansing. This paper addresses issues related data cleaning. We focus on the detection of duplicate records. Also anefficient algorithm for data cleaning is proposed. A review of data cleansing methods and comparison between them is presented.

Downloads

Download data is not yet available.

Downloads

Published

2013-06-26

How to Cite

Pahwa, P., & Chhabra, R. (2013). BST Algorithm for Duplicate Elimination in Data Warehouse. INTERNATIONAL JOURNAL OF MANAGEMENT &Amp; INFORMATION TECHNOLOGY, 4(1), 190–197. https://doi.org/10.24297/ijmit.v4i1.4636

Issue

Section

Articles