Highly compressed randomly accessed storage of large tables with arbitrary columns
US7496589B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 9, 2005 |
| Grant date | Feb 24, 2009 |
| Priority date | — |
| Expiry date | Apr 16, 2026 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99943
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
A table, such as a database table can be partitioned into blocks that are conveniently sized for storage and retrieval. The amount of storage space required and the speed of storing and retrieving blocks is proportional to the size of the blocks. Compressing the blocks leads to less required space and more speed. The columns in a table, and therefore the rows in a transposed block, tend to contain similar data. Compression algorithms can work more efficiently when sequential data items are similar. Therefore, transposing the blocks before compression or compressing them in a column-wise manner leads to better compression. Different compression algorithms can be used for each set of columnar data to yield even better compression.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.