An Algebraic Method for Compressing Very Large Symbolic Data Tables
Yannis Tzitzikas, Rue Grandgagnage · 2004
Although symbolic data tables summarize huge sets of data they can still become very large in size. This paper proposes a method for compressing a symbolic data table using the recently emerged Compound Term Composition Algebra. One charisma of CTCA is that the closed world hypotheses of its operations can lead to a remarkably high "compression ratio". The compacted form apart from having much lower storage space requirements, it allows designing more e#cient algorithms for symbolic data analysis.