DocumentCode
3421956
Title
A fast algorithm for lossless compression of data tables by reordering
Author
Vucetic, Slobodan
Author_Institution
Center for Inf. Sci. & Technol., Temple Univ., Philadelphia, PA
fYear
2006
fDate
28-30 March 2006
Lastpage
469
Abstract
Summary form only given. An algorithm for lossless compression of tables with numeric attributes based on row ordering is proposed. Extensive experiments were performed on randomly generated and scientific multidimensional tables with numerical attributes. The results showed that ordering is useful for compression of moderately large to large tables with intrinsic dimensionality below 20 and with attributes represented with low to moderate precision. The benefits of the iterative ordering procedure are the largest on data tables with correlated attributes and heterogeneous attribute types
Keywords
data compression; matrix algebra; data tables; heterogeneous attribute types; iterative ordering procedure; lossless compression; scientific multidimensional tables; Binary trees; Cities and towns; Clustering algorithms; Convergence; Gaussian distribution; Information science; Iterative algorithms; Partitioning algorithms; Predictive coding; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2006. DCC 2006. Proceedings
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
0-7695-2545-8
Type
conf
DOI
10.1109/DCC.2006.1
Filename
1607312
Link To Document