Content-Aware Compression of Structured Data
|
|
What We Are and What We Do
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 required.
Why We're Different, Better, & Smarter
We're different because our technology is content-aware, semantic, and targets structured data; better because we deliver more compression and faster decompression simultaneously; and smarter because we realize how modern data have made parts of information theory obsolete.
Applications
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.
Software Implementation
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.
|
Xtreme Compression's proprietary technology reduces storage costs and speeds data transfer and program execution. Here is how:
- By concentrating more information into every physical word read from memory and processed by the CPU, reducing the influence of the ‘von Neumann bottleneck’
- By reducing transmission time over links, networks, and other expensive-to-scale infrastructure components
- By storing more information in internal caches to improve data locality and cache hit rates
- By increasing effective disk cache size to retrieve more real information from hard disk per read operation
- By allowing storage on faster media (i.e., RAM vs hard disk, hard disk vs CD or DVD, local hard disk vs network, etc.)
- By permitting more access data structures and paths for a given amount of storage
- In some applications, by relaxing hash table load factors, reducing collision frequencies
|
|