
An Optimization of Bitmap Index Compression Technique in Bulk Data Movement Infrastructure
Author(s) -
Manoj Kumar,
Tarun Kumar Gupta,
Deepak Umrao Sarwe
Publication year - 2021
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1099/1/012074
Subject(s) - bitmap , computer science , table (database) , index (typography) , cardinality (data modeling) , database index , oracle , data mining , database , information retrieval , computer graphics (images) , world wide web , search engine indexing , software engineering
An index is an optional structure, associated with a table or clustered table that can sometimes speed up data access. By creating an index on one or more columns of a table, you gain the ability, in some cases, to retrieve a small set of randomly distributed rows from the table. This research aims to free the filled disk space after documents have been erased. We verify the current compression technologies and apply the data pump to the bitmap index compression. Bitmap is more effective for minimal unique value, according to the traditional wisdom index. However, it needs no Bitmap index at high cardinality or low cardinality by data pump. In this paper we recommend a pump function for space release in the database after documentation has been removed. This utility does not free disk space even though the elimination of records from the table is seen by the Bitmap Index. To free up the room and adjust the index point position, we have introduced data pump for compression. The data pump is commonly used in oracle database for logical backups. Finally, we study the bitmap index which is widely used for industrial purposes and address unanswered questions for the future.