Structured Data Compression - PowerPoint PPT Presentation

About This Presentation
Title:

Structured Data Compression

Description:

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. – PowerPoint PPT presentation

Number of Views:137
Updated: 10 March 2014
Slides: 7
Provided by: xtremecompression
Category: Other

less

Transcript and Presenter's Notes

Title: Structured Data Compression


1
Structured Data Compression
  • 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.

2
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.

3
Our Proprietary 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.

4
Repopulation
  • 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
    occupy memory.

5
Superpopulation
  • Superpopulation is a variable-to-variable-length
    algorithm that compresses index tables, lists,
    arrays, zerotrees, and similar data. It
    systematically accommodates wide local variations
    in data statistics. Superpopulation may be used
    by itself or in conjunction with repopulation.

6
For More Information Please Visit
http//www.xtremecompression.com
Write a Comment
User Comments (0)
About PowerShow.com