Data String Compression using K-Nets

International Journal of Artificial Intelligence and Knowledge Discovery

Kumar Sourav¹ 

[1] CSC India

关键词: Compression;    String;    KNet;    Storage;   

DOI  :  

学科分类：建筑学

来源: RG Education Society

【 摘 要 】

Data compression is required to compress given data in order to save space on storage devices and remove unnecessary redundancies in given data. Data mainly consists of strings of characters and digits. Data compression algorithms are mainly lossless or lossy. In lossless algorithms no data is lost during operation and in lossy algorithm data is lost during operation but compression is more. Data can be compressed by exploiting factors like : repetition of characters, using dictionary , prediction etc. This paper is about compression of Data Strings used in various programming languages using the technique of K-Nets which is lossless technique. A K-Net can be an Ndimensional geometrical figure which is generally a square or a rectangle for N=2 or in two dimensional plane. In this papaer we will firstly represent a Data string of characters using a points in the K-Net plane and then later calculate the space saved by the technique to represent data string's for long data string's. The programming language used in this paper for performance analysis and calculating results is JAVA.

【 授权许可】

Unknown