CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Efficient Approach for Compression in Data Warehouse

by Meenakshi Sharma, Sonia Dora
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 53 - Number 9
Year of Publication: 2012
Authors: Meenakshi Sharma, Sonia Dora
10.5120/8446-2233

Meenakshi Sharma, Sonia Dora . Efficient Approach for Compression in Data Warehouse. International Journal of Computer Applications. 53, 9 ( September 2012), 1-3. DOI=10.5120/8446-2233

@article{ 10.5120/8446-2233,
author = { Meenakshi Sharma, Sonia Dora },
title = { Efficient Approach for Compression in Data Warehouse },
journal = { International Journal of Computer Applications },
issue_date = { September 2012 },
volume = { 53 },
number = { 9 },
month = { September },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-3 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume53/number9/8446-2233/ },
doi = { 10.5120/8446-2233 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:53:39.183542+05:30
%A Meenakshi Sharma
%A Sonia Dora
%T Efficient Approach for Compression in Data Warehouse
%J International Journal of Computer Applications
%@ 0975-8887
%V 53
%N 9
%P 1-3
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data compression has become most requisite and necessary part of data warehousing as it helps in saving disk space and improves query performance as well. Different compression techniques exist at different levels and each type of compression is either best from query processing point of view or compression ratio. This paper focuses on lossless compression for relational databases at attribute level. Efficient compression techniques allow transferring more data on a given bandwidth. The proposed technique in this paper is used at attribute level by compressing three types of attribute (string, integer and date type) and the most interesting feature is that it automatically identifies the type of attribute.

References
  1. J. Ziv and A. Lempel "A universal algorithm for sequential data compression" in IEEE transactions in information theory, vol. 3, no. 3, pp. 337-343(1977)
  2. Amy Turske McNee "The Evolutionary Data Warehouse--An Object-Oriented Approach" (2008)
  3. Jonathan Goldstein, Raghu Ramakrishnan ,Uri Shaft "Compressing relations and indexes "in IEEE computer society Washington,USA (1998)
  4. P. O'Neil and D. Quass. "Improved query performance with variant indexes," Proceedings of the ACM SIGIOD Conference, Tucson, Arizona, May, 1997.
  5. S. Chaudhuri and U. Dyal, "An overview of Data warehousing and OLAP Technology", ACM SIGMOD record, vol 21, no. 1.
  6. W. Kim, "Modern Database Systems", ACM Press. New York, New York, 1995
  7. G. Ray, J. R. Haritsa, and S. Seshadri. Database compression: A performance enhancement tool. In International Conference on Management of Data, pages 0, 1995.
  8. Jorge Vieira1, Jorge Bernardino2, Henrique Madeira3 "Efficient compression of text attributes of data warehouse dimensions" (2005)
  9. Akanksha Baid and Swetha Krishnan" Binary Encoded Attribute-Pairing Technique for Database Compression"( 2008)
  10. Goetz Graefe and Leonard D. Shapiro" Data Compression and Database Performance"(1991)
  11. Debra A. Lelewer and Daniel S. Hirschberg"Data Compression"(1987)
Index Terms

Computer Science
Information Sciences

Keywords

Attribute compression primary key compression ratio

Powered by PhDFocusTM