18137321. TECHNIQUES FOR ADAPTIVE INDEPENDENT COMPRESSION OF KEY AND NON-KEY PORTIONS OF DATABASE ROWS IN INDEX ORGANIZED TABLES (IOTS) simplified abstract (Oracle International Corporation)
Contents
- 1 TECHNIQUES FOR ADAPTIVE INDEPENDENT COMPRESSION OF KEY AND NON-KEY PORTIONS OF DATABASE ROWS IN INDEX ORGANIZED TABLES (IOTS)
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 TECHNIQUES FOR ADAPTIVE INDEPENDENT COMPRESSION OF KEY AND NON-KEY PORTIONS OF DATABASE ROWS IN INDEX ORGANIZED TABLES (IOTS) - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Original Abstract Submitted
TECHNIQUES FOR ADAPTIVE INDEPENDENT COMPRESSION OF KEY AND NON-KEY PORTIONS OF DATABASE ROWS IN INDEX ORGANIZED TABLES (IOTS)
Organization Name
Oracle International Corporation
Inventor(s)
Kamaljit Shergill of Maidenhead (GB)
Aurosish Mishra of Foster City CA (US)
TECHNIQUES FOR ADAPTIVE INDEPENDENT COMPRESSION OF KEY AND NON-KEY PORTIONS OF DATABASE ROWS IN INDEX ORGANIZED TABLES (IOTS) - A simplified explanation of the abstract
This abstract first appeared for US patent application 18137321 titled 'TECHNIQUES FOR ADAPTIVE INDEPENDENT COMPRESSION OF KEY AND NON-KEY PORTIONS OF DATABASE ROWS IN INDEX ORGANIZED TABLES (IOTS)
Simplified Explanation
The patent application describes techniques for adaptive, independent compression of key and non-key sections of rows in index-organized tables (IOTs). Here is a simplified explanation of the patent:
- An index-organized table (IOT) is stored with rows containing key and non-key sections.
- Compression is applied to either the key section, the non-key section, or both using different techniques.
- Compression techniques are determined based on data access history of the sections.
Potential Applications
The technology described in the patent application could be applied in database management systems, data storage systems, and data processing systems to optimize storage and retrieval of information.
Problems Solved
1. Efficient storage of data in index-organized tables. 2. Improved data retrieval performance by reducing storage space and access time.
Benefits
1. Reduced storage requirements. 2. Faster data retrieval. 3. Adaptive compression based on data access patterns.
Potential Commercial Applications
Optimizing storage in cloud databases, improving performance in big data analytics platforms, enhancing data processing efficiency in enterprise systems.
Possible Prior Art
One possible prior art could be the use of compression techniques in database systems to optimize storage and retrieval of data.
Unanswered Questions
How does the compression technique adapt to changing data access patterns over time?
The patent application does not provide details on how the compression techniques adjust based on evolving data access history.
What impact does the compression of key and non-key sections have on query performance in database systems?
The patent application does not address the potential effects of compression on query processing speed and efficiency.
Original Abstract Submitted
Techniques for adaptive, independent compression of key and non-key sections of rows in index-organized tables (IOTs) are provided. In one technique, an IOT is stored that comprises a plurality of rows, each of which comprises a key section and a non-key section. After storing the IOT, a compression technique is performed on the non-key section of each row in the plurality of rows to generate a plurality of compressed non-key sections. However, none of the key sections of the plurality of rows is compressed. In a related technique, instead of compressing the non-key section of each row, the key section of each row is compressed. In a related technique, both sections are compressed, but using different compression techniques. The compression techniques may be determined based on data access history of the different sections of the rows.
