Fastest Compression Software .pdf
Original filename: Fastest Compression Software.pdf
Title: Easy-to-use video recording software
This PDF 1.5 document has been generated by Microsoft® Office PowerPoint® 2007, and has been sent on pdf-archive.com on 04/08/2014 at 07:31, from IP address 182.64.x.x.
The current document download page has been viewed 495 times.
File size: 868 KB (6 pages).
Privacy: public file
Download original PDF file
Xtreme Compression, Inc. is a software design consultancy with special
expertise in structured data compression. We apply our proprietary
algorithms and source code to compress and encrypt structured data
whenever performance beyond the reach of conventional methods is
We're different because our technology is content-aware, semantic, and
targets structured data. We're better because we deliver more compression
and faster decompression simultaneously.
We target in-memory DBMSs, analytics, business intelligence, data mining,
data warehousing, and other read-intensive applications with discrete
structured data; plus wireless devices, mobile apps, and infrastructures
constrained by bandwidth, latency, memory, and/or power.
Typically, data structures are compressed and encrypted individually,
and then used in that form. Decompression is generally encapsulated
and invisible above the lowest software levels. Doing that sets a distinct
level above which the host system remains unchanged.
Your Competitive Advantage
Your advantage is compression performance so far beyond the reach
of conventional methods that otherwise-infeasible products,
services, and operations can now become reality.
Data Compression Methods
Attribute vector coding is the first vector transform method for compressing
multidimensional database tables. It is tuple-oriented and semantic. It breaks
new ground by capturing and exploiting the innumerable relationships,
functional dependencies, and statistical correlations in data without having
to solve the intractable problem of explicitly identifying and defining them.
It achieves unequaled compression because it systematically models data at
the highest levels of abstraction, across dimensions and data types. That
makes it far less subject than conventional methods to compressibility limits
imposed by information theory.
Attribute vector coding recovers an empirical understanding of the processes
that created the data and then strives to emulate those processes through
functions embodied in software and codified in data. To that end, it captures
and exploits prior knowledge regardless of whether that knowledge can be
explicitly identified and defined.
Repopulation is a structural method for compressing the common
configuration of access data structures consisting of separate hash and
collision tables, and handling collisions – sequences of database record
numbers – through external chaining. It populates hash table locations that
would otherwise be empty with parts of collision strings that would otherwise
Unlike almost every other lossless compression method, repopulation is not a
replacement scheme. Instead, repopulation is permutational and mechanistic;
it works like a chess-playing automaton. It draws on no information-theoretic
concepts. Repopulation simultaneously achieves the access speed of a low
hash table load factor and the table compactness of a high one, thus avoiding
that historical compromise.
Beyond the State of the Art
Xtreme Compression's proprietary compression technology delivers
performance beyond the reach of conventional methods. Here is why:
•The exchange principle states that during design, moving function and
algorithmic complexity from decompression to compression and from
encoding to modeling can simultaneously increase compression efficacy and
decrease decompression time. It aligns the otherwise-competing performance
goals of compression ratio and decompression speed, eliminating historical
•The sequence-symbol continuum principle states that for every discrete
message, a sequence-symbol continuum exists with which the message can
be separated into sequences of symbols. At one extreme, each entity is treated
as an atomic symbol, so the symbols have no substructure, and the sequence
is maximally complex dimensionally and statistically. At the other, a single
symbol having maximally complex substructure represents the entire
message, so there is no sequence.
1447 Waterfront Rd, Reston,
VA 20194, United States
Call : (571) 235-8787